A decomposition result for a class of polling models

Boxma and Groenendijk have shown that the workload in polling models decomposes into two independent variables. This paper demonstrates a different type of decomposition that has an explicit multi-dimensional form. This decomposition does not apply to all polling models, but does, for example, apply to models with constant switch-over times and either exhaustive or gated service disciplines. For such models, we show that the population of customers present in the system (represented by a vector indicating the number of customers at each queue) at key time points breaks into two independent subpopulations: (1) the population of customers present in the related model with zero switch-over times; (2) another population, which is particularly easy to analyze. This result has a number of theoretical and applied implications.

[1]  L. Takacs Delay distributions for one line with poisson input, general holding times, and various orders of service , 1963 .

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

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

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

[5]  Hanoch Levy Binomial-gated service: a method for effective operation and optimization of polling systems , 1991, IEEE Trans. Commun..

[6]  W. Bux Token-ring local-area networks and their performance , 1989 .

[7]  Robert B. Cooper Queues served in cyclic order: Waiting times , 1970, Bell Syst. Tech. J..

[8]  Leonard Kleinrock,et al.  Polling Systems with Zero Switch-Over Periods: A General Method for Analyzing the Expected Delay , 1991, Perform. Evaluation.

[9]  B. T. Doshi,et al.  Queueing systems with vacations — A survey , 1986, Queueing Syst. Theory Appl..

[10]  Robert B. Cooper,et al.  Queues served in cyclic order , 1969 .

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

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

[13]  Steve W. Fuhrmann,et al.  Analysis of Cyclic Service Systems with Limited Service: Bounds and Approximations , 1988, Perform. Evaluation.

[14]  E. Arthurs,et al.  0. Hashida, "Analysis of multiqueue," Rev. Elec. Commun. Labs, , 1983 .

[15]  Robert B. Cooper,et al.  Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations , 1985, Oper. Res..

[16]  S. W. Fuhrmann Technical Note - A Note on the M/G/1 Queue with Server Vacations , 1984, Oper. Res..

[17]  P. J. Burke Technical Note - Delays in Single-Server Queues with Batch Input , 1975, Oper. Res..

[18]  Mario R. Garzia,et al.  Compartmental models for virtual circuit networks , 1990 .

[19]  W. Bux Local-Area Subnetworks: A Performance Comparison , 1981, IEEE Trans. Commun..