Time-limited and k-limited polling systems: a matrix analytic solution

In this paper, we will develop a tool to analyze polling systems with the autonomous-server, the time-limited, and the k-limited service discipline. It is known that these disciplines do not satisfy the well-known branching property in polling system, therefore, hardly any exact result exists in the literature for them. Our strategy is to apply an iterative scheme that is based on relating in closed-form the joint queue-length at the beginning and the end of a server visit to a queue. These kernel relations are derived using the theory of absorbing Markov chains. Finally, we will show that our tool works also in the case of a tandem queueing network with a single server that can serve one queue at a time.

[1]  Jacques Resing,et al.  Polling systems and multitype branching processes , 1993, Queueing Syst. Theory Appl..

[2]  Kin K. Leung,et al.  Cyclic-Service Systems with Probabilistically-Limited Service , 1991, IEEE J. Sel. Areas Commun..

[3]  Charles M. Grinstead,et al.  Introduction to probability , 1999, Statistics for the Behavioural Sciences.

[4]  J. P. C. Blanc.  An algorithmic solution of polling models with limited service disciplines , 1992, IEEE Trans. Commun..

[5]  Rami Shakarchi.  Complex Numbers and Functions , 1999 .

[6]  Hideaki Takagi,et al.  Analysis and Application of Polling Models , 2000, Performance Evaluation.

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

[8]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[9]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[10]  Ahmad Al Hanbali,et al.  A Tandem Queueing Model for Delay Analysis in Disconnected Ad Hoc Networks , 2008, ASMTA.

[11]  Richard J. Boucherie,et al.  A polling model with an autonomous server , 2007, Queueing Syst. Theory Appl..

[12]  Martin Eisenberg,et al.  Queues with Periodic Service and Changeover Time , 1972, Oper. Res..

[13]  John N. Tsitsiklis,et al.  Introduction to Probability , 2002 .

[14]  M. Dow.  Explicit inverses of Toeplitz and associated matrices , 2008 .

[15]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

[16]  J.P.C. Blanc.  The power-series algorithm for polling systems with time limits , 1998 .

[17]  Moshe Sidi,et al.  Polling systems: applications, modeling, and optimization , 1990, IEEE Trans. Commun..

[18]  P. Jacobs,et al.  Finite birth-and-death models in randomly changing environments , 1984, Advances in Applied Probability.