Interdeparture time distributions in ΣiMi/Gi/1 priority queues

This paper reviews existing results for the stationary interdeparture time distribution in the M/G/1 nonpreemptive and preemptive resume queues, and introduces a unified approach which exploits for the first time the common structure for the interdeparture time process that is present in all classical preemptive priority service disciplines. This approach confirms previously known results for the preemptive resume discipline, and presents new results for several variants of the preemptive repeat model. Exact expressions for the squared coefficient of variation of the interdeparture time distribution are also provided. Several numerical examples are given and discussed.

[1]  J. S. Kaufman.  Approximation methods for networks of queues with priorities , 1984, Perform. Evaluation.

[2]  Wolfgang Fischer,et al.  Approximations for the Per-Class Waiting Time and Interdepearture Time in the Sigma_i GI_i/GI_i/1 Queue , 1992, Perform. Evaluation.

[3]  J. Wessels,et al.  Approximate analysis of priority queueing networks , 1986 .

[4]  David A. Stanford,et al.  Distributions of the Interdeparture Times in FCFS and Nonpreemptive Priority MMAP [2]/G [2]/1 Queues , 1999, Perform. Evaluation.

[5]  Ward Whitt,et al.  Investigating dependence in packet queues with the index of dispersion for work , 1991, IEEE Trans. Commun..

[6]  P. Kuehn,et al.  Approximate Analysis of General Queuing Networks by Decomposition , 1979, IEEE Trans. Commun..

[7]  Peter D. Welch.  On Pre-Emptive Resume Priority Queues , 1964 .

[8]  Andre B. Bondi,et al.  A New MVA-Based Approximation for Closed Queueing Networks with a Preemptive Priority Server , 1988, Perform. Evaluation.

[9]  N. Ling.  The Mathematical Theory of Infectious Diseases and its applications , 1978 .

[10]  N. K. Jaiswal,et al.  Priority queues , 1968 .

[11]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[12]  W. Whitt.  Large Fluctuations in a Deterministic Multiclass Network of Queues , 1993 .

[13]  R. Butterworth,et al.  Queueing Systems, Vol. II: Computer Applications. , 1977 .

[14]  Ward Whitt,et al.  Dependence in packet queues , 1989, IEEE Trans. Commun..

[15]  Wolfgang Fischer,et al.  The interdeparture-time distribution for each class in the ∑iMi/Gi/1 queue , 1989, Queueing Syst. Theory Appl..

[16]  J. A. Buzacott,et al.  Open queueing network models of dynamic job shops , 1981 .

[17]  P. Burke.  The Output of a Queuing System , 1956 .

[18]  Stephen S. Lavenberg,et al.  Computer Performance Modeling Handbook , 1983, Int. CMG Conference.

[19]  Ward Whitt,et al.  The heavy-traffic bottleneck phenomenon in open queueing networks , 1990 .

[20]  David A. Stanford,et al.  Characterising interdeparture times for bursty input streams in the queue with pooled renewal arrivals , 1991 .

[21]  L. E. N. Delbrouck,et al.  Interdeparture times in M/G/1 queueing systems with non-preemptive priority discipline , 1990 .

[22]  Kenneth C. Sevcik,et al.  Priority Scheduling Disciplines in Queuing Network Models of Computer Systems , 1977, IFIP Congress.

[23]  Ward Whitt,et al.  A Light-Traffic Approximation for Single-Class Departure Processes from Multi-Class Queues , 1988 .

[24]  W. Whitt,et al.  The Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[25]  Philippe Nain,et al.  Interdeparture times from a queuing system with preemptive resume priority , 1984, Perform. Evaluation.

[26]  Bart W. Stuck,et al.  A Computer and Communication Network Performance Analysis Primer (Prentice Hall, Englewood Cliffs, NJ, 1985; revised, 1987) , 1987, Int. CMG Conference.

[27]  David A. Stanford,et al.  Interdeparture-Time Distributions in the Nonpreemptive Priority \Sigma M_i/G_i/1 Queue , 1991, Perform. Evaluation.

[28]  Ward Whitt.  Towards better multi-class parametric-decomposition approximations for open queueing networks , 1994, Ann. Oper. Res..

[29]  Hideaki Takagi,et al.  Queueing analysis: a foundation of performance evaluation , 1993 .

[30]  K. Mani Chandy,et al.  The MVA priority approximation , 1984, TOCS.

[31]  David A. Stanford,et al.  Waiting and Interdeparture Times in Priority Queues with Poisson- and General-Arrival Streams , 1997, Oper. Res..

[32]  K. Meyer.  The Output of a Queueing System , 1981 .

[33]  G. F. Newell,et al.  Introduction to the Theory of Queues. , 1963 .

[34]  William P. Pierskalla,et al.  Chapter 13 Applications of operations research in health care delivery , 1994, Operations research and the public sector.

[35]  Bart W. Stuck,et al.  A Computer and Communications Network Performance Analysis Primer , 1986, Int. CMG Conference.

[36]  Kishor S. Trivedi,et al.  A Note on the Effect of Preemptive Policies on the Stability of a Priority Queue , 1987, Inf. Process. Lett..

[37]  Wei Chang.  Preemptive Priority Queues , 1965 .