Stability, monotonicity and invariant quantities in general polling systems

Consider a polling system withK≥1 queues and a single server that visits the queues in a cyclic order. The polling discipline in each queue is of general gated-type or exhaustive-type. We assume that in each queue the arrival times form a Poisson process, and that the service times, the walking times, as well as the set-up times form sequences of independent and identically distributed random variables. For such a system, we provide a sufficient condition under which the vector of queue lengths is stable. We treat several criteria for stability: the ergodicity of the process, the geometric ergodicity, and the geometric rate of convergence of the first moment. The ergodicity implies the weak convergence of station times, intervisit times and cycle times. Next, we show that the queue lengths, station times, intervisit times and cycle times are stochastically increasing in arrival rates, in service times, in walking times and in setup times. The stability conditions and the stochastic monotonicity results are extended to the polling systems with additional customer routing between the queues, as well as bulk and correlated arrivals. Finally, we prove that the mean cycle time, the mean intervisit time and the mean station times are invariant under general service disciplines and general stationary arrival and service processes.

[1]  A. F. Veinott Optimal Policy in a Dynamic, Single Product, Nonstationary Inventory Model with Several Demand Classes , 1965 .

[2]  V. Strassen The Existence of Probability Measures with Given Marginals , 1965 .

[3]  P. Billingsley,et al.  Convergence of Probability Measures , 1969 .

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

[5]  G. O'Brien Limit theorems for sums of chain-dependent processes , 1974, Journal of Applied Probability.

[6]  G. Oprișan,et al.  Limit theorems for J − X processes with a general state space , 1976 .

[7]  Elja Arjas,et al.  Approximating Many Server Queues by Means of Single Server Queues , 1978, Math. Oper. Res..

[8]  T. Lehtonen,et al.  Approximating many-server queues by means of single-server queues , 1978, Advances in Applied Probability.

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

[10]  M. Miyazawa The derivation of invariance relations in complex queueing systems with stationary inputs , 1983 .

[11]  Hideaki Takagi,et al.  Analysis of polling systems , 1986 .

[12]  Leslie D. Servi Average Delay Approximation of M/G/1 Cyclic Service Queues with Bernoulli Schedules , 1986, IEEE J. Sel. Areas Commun..

[13]  Onno Boxma,et al.  Pseudo-conservation laws in cyclic-service systems , 1986 .

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

[15]  Onno J. Boxma,et al.  Workloads and waiting times in single-server systems with multiple customer classes , 1989, Queueing Syst. Theory Appl..

[16]  Carlos F. Daganzo,et al.  Some properties of polling systems , 1990, Queueing Syst. Theory Appl..

[17]  Hideaki Takagi,et al.  Comments on 'Exact results for nonsymmetric token ring systems' , 1990, IEEE Trans. Commun..

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

[19]  Theodore E. Tedijanto,et al.  Exact Results for the Cyclic-Service Queue with a Bernoulli Schedule , 1990, Perform. Evaluation.

[20]  A. Jean-Marie,et al.  Stochastic orderings on partial sums of random variables and on counting measures of random intervals , 1991 .

[21]  Moshe Sidi,et al.  A queueing network with a single cyclically roving server , 1992, Queueing Syst. Theory Appl..

[22]  Wojciech Szpankowski,et al.  Stability of token passing rings , 1992, Queueing Syst. Theory Appl..

[23]  Hanoch Levy,et al.  Cyclic reservation schemes for efficient operation of multiple-queue single-server systems , 1992, Ann. Oper. Res..