Analysis of polling systems with general input process and finite capacity

An approximate algorithm for polling systems with finite capacity of waiting places and nonexhaustive service is presented. The analysis is made in the discrete-time domain, based on the evaluation of discrete convolution operations taking advantage of fast convolution algorithms, e.g. the fast Fourier transform. Attention is devoted to two essential modeling aspects: consideration of general renewal input traffic, and assumption of finite capacity of waiting places in the system. Numerical examples are shown to illustrate the approximation accuracy of the analysis. The approximation is validated by means of computer simulations. The class of polling models considered here can be used in the performance investigation of a broad spectrum of models in computer and communication systems. >

[1]  Phuoc Tran-Gia,et al.  Performance Analysis of Polling Mechanisms with Receiver Blocking , 1986, ICCC.

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

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

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

[5]  Paul J. Kühn.  Performance of ARQ-protocols for HDX-transmission in hierarchical polling systems , 1981, Perform. Evaluation.

[6]  M. Ackroyd.  Computing the Waiting Time Distribution for the G/G/1 Queue by Signal Processing Methods , 1980, IEEE Trans. Commun..

[7]  Alan G. Konheim,et al.  An Elementary Solution of the Queuing System G/G/1 , 1975, SIAM J. Comput..

[8]  Hong Linh Truong,et al.  Mean-delay approximation for cyclic-service queueing systems , 1983, Perform. Evaluation.

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

[10]  D. R. Manfield.  Analysis of a Priority Polling System for Two-Way Traffic , 1985, IEEE Trans. Commun..

[11]  Martin A. Leibowitz,et al.  An Approximate Method for Treating a Class of Multiqueue Problems , 1961, IBM J. Res. Dev..

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

[13]  P Tran-gia,et al.  Discrete-time analysis for the interdeparture distribution of GI/G/1 queues , 1986 .

[14]  Walter L. Smith.  On the distribution of queueing times , 1953, Mathematical Proceedings of the Cambridge Philosophical Society.

[15]  D. V. Lindley,et al.  The theory of queues with a single server , 1952, Mathematical Proceedings of the Cambridge Philosophical Society.

[16]  P. Henrici.  Fast Fourier Methods in Computational Complex Analysis , 1979 .

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

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