Analysis of Queueing System with Constant Service Time for SIP Server Hop-by-Hop Overload Control

  • Pavel Abaev
  • Alexander Pechinkin
  • Rostislav Razumchik
Part of the Communications in Computer and Information Science book series (CCIS, volume 356)


Consideration is given to the analysis of queueing system M 2|D|1|R with bi-level hysteretic input load control that can model signalling hop-by-hop overload control mechanism for SIP servers described in RFC 6357. Bi-level hysteretic input load control implies that system may be in three states (normal, overloaded, blocking), depending on the total number of customers present in it, and upon each state change input flow rate is adjusted. New approach that allows fast computation of joint stationary probability distribution is proposed, expressions for important performance characteristics are given.


SIP server hop-by-hop mechanism loss-based overload control constant service rate queueing model 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abaev, P., Gaidamaka, Y., Pechinkin, A., Razumchik, R., Shorgin, S.: Simulation of overload control in SIP server networks. In: Proc. of the 26th European Conference on Modelling and Simulation, pp. 533–539 (2012)Google Scholar
  2. 2.
    Hilt, V., Noel, E., Shen, C., Abdelal, A.: Design Considerations for Session Initiation Protocol (SIP) Overload Control. RFC6357 (2011)Google Scholar
  3. 3.
    Abaev, P., Gaidamaka, Y., Samouylov, K.E.: Queuing Model for Loss-Based Overload Control in a SIP Server Using a Hysteretic Technique. In: Andreev, S., Balandin, S., Koucheryavy, Y. (eds.) NEW2AN/ruSMART 2012. LNCS, vol. 7469, pp. 371–378. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  4. 4.
    Zhernoviy, K.Y., Zhernoviy, Y.V.: Queueing system M θ|G|1|m with bi-level hysteric strategy of service rates switch-over. J. Information Processes. 12(2), 127–140 (2012) (in Russian)Google Scholar
  5. 5.
    Avrachenkov, K., Dudin, A., Klimenok, V., Nain, P., Semenova, O.: Optimal threshold control by the robots of web search engines with obsolescence of documents. J. Computer Networks 55(8), 1880–1893 (2011)CrossRefGoogle Scholar
  6. 6.
    Semenova, O.: Optimal hysteresis control for BMAP/SM/1 queue with MAP-input of disasters. J. Quality Technology and Quantitative Management 4(3), 395–405 (2007)MathSciNetGoogle Scholar
  7. 7.
    Kim, C., Klimenok, V., Birukov, A., Dudin, A.: Optimal multi-threshold control by the BMAP/SM/1 retrial system. Annals of Operations Research 141(1), 193–210 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Bocharov, P., D’Apice, C., Pechinkin, A., Salerno, S.: Queueing Theory. VSP Publishing, Utrecht (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Pavel Abaev
    • 1
  • Alexander Pechinkin
    • 2
    • 1
  • Rostislav Razumchik
    • 2
    • 1
  1. 1.Peoples Friendship UniversityMoscowRussia
  2. 2.Institute of Informatics Problems of Russian Academy of SciencesMoscowRussia

Personalised recommendations