Analysis of an MG1R queue with batch arrivals and two hysteretic overload control policies

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] G1(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. © 2014 by Yuliya Gaidamaka.

Authors
Gaidamaka Y. 1 , Pechinkin A. 2 , Razumchik R. 1, 2 , Samouylov K. 1 , Sopin E. 1
Journal
International Journal of Applied Mathematics and Computer Science
Publisher
Walter de Gruyter GmbH
Number of issue
3
Language
English
Pages
519-534
Status
Published
Link
External link
DOI
10.2478/amcs-2014-0038
Volume
24
Year
2014
Organizations
  • 1 Department of Applied Probability and Informatics, Peoples' Friendship University of Russia, Miklukho-Maklaya str., 6, Moscow, 117198, Russian Federation
  • 2 Institute of Problems of Informatics, Russian Academy of Sciences, Vavilova str., 44-2, Moscow, 119333, Russian Federation
Keywords
batch arrival; general service time; hysteretic load control; overload; queueing system
Date of creation
19.10.2018
Date of change
15.02.2021
Short link
https://repository.rudn.ru/en/records/article/record/4953/
Share

Other records