论文信息 - The power-series algorithm applied to cyclic polling systems

The power-series algorithm applied to cyclic polling systems

The computation scheme of the power-series algorithm for the evaluation of the joint queue length distributions for a broad class of multi-queue systems is extended in order to become applicable to polling systems with non-negligible switching times. Because the server continues to move along the queues when no jobs are present, these systems do not possess a unique empty state. This makes that the algorithm is no longer purely recursive, but requires the solution of some sets of linear equations. Performance of the algorithm and properties of the model are discussed on the basis of some examples.

J.P.C. Blanc

[1] J. P. C. Blanc. A numerical approach to cyclic-service queueing models , 1990, Queueing Syst. Theory Appl..

[2] Kin K. Leung. Waiting time distributions for token-passing systems with limited-one service via discrete Fourier transforms , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

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

[4] J. Blanc. On a numerical method for calculating state probabilities for queueing systems with more than one waiting line , 1987 .

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

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

[7] P. Wynn,et al. On the Convergence and Stability of the Epsilon Algorithm , 1966 .

[8] J.P.C. Blanc. Cyclic polling systems : Limited service versus Bernoulli schedules , 1990 .

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