UC BERKELEY
EECS technical reports
TECHNICAL REPORTS


CSD-94-841.pdf
CSD-94-841.ps
Oskicat catalog record
Conditions of Use

Archive Home Page

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

Authors:
Harchol-Balter, Mor
Wolfe, David
Technical Report Identifier: CSD-94-841
November 1994
CSD-94-841.pdf
CSD-94-841.ps

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 NC,FCFS (respectively, NE,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 NC,FCFS is upper bounded by the average packet delay in NE,FCFS. In this paper, we present a counterexample to this conjecture.