The interchangeability of tandem queues with heterogeneous customers and dependent service times

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.

[1]  Henry D. Friedman,et al.  Reduction Methods for Tandem Queuing Systems , 1965 .

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

[3]  Ronald W. Wolff,et al.  The Optimal Order of Service in Tandem Queues , 1974, Oper. Res..

[4]  R. Weber THE INTERCHANGEABILITY OF -/M/1 QUEUES IN SERIES , 1979 .

[5]  Michael Pinedo On the Optimal Order of Stations in Tandem Queues , 1982 .

[6]  T. Lehtonen On the ordering of tandem queues with exponential servers , 1986, Journal of Applied Probability.

[7]  J. Walrand,et al.  On the interchangeability and stochastic ordering of ·/M/1 queues in tandem , 1987, Advances in Applied Probability.

[8]  Venkat Anantharam Probabilistic proof of the interchangeability of ./M/1 queues in series , 1987, Queueing Syst. Theory Appl..

[9]  Ronald W. Wolff,et al.  Optimal Order of Servers for Tandem Queues in Light Traffic , 1988 .

[10]  K. Sigman,et al.  On the Interchangeability and Stochastic Ordering of Exponential Queues in Tandem with Blocking , 1989 .

[11]  Xiuli Chao,et al.  Batch arrivals to a tandem queue without an intermediate buffer , 1990 .

[12]  M. Kijima,et al.  On interchangeability for exponential single-server queues in tandem , 1990, Journal of Applied Probability.

[13]  Jie Ding,et al.  Bowl Shapes Are Better with Buffers–Sometimes , 1991 .

[14]  Michael Pinedo,et al.  On reversibility of tandem queues with blocking , 1992 .

[15]  Gideon Weiss,et al.  The Cafeteria Process - Tandem Queues with 0-1 Dependent Service Times and the Bowl Shape Phenomenon , 1994, Oper. Res..