An Approximation for Mean Waiting Times in Cyclic Server Systems with Nonexhaustive Service

The cyclic server system has been the subject of considerable research over the last few years. Interest in analyzing such systems has gained momentum due to their application in the performance analysis of token ring networks. In this paper we consider cyclic server systems with nonexhaustive service discipline. The performance measures of interest here are the mean waiting times at the nodes in the system. Exact analysis of such systems for these performance measures is very difficult in general, and a number of approximation schemes have been proposed in the past to evaluate these quantities. This paper presents a new approximation technique that gives accurate estimates of these mean waiting times, based on extensive validation with simulations.

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

[2]  Wojciech Szpankowski,et al.  Closed-network duals of multiqueues with application to token-passing systems , 1988, Comput. Syst. Sci. Eng..

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

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

[5]  M. Eisenberg.  Two Queues with Alternating Service , 1979 .

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

[7]  Yutaka Takahashi,et al.  Diffusion Approximation for a Token Ring System with Nonexhausive Service , 1986, IEEE J. Sel. Areas Commun..

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

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

[10]  L. Schrage,et al.  Queueing systems, Vol. I: Theory , 1977, Proceedings of the IEEE.

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

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

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

[14]  K. Mani Chandy,et al.  Performance models of token ring local area networks , 1983, SIGMETRICS '83.

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

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

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

[18]  J. Little.  A Proof for the Queuing Formula: L = λW , 1961 .

[19]  Onno J. Boxma,et al.  Waiting-Time Approximations in Multi-Queue Systems with Cyclic Service , 1987, Perform. Evaluation.

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

[21]  Peter D. Welch,et al.  On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service , 1964 .

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

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

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

[25]  Leonard Kleinrock,et al.  Queueing Systems - Vol. 1: Theory , 1975 .