Waiting times in discrete-time cyclic-service systems

Single-served, multiqueue systems with cyclic service in discrete time are considered. Nonzero switchover times between consecutive queues are assumed; the service strategies at the various queues may differ. A decomposition for the amount of work in such systems is obtained, leading to an exact expression for a weighted sum of the mean waiting times at the various queues. >

[1]  Michael J. Ferguson,et al.  Exact Results for Nonsymmetric Token Ring Systems , 1985, IEEE Trans. Commun..

[2]  Ronald W. Wolff,et al.  Poisson Arrivals See Time Averages , 1982, Oper. Res..

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

[4]  Hisashi Kobayashi,et al.  Queueing Models for Computer Communications System Analysis , 1977, IEEE Trans. Commun..

[5]  Leonard Kleinrock,et al.  A Queue with Starter and a Queue with Vacations: Delay Analysis by Decomposition , 1986, Oper. Res..

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

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

[8]  Onno J. Boxma,et al.  Waiting-time approximations for cyclic-service systems with switch-over times , 1986, SIGMETRICS '86/PERFORMANCE '86.

[9]  Bernd Meister,et al.  Waiting Lines and Times in a System with Polling , 1974, JACM.

[10]  G. Boyd Swartz.  Polling in a Loop System , 1980, JACM.

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

[12]  Izhak Rubin,et al.  Message Delay Analysis for Polling and Token Multiple-Access Schemes for Local Communication Networks , 1983, IEEE J. Sel. Areas Commun..

[13]  Onno J. Boxma,et al.  Waiting-Time Approximations for Cyclic-Service Systems with Switchover Times , 1987, Perform. Evaluation.