Analysis of a Finite-Capacity M|G|1|r Queue with Threshold Overload Control

Cover Page

Cite item


One of the main challenges faced by telecommunications industry today is an issue of searching for the most effective overload control mechanisms on SIP servers. Generally, overload occurs in SIP networks when SIP servers have insufficient resources to handle all SIP messages they receive to handle all incoming SIP traffic. Such problems can decrease performance of SIP server or even cause its crash. The IETF offers several solutions depending on types of overloads: to increase the number of SIP servers, through 503 (Service Unavailable) response code (IETF RFC 3261), rate-based overload control, loss-based overload control. However, SIP servers are still vulnerable to overload. In this paper we have built and analyzed the M|G|1|r queue with one level hysteretic input load control. Stationary distribution has been achieved based on the Embedded Markov chain method. Approach that allows computation of probability of loss and an average length of queue is developed. Another important parameter, the return time from overloading states to normal state is also considered. A numerical example illustrating the control mechanism that minimizes this characteristic is given to demonstrate some optimization issues.

About the authors

Y V Gaidamaka

Peoples’ Friendship University of Russia


R I Zakirova

Peoples’ Friendship University of Russia



Copyright (c) 2014 Гайдамака Ю.В., Закирова Р.И.

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies