MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  In Network of Queues, M/M/1 Can Outperform M/D/1

Download:
Download as a PDF | Download as a PS
by Mor Harchol-balter, Mor Harchol-balter, David Wolfe, David Wolfe
http://www.gac.edu/~wolfe/papers/networks/MM1-MD1.ps
Add To MetaCart

Abstract:

Let N be an open queueing network where the servers have generally distributed service times (with possibly different means) and the outside arrivals to the servers are Poisson. Define N C,FCFS (respectively, N E,FCFS) to be queueing network N where each server has a constant (respectively, exponentially distributed) service time with the same mean as the corresponding server in N, and the packets are served in a First-Come-First-Served order. It has long been conjectured that for all networks N, the average packet delay in N C,FCFS is upper bounded by the average packet delay in N E,FCFS. In this paper, we present a counterexample to this conjecture.

Citations

227 Introduction to Probability Models – Ross - 1997
219 Queueing systems, Volume II: Computer Applications – Kleinrock - 1976
182 Open, closed and mixed networks of queues with different classes of customers – Baskett, Chandy, et al. - 1975
121 An introduction to queueing networks – Walrand - 1988
117 Stochastic Models of Manufacturing Systems – Buzacott, Shantikumar - 1993
45 The efficiency of greedy routing in hypercubes and butterflies – Stamoulis, Tsitsiklis - 1994
22 Average Delay in Queues with Non-Stationary Poisson Arrivals – Ross - 1978
21 Queueing analysis of oblivious packet-routing algorithms – Harchol-Balter, Black - 1994
21 Networks of queues with customers of different types – Kelly - 1975
11 The e ciency of greedy routing in hypercubes and butter ies – Stamoulis, Tsitsiklis - 1994
9 Comparison conjectures about the M/G/s queue – Whitt - 1983
7 Randomized parallel communications – Mitra, Cieslak - 1986
7 Networks of queues with customers of dierent types – Kelly - 1975
5 The Effect of Service Time Regularity on System Performance – Wolff - 1977
3 Delay and routing in interconnection networks – Hajek, Cruz - 1986
3 The effect of variability in the GI=G=s queue – Whitt - 1980
3 Minimizing delays in the GI=G=1 queue – Whitt - 1984
2 Constant beats memoryless for service times in a markovian queueing network – Harchol-Balter, Wolfe - 1994
1 Wol . The e ect of service time regularity on system performance – W - 1977