Stability of token passing rings

A sufficient stability condition for the standard token passing ring has been “known” since the seminal paper by Kuehn in 1979. However, this condition was derived without formal proof, and the proof seems to be of considerable interest to the research community. In fact, Watson observed that in the performance evaluation of token passing rings, “it is convenient to derive stability conditions ... (without proof)”. Our intention is to fill this gap, and to provide a formal proof of thesufficient and necessary stability condition for the token passing ring. In this paper, we present the case when the arrival process to each queue is Poisson but service times and switchover times are generally distributed. We consider in depth a gatedl-limited (l≤ ∞) service discipline for each station. We also indicate that the basic steps of our technique can be used to study the stability of some other multiqueue systems.

[1]  Kai Lai Chung,et al.  Markov Chains with Stationary Transition Probabilities , 1961 .

[2]  R. M. Loynes,et al.  The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  Douglas R. Miller Existence of Limits in Regenerative Processes , 1972 .

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

[5]  Shaler Stidham,et al.  Technical Note - A Last Word on L = λW , 1974, Oper. Res..

[6]  Mikhail Borisovich Nevelʹson,et al.  Stochastic Approximation and Recursive Estimation , 1976 .

[7]  R. Has’minskiĭ,et al.  Stochastic Approximation and Recursive Estimation , 1976 .

[8]  R. Tweedie Criteria for classifying general Markov chains , 1976, Advances in Applied Probability.

[9]  P. J. Kuehn,et al.  Multiqueue systems with nonexhaustive cyclic service , 1979, The Bell System Technical Journal.

[10]  W. Whitt Comparing counting processes and queues , 1981, Advances in Applied Probability.

[11]  Onno J. Boxma Two Symmmetric Queues with Alternating Service and Switching Times , 1984, Performance.

[12]  Kym Watson,et al.  Performance Evaluation of Cyclic Service Strategies - A Survey , 1984, International Symposium on Computer Modeling, Measurement and Evaluation.

[13]  Edward G. Coffman,et al.  A continuous polling system with constant service times , 1986, IEEE Trans. Inf. Theory.

[14]  高木 英明,et al.  Analysis of polling systems , 1986 .

[15]  Guy Pujolle,et al.  Introduction to queueing networks , 1987 .

[16]  Wojciech Szpankowski,et al.  Ultimate Stability Conditions for Some Multidimensional Distributed Systems , 1987 .

[17]  Onno Boxma,et al.  Two queues with alternating service and switching times , 1987 .

[18]  A. Ephremides,et al.  Ergodicity of M-dimensional random walks and random access systems , 1987, 26th IEEE Conference on Decision and Control.

[19]  Upendra Dave,et al.  Applied Probability and Queues , 1987 .

[20]  Wojciech Szpankowski,et al.  Stability Conditions for Multidimensional Queueing Systems with Computer Applications , 1988, Oper. Res..

[21]  J. Ben Atkinson,et al.  An Introduction to Queueing Networks , 1988 .

[22]  Oliver C. Ibe,et al.  Stability conditions for multisequence systems with cyclic service , 1988 .

[23]  Leonard Kleinrock,et al.  The Analysis of Random Polling Systems , 1988, Oper. Res..

[24]  A. W. Kemp,et al.  Applied Probability and Queues , 1989 .

[25]  Hideaki Takagi,et al.  Queuing analysis of polling models , 1988, CSUR.

[26]  W. Rosenkrantz Ergodicity conditions for two-dimensional Markov chains on the positive quadrant , 1989 .

[27]  Guy Fayolle,et al.  On random walks arising in queueing systems: ergodicity and transience via quadratic forms as lyapounov functions — Part I , 1989, Queueing Syst. Theory Appl..

[28]  Wojciech Szpankowski,et al.  Towards computable stability criteria for some multidimensional stochastic processes , 1989 .

[29]  Moshe Sidi,et al.  Dominance relations in polling systems , 1990, Queueing Syst. Theory Appl..

[30]  Wojciech Szpankowski,et al.  Stability Criteria For Yet Another Multidimensional Distributed System , 1991 .

[31]  W. Szpaukowski,et al.  Towards Stability Criteria For Multidimensional Distributed Systems: The Buffered Aloha Case , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

[32]  S. Meyn,et al.  Stability of Markovian processes I: criteria for discrete-time Chains , 1992, Advances in Applied Probability.