scholarly journals The Cafeteria Process—Tandem Queues with 0-1 Dependent Service Times and the Bowl Shape Phenomenon

1994 ◽  
Vol 42 (5) ◽  
pp. 895-912 ◽  
Author(s):  
Richard R. Weber ◽  
Gideon Weiss
Keyword(s):  
1984 ◽  
Vol 21 (3) ◽  
pp. 661-667 ◽  
Author(s):  
Xi-Ren Cao

In this paper we study a series of servers with exponentially distributed service times. We find that the sojourn time of a customer at any server depends on the customer's past history only through the customer's interarrival time to that server. A method of calculating the conditional probabilities of sojourn times is developed.


1989 ◽  
Vol 21 (2) ◽  
pp. 488-489 ◽  
Author(s):  
Thomas M. Chen

Reich (1957) proved that the sojourn times in two tandem queues are independent when the first queue is M/M /1 and the second has exponential service times. When service times in the first queue are not exponential, it has been generally expected that the sojourn times are not independent. A proof for the case of deterministic service times in the first queue is offered here.


2010 ◽  
Vol 66 (2) ◽  
pp. 195-209 ◽  
Author(s):  
Jung-Kyung Kim ◽  
Hayriye Ayhan

1982 ◽  
Vol 30 (3) ◽  
pp. 464-479 ◽  
Author(s):  
Michael Pinedo ◽  
Ronald W. Wolff
Keyword(s):  

1992 ◽  
Vol 24 (3) ◽  
pp. 727-737 ◽  
Author(s):  
Richard R. Weber

Consider m queueing stations in tandem, with infinite buffers between stations, all initially empty, and an arbitrary arrival process at the first station. The service time of customer j at station i is geometrically distributed with parameter pi, but this is conditioned on the fact that the sum of the m service times for customer j is cj. Service times of distinct customers are independent. We show that for any arrival process to the first station the departure process from the last station is statistically unaltered by interchanging any of the pi's. This remains true for two stations in tandem even if there is only a buffer of finite size between them. The well-known interchangeability of ·/M/1 queues is a special case of this result. Other special cases provide interesting new results.


1981 ◽  
Vol 13 (1) ◽  
pp. 221-230 ◽  
Author(s):  
E. Nummelin

Consider a tandem queue with renewal input process and i.i.d. service times (at each server). This paper is concerned with the construction of regeneration times for the multivariate Markov chain formed by the interarrival times, waiting times and service times of the customers.


1997 ◽  
Vol 34 (1) ◽  
pp. 248-257 ◽  
Author(s):  
Ushio Sumita ◽  
Yasushi Masuda

A system of GIx/G/∞ queues in tandem is considered where the service times of a customer are correlated but the service time vectors for customers are independently and identically distributed. It is shown that the binomial moments of the joint occupancy distribution can be generated by a sequence of renewal equations. The distribution of the joint occupancy level is then expressed in terms of the binomial moments. Numerical experiments for a two-station tandem queueing system demonstrate a somewhat counterintuitive result that the transient covariance of the joint occupancy level decreases as the covariance of the service times increases. It is also shown that the analysis is valid for a network of GIx/SM/∞ queues.


Sign in / Sign up

Export Citation Format

Share Document