Polling systems with correlated arrivals

An analysis is made of polling systems with correlated arrivals, namely, systems in which the arrival processes of customers to the queues are not assumed to be independent. The authors consider cyclic polling systems with N queues, general service time distribution in each queue, and general switch-over times. For both the exhaustive and the gated service disciplines they derive the necessary equations for computing the N expected waiting time figures. A 'pseudo' conservation law for these systems is also derived. The analysis approach can be applied to other polling systems with correlated arrivals.<<ETX>>

[1]  H. Kushner.  Introduction to stochastic control , 1971 .

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

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

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

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

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

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

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

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

[10]  Jin-Fu Chang,et al.  Polling of two queues with synchronized correlated inputs and zero walktime , 1989 .

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

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

[13]  Pierre A. Humblet,et al.  Source coding for communication concentrators , 1978 .

[14]  Izhak Rubin,et al.  Polling with a General-Service Order Table , 1987, IEEE Trans. Commun..

[15]  S. W Fuhrmann,et al.  Symmetric queues served in cyclic order , 1985 .

[16]  Hanoch Levy,et al.  Optimization of Polling Systems , 1990, International Symposium on Computer Modeling, Measurement and Evaluation.

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

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

[19]  D. Sarkar,et al.  Expected waiting time for nonsymmetric cyclic queueing systems—exact results and applications , 1989 .

[20]  Hanoch Levy.  Delay Computation and Dynamic Behavior of Non-Symmetric Polling Systems , 1989, Perform. Evaluation.

[21]  Hideaki Takagi.  Mean Message Waiting Times in Symmetric Multi-Queue Systems with Cyclic Service , 1985, Perform. Evaluation.

[22]  E. Newhall,et al.  A Simplified Analysis of Scan Times in an Asymmetrical Newhall Loop with Exhaustive Service , 1977, IEEE Trans. Commun..