Workloads and waiting times in single-server systems with multiple customer classes

One of the most fundamental properties that single-server multi-class service systems may possess is the property of work conservation. Under certain restrictions, the work conservation property gives rise to a conservation law for mean waiting times, i.e., a linear relation between the mean waiting times of the various classes of customers. This paper is devoted to single-server multi-class service systems in which work conservation is violated in the sense that the server's activities may be interrupted although work is still present. For a large class of such systems with interruptions, a decomposition of the amount of work into two independent components is obtained; one of these components is the amount of work in the corresponding systemwithout interruptions. The work decomposition gives rise to a (pseudo)conservation law for mean waiting times, just as work conservation did for the system without interruptions.

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

[2]  Linus Schrage.  Letter to the Editor - An Alternative Proof of a Conservation Law for the Queue G/G/1 , 1970, Oper. Res..

[3]  Moshe Sidi,et al.  Dominance relations in polling systems , 1990, Queueing Syst. Theory Appl..

[4]  G. Klimov.  Time-Sharing Service Systems. I , 1975 .

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

[6]  Onno J. Boxma,et al.  A pseudoconservation law for service systems with a polling table , 1990, IEEE Trans. Commun..

[7]  D. Everitt.  A conservation-type law for the token ring with limited service , 1986 .

[8]  Daniel P. Heyman,et al.  Stochastic models in operations research , 1982 .

[9]  Onno J. Boxma,et al.  Waiting Times in Polling Systems with Markovian Server Routing , 1989, MMB.

[10]  David Everitt.  Simple Approximations for Token Rings , 1986, IEEE Trans. Commun..

[11]  W. P. Groenendijk.  A conservation-law based approximation algorithm for waiting times in polling systems , 1988 .

[12]  S. Halfin.  Batch delays versus customer delays , 1983, The Bell System Technical Journal.

[13]  B. T. Doshi,et al.  Queueing systems with vacations — A survey , 1986, Queueing Syst. Theory Appl..

[14]  Julian Keilson,et al.  OSCILLATING RANDOM WALK MODELS FOR GI/G/1 VACATION , 1986 .

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

[16]  L. Kleinrock.  A conservation law for a wide class of queueing disciplines , 1965 .

[17]  W. P. Groenendijk.  WAITING-TIME APPROXIMATIONS FOR CYCLIC-SERVICE SYSTEMS WITH MIXED SERVICE STRATEGIES , 1988 .

[18]  Mandyam M. Srinivasan.  An Approximation for Mean Waiting Times in Cyclic Server Systems with Nonexhaustive Service , 1988, Perform. Evaluation.

[19]  U. Yechiali,et al.  Dynamic priority rules for cyclic-type queues , 1989, Advances in Applied Probability.

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

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

[22]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[23]  S. Brumelle.  On the relation between customer and time averages in queues , 1971 .

[24]  Onno J. Boxma,et al.  Waiting times in discrete-time cyclic-service systems , 1988, IEEE Trans. Commun..

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

[26]  Steve W. Fuhrmann,et al.  Mean Waiting Time Approximations of Cyclic Service Systems with Limited Service , 1987, Performance.

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

[28]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .

[29]  Hideaki Takagi,et al.  Queuing analysis of polling models , 1988, CSUR.

[30]  A. Federgruen,et al.  M / G / c queueing systems with multiple customer classes: characterization and control of achievable performance under nonpreemptive priority rules , 1988 .

[31]  Sreekantan S. Nair,et al.  A single server tandem queue , 1971, Journal of Applied Probability.

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

[33]  R. Wolff.  Work-conserving priorities , 1970 .

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

[35]  Onno Boxma,et al.  Two queues with alternating service and switching times , 1987 .

[36]  Joseph Pang,et al.  Approximate Delay Analysis and Results for Asymmetric Token-Passing and Polling Networks , 1986, IEEE J. Sel. Areas Commun..

[37]  Miguel Taube-Netto,et al.  Two Queues in Tandem Attended by a Single Server , 1977, Oper. Res..

[38]  D. Bharat.  Generalizations of the stochastic decomposition results for single server queues with vacations , 1990 .

[39]  Teunis J. Ott,et al.  On the M/G/1 queue by additional inputs , 1984, Journal of Applied Probability.

[40]  Erol Gelenbe,et al.  Analysis and Synthesis of Computer Systems , 1980 .

[41]  David Everitt.  A note on the pseudoconservation laws for cyclic service systems with limited service disciplines , 1989, IEEE Trans. Commun..

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