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.
Title
In Network of Queues, M/M/1 Can Outperform M/D/1
Published
1994-11-01
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-94-841
Type
Text
Extent
10 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
