A two-queue model with exhaustive and limited service disciplines

In this paper, we analyze a single server model with two queues. The server serves customers in one queue according to an exhaustive discipline and serves the other queue according to a limited discipline. We study the embedded Markov chain at departure epochs and obtain the transforms of the queue length and sojourn time distributions. We also present a light traffic analysis and a heavy traffic limit analysis for this model. We show that when the system approaches saturation, the two queues become independent

[1]  Anatolii A. Logunov,et al.  Analytic functions of several complex variables , 1965 .

[2]  一松 信,et al.  R.C. Gunning and H.Rossi: Analytic Functions of Several Complex Variables, Prentice-Hall, Englewood Cliffs, N.J., 1965, 317頁, 15×23cm, $12.50. , 1965 .

[3]  Lajos Takács.  Two Queues Attended by a Single Server , 1968, Oper. Res..

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

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

[6]  Onno Boxma,et al.  The M/G/1 queue with alternating service formulated as a Riemann-Hilbert problem , 1981 .

[7]  D. Jagerman.  An inversion technique for the Laplace transform , 1982, The Bell System Technical Journal.

[8]  Valerie Isham,et al.  Non‐Negative Matrices and Markov Chains , 1983 .

[9]  F. R. Gantmakher.  The Theory of Matrices , 1984 .

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

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

[12]  Steve W. Fuhrmann,et al.  Analysis of Cyclic Service Systems with Limited Service: Bounds and Approximations , 1988, Perform. Evaluation.

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

[14]  Bhaskar Sengupta.  A perturbation method for solving some queues with processor sharing discipline , 1989 .

[15]  Toshihisa Ozawa,et al.  Alternating Service Queues with Mixed Exhaustive and K-Limited Services , 1990, Perform. Evaluation.

[16]  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.

[17]  Moshe Sidi,et al.  Discrete-time priority queueing systems with two-state Markov modulated arrival processes , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[18]  David W. Petr,et al.  Nested threshold cell discarding for ATM overload control: optimization under cell loss constraints , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[19]  Y. Takahashi,et al.  Delay analysis of discrete-time priority queue with structured inputs , 1991, Queueing Syst. Theory Appl..

[20]  J. P. C. Blanc.  An algorithmic solution of polling models with limited service disciplines , 1992, IEEE Trans. Commun..

[21]  Sidney L. Hantler,et al.  On a Preemptive Markovian Queue with Multiple Servers and Two Priority Classes , 1992, Math. Oper. Res..

[22]  M. Zazanis.  Analyticity of Poisson-driven stochastic systems , 1992, Advances in Applied Probability.

[23]  Duan-Shin Lee,et al.  Queueing analysis of a threshold based priority scheme for ATM networks , 1993, TNET.

[24]  Robert D. van der Mei,et al.  Waiting times in a two-queue model with exhaustive and Bernoulli service , 1994, Math. Methods Oper. Res..

[25]  Tetsuya Takine,et al.  An analysis of a discrete-time queue for broadband ISDN with priorities among traffic classes , 1994, IEEE Trans. Commun..