Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Constant Beats Memoryless for Service in a Markovian Queueing Network

Mor Harchol-Balter and David Wolfe

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-94-820
July 1994

http://www.eecs.berkeley.edu/Pubs/TechRpts/1994/CSD-94-820.pdf

We prove that a Markovian Open Queueing Network in which the service times are constant has lower average packet delay than the same network in which the service times are exponential (with the same mean). The proof is elementary, generalizing a similar result of Stamoulis and Tsitsiklis by removing the requirement that the network be layered.


BibTeX citation:

@techreport{Harchol-Balter:CSD-94-820,
    Author = {Harchol-Balter, Mor and Wolfe, David},
    Title = {Constant Beats Memoryless for Service in a Markovian Queueing Network},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1994},
    Month = {Jul},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/1994/5490.html},
    Number = {UCB/CSD-94-820},
    Abstract = {We prove that a Markovian Open Queueing Network in which the service times are constant has lower average packet delay than the same network in which the service times are exponential (with the same mean). The proof is elementary, generalizing a similar result of Stamoulis and Tsitsiklis by removing the requirement that the network be layered.}
}

EndNote citation:

%0 Report
%A Harchol-Balter, Mor
%A Wolfe, David
%T Constant Beats Memoryless for Service in a Markovian Queueing Network
%I EECS Department, University of California, Berkeley
%D 1994
%@ UCB/CSD-94-820
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/1994/5490.html
%F Harchol-Balter:CSD-94-820