Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies

Yuliya Gaidamaka; Alexander Pechinkin; Rostislav Razumchik; Konstantin Samouylov; Eduard Sopin

International Journal of Applied Mathematics and Computer Science (2014)

  • Volume: 24, Issue: 3, page 519-534
  • ISSN: 1641-876X

Abstract

top
Hysteretic control of arrivals is one of the most easy-to-implement and effective solutions of overload problems occurring in SIP-servers. A mathematical model of an SIP server based on the queueing system M [ X ] | G | 1 L , H | H , R with batch arrivals and two hysteretic loops is being analyzed. This paper proposes two analytical methods for studying performance characteristics related to the number of customers in the system. Two control policies defined by instants when it is decided to change the system’s mode are considered. The expression for an important performance characteristic of each policy (the mean time between changes in the system mode) is presented. Numerical examples that allow comparison of the efficiency of both policies are given.

How to cite

top

Yuliya Gaidamaka, et al. "Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies." International Journal of Applied Mathematics and Computer Science 24.3 (2014): 519-534. <http://eudml.org/doc/271861>.

@article{YuliyaGaidamaka2014,
abstract = {Hysteretic control of arrivals is one of the most easy-to-implement and effective solutions of overload problems occurring in SIP-servers. A mathematical model of an SIP server based on the queueing system $M^\{[X]\}|G|1⟨L,H⟩|⟨H,R⟩$ with batch arrivals and two hysteretic loops is being analyzed. This paper proposes two analytical methods for studying performance characteristics related to the number of customers in the system. Two control policies defined by instants when it is decided to change the system’s mode are considered. The expression for an important performance characteristic of each policy (the mean time between changes in the system mode) is presented. Numerical examples that allow comparison of the efficiency of both policies are given.},
author = {Yuliya Gaidamaka, Alexander Pechinkin, Rostislav Razumchik, Konstantin Samouylov, Eduard Sopin},
journal = {International Journal of Applied Mathematics and Computer Science},
keywords = {queueing system; batch arrival; general service time; overload; hysteretic load control},
language = {eng},
number = {3},
pages = {519-534},
title = {Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies},
url = {http://eudml.org/doc/271861},
volume = {24},
year = {2014},
}

TY - JOUR
AU - Yuliya Gaidamaka
AU - Alexander Pechinkin
AU - Rostislav Razumchik
AU - Konstantin Samouylov
AU - Eduard Sopin
TI - Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies
JO - International Journal of Applied Mathematics and Computer Science
PY - 2014
VL - 24
IS - 3
SP - 519
EP - 534
AB - Hysteretic control of arrivals is one of the most easy-to-implement and effective solutions of overload problems occurring in SIP-servers. A mathematical model of an SIP server based on the queueing system $M^{[X]}|G|1⟨L,H⟩|⟨H,R⟩$ with batch arrivals and two hysteretic loops is being analyzed. This paper proposes two analytical methods for studying performance characteristics related to the number of customers in the system. Two control policies defined by instants when it is decided to change the system’s mode are considered. The expression for an important performance characteristic of each policy (the mean time between changes in the system mode) is presented. Numerical examples that allow comparison of the efficiency of both policies are given.
LA - eng
KW - queueing system; batch arrival; general service time; overload; hysteretic load control
UR - http://eudml.org/doc/271861
ER -

References

top
  1. Abaev, P., Gaidamaka, Y. and Samouylov, K. (2011). Signaling load hysteretic control in the SIP-servers network, Bulletin of Peoples' Friendship University of Russia: Mathematics, Informatics, Physics 1(4): 54-71. 
  2. Abaev, P., Gaidamaka, Y. and Samouylov, K. (2012a). Queuing model for loss-based overload control in a SIP server using a hysteretic technique, in S. Andreev, S. Balandin and Y. Koucheryavy (Eds.), Internet of Things, Smart Spaces, and Next Generation Networking, Springer-Verlag, Berlin, pp. 371-378. 
  3. Abaev, P.O., Gaidamaka, Y.V., Pechinkin, A.V., Razumchik, R.V. and Shorgin, S.Y. (2012b). Simulation of overload control in SIP server networks, Proceedings of the 26th European Conference on Modelling and Simulation, ECMS 2012, Koblenz, Germany, pp. 533-539. 
  4. Abaev, P., Gaidamaka, Y., Samouylov, K., Pechinkin, A., Razumchik, R. and Shorgin, S. (2014). Hysteretic control technique for overload problem solution in network of SIP servers, Computing and Informatics 33(1): 1-18. 
  5. Bekker, R. (2009). Queues with levy input and hysteretic control, Queueing Systems 63(1): 281-299. Zbl1190.90049
  6. Benaboud, H. and Mikou, N. (2002). Analysis by queuing model of multi-threshold mechanism in ATM switches, Proceedings of the 5th IEEE International Conference on High Speed Networks and Multimedia Communications, HSNMC 2002, Jeju Island, Korea, pp. 147-151. 
  7. Bocharov, P.P., D'Apice, C., Pechinkin, A.V. and Salerno, S. (2004). Queueing Theory, VSP, Utrecht/Boston, MA. Zbl1061.60093
  8. Brown, P., Chemouil, P. and Delosme, B. (1984). A congestion control policy for signalling networks, Proceedings of the 7th International Conference on Computer Communications, ICCC 1984, Sydney, Australia, pp. 717-724. 
  9. Dshalalow, J.H. (1997). Queueing systems with state dependent parameters, in J. Dshalalow (Ed.), Frontiers in Queueing: Models and Applications in Science and Engineering, CRC Press, Boca Raton, FL, pp. 61-116. Zbl0871.60076
  10. Gebhart, R.F. (1967). A queuing process with bilevel hysteretic service-rate control, Naval Research Logistics Quarterly 14(1): 55-68. 
  11. Golubchik, L. and Lui, J.C.S. (1997). Bounding of performance measures for a threshold-based queueing system with hysteresis, Proceedings of the ACM SIGMETRICS Conference, ACC 2001, Seattle, WA, USA, pp. 147-157. 
  12. Hilt, V., Noel, E., Shen, C. and Abdelal, A. (2011). Design considerations for session initiation protocol (SIP) overload control, Technical Report RFC-6357, Internet Engineering Task Force. 
  13. Kaczorek, T. (2013). Minimum energy control of positive continuous-time linear systems with bounded inputs, International Journal of Applied Mathematics and Computational Science 23(4): 725-730, DOI: 10.2478/amcs-2013-0054. Zbl1285.49002
  14. Krasnoselskii, M.A. and Pokrovskii, A.V. (1989). Systems with Hysteresis, Springer-Verlag, Berlin/Heidelberg. 
  15. Moltchanov, D., Koucheryavy, Y. and Harju, J. (2006). Loss performance model for wireless channels with autocorrelated arrivals and losses, Computer Communications 29(13-14): 2646-2660. 
  16. Olwal, T.O., Djouani, K., Kogeda, O.P. and van Wyk, B.J. (2012). Joint queue-perturbed and weakly coupled power control for wireless backbone networks, International Journal of Applied Mathematics and Computational Science 22(3): 749-764, DOI: 10.2478/v10006-012-0056-z. Zbl1302.93012
  17. Pechinkin, A.V., Razumchik, R.V. (2013a). Approach for analysis of M₂|M₂|1|R with hysteric policy for SIP server hop-by-hop load control, Proceedings of the 27th European Conference on Modelling and Simulation, ECMS 2013, Alesund, Norway, pp. 573-579. 
  18. Pechinkin, A.V., Razumchik, R.V. (2013b). Stationary distribution of M₂|G|1|r queue with bi-level hysteric policy, Journal of Communications Technology and Electronics 58(12): 1220-1229. 
  19. Roughan, M. and Pearce, C. (2000). A martingale analysis of hysteretic overload control, Advances in Performance Analysis: A Journal of Teletraffic Theory and Performance Analysis of Communication Systems and Networks 3(1): 1-30. 
  20. Russell, T. (2006). Signaling System #7, 5th Edition, McGraw-Hill, New York, NY. 
  21. Sindal, R. and Tokekar, S. (2008). Modeling and analysis of voice/data call admission control scheme in CDMA cellular network for variation in soft handoff threshold parameters, Proceedings of the 16th IEEE International Conference on Networks, ICON 2008, New Delhi, India, pp. 1-6. 
  22. Takagi, H. (1985). Analysis of a finite-capacity M/G/1 queue with a resume level, Performance Evaluation 5(3): 197-203. Zbl0571.68027
  23. Takshing, P. Y. and Yen, H.-M. (1983). Design algorithm for a hysteresis buffer congestion control strategy, Proceedings of the IEEE International Conference on Communications, Boston, MA, USA, pp. 499-503. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.