Sojourn times in a two‐stage queueing network with blocking

The model considered in this paper involves a tandem queue consisting of a sequence of two waiting lines. The main feature of our model is blocking, i.e., as soon as the second waiting line reaches a certain upper limit, the first line is blocked. The input of units to the tandem queue is the MAP (Markovian arrival process), and service requirements are of phase type. Our objective is to study the sojourn time distribution under the first-come-first-serve discipline by analyzing the sojourn time through times until absorption in appropriately defined quasi-birth-and-death processes and continuous-time Markov chains. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004

[1]  Marcel F. Neuts,et al.  Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking , 1980, SIAM J. Algebraic Discret. Methods.

[2]  Antonio Gómez-Corral,et al.  A Tandem Queue with Blocking and Markovian Arrival Process , 2002, Queueing Syst. Theory Appl..

[3]  Tetsuya Takine,et al.  On the relationship between queue lengths at a random instant and at a departure in the stationary queue with bmap arrivals , 1998 .

[4]  Alan G. Konheim,et al.  Finite Capacity Queuing Systems with Applications in Computer Modeling , 1978, SIAM J. Comput..

[5]  M. Neuts.  A Versatile Markovian Point Process , 1979 .

[6]  Alan G. Konheim,et al.  A Queueing Model with Finite Waiting Room and Blocking , 1976, JACM.

[7]  Gordon C. Hunt,et al.  Sequential Arrays of Waiting Lines , 1956 .

[8]  Christos Langaris,et al.  On the waiting time of a two-stage queueing system with blocking , 1984, Journal of Applied Probability.

[9]  A. Gómez-Corral,et al.  On a tandem G-network with blocking , 2002, Advances in Applied Probability.

[10]  Antonio Gómez-Corral,et al.  A matrix-geometric approximation for tandem queues with blocking and repeated attempts , 2002, Oper. Res. Lett..

[11]  Christoph Lindemann,et al.  Modeling IP traffic using the batch Markovian arrival process , 2003, Perform. Evaluation.

[12]  B. Avi-Itzhak,et al.  A Sequence of Two Servers with No Intermediate Queue , 1965 .

[13]  Ward Whitt,et al.  Numerical Inversion of Laplace Transforms of Probability Distributions , 1995, INFORMS J. Comput..

[14]  M. Neuts.  Two queues in series with a finite, intermediate waitingroom , 1968, Journal of Applied Probability.

[15]  N. Prabhu.  Transient Behaviour of a Tandem Queue , 1967 .

[16]  Vaidyanathan Ramaswami,et al.  A logarithmic reduction algorithm for quasi-birth-death processes , 1993, Journal of Applied Probability.

[17]  B. Avi-Itzhak,et al.  Servers in tandem with communication and manufacturing blocking , 1993 .

[18]  Winfried K. Grassmann,et al.  An analytical solution for a tandem queue with blocking , 2000, Queueing Syst. Theory Appl..

[19]  Peter G. Taylor,et al.  Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes , 1995 .

[20]  Vaidyanathan Ramaswami,et al.  Introduction to Matrix Analytic Methods in Stochastic Modeling , 1999, ASA-SIAM Series on Statistics and Applied Mathematics.

[21]  C. Langaris.  The waiting-time process of a queueing system with gamma-type input and blocking , 1986 .

[22]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[23]  David M. Lucantoni,et al.  New results for the single server queue with a batch Markovian arrival process , 1991 .