Vacation Queueing Model for Performance Evaluation of Multiple Access Information Transmission Systems without Transmission Interruption

We consider a MAP/PH/1-type queueing system with server vacations as a model that is useful for the analysis of multiple access systems with polling discipline without transmission interruption. Vacation of the server corresponds to the service providing competitive information flows to the polling system. In this paper, we consider a vacation queueing model under pretty general assumptions about the probabilistic distributions describing the behavior of the system and the realistic assumption, in many real-world systems, that ongoing service cannot be terminated ahead of schedule. We derive the criterion of the stable operation of the system and the stationary distributions of the system states and the waiting time. An illustrative numerical example is presented.

[1]  David M. Lucantoni,et al.  New results for the single server queue with a batch Markovian arrival process , 1991 .

[2]  Onno Boxma,et al.  Polling: past, present, and perspective , 2018, TOP.

[3]  Alexander Moiseev,et al.  Multi-level MMPP as a Model of Fractal Traffic , 2021 .

[4]  Hideaki Takagi,et al.  Queueing analysis of polling models: progress in 1990-1994 , 1998 .

[5]  A. Dudin,et al.  Analysis of Queueing System with Non-Preemptive Time Limited Service and Impatient Customers , 2020, Methodology and Computing in Applied Probability.

[6]  Kin K. Leung.  Cyclic-service systems with nonpreemptive, time-limited service , 1994, IEEE Trans. Commun..

[7]  Naishuo Tian,et al.  Vacation Queueing Models Theory and Applications , 2006 .

[8]  Daniel P. Heyman,et al.  Modeling multiple IP traffic streams with rate limits , 2003, TNET.

[9]  Vladimir Vishnevsky,et al.  Polling Systems and Their Application to Telecommunication Networks , 2021, Mathematics.

[10]  Alexander N. Dudin,et al.  Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory , 2006, Queueing Syst. Theory Appl..

[11]  Sلأren Asmussen,et al.  Applied Probability and Queues , 1989 .

[12]  Christoph Lindemann,et al.  Modeling IP traffic using the batch Markovian arrival process , 2003, Perform. Evaluation.

[13]  Tsuyoshi Katayama,et al.  Analysis of a nonpreemptive priority queue with exponential timer and server vacations , 2007, Perform. Evaluation.

[14]  Tsuyoshi Katayama,et al.  Analysis of a time-limited service priority queueing system with exponential timer and server vacations , 2007, Queueing Syst. Theory Appl..

[15]  V. Ramaswami,et al.  Advances in Probability Theory and Stochastic Processes , 2001 .

[16]  V. M. Vishnevskii,et al.  Mathematical methods to study the polling systems , 2006 .

[17]  Alexander N. Dudin,et al.  Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks , 2017, Automation and Remote Control.

[18]  D. van Dantzig.  Chaînes de Markof dans les ensembles abstraits et applications aux processus avec régions absorbantes et au problème des boucles , 1955 .