Algorithmic approach to bounding the mean response time of a minimum expected delay routing system

Authors:
John C. S. Lui;Richard R. Muntz
Affiliations:
UCLA Computer Science Department, Los Angeles, CA, USA;UCLA Computer Science Department, Los Angeles, CA, USA
Venue:
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Year:
1992

Citing 2
Cited 2

An approximation to the response time for shortest queue routing

SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Bounding Availability of Repairable Systems

IEEE Transactions on Computers

Queueing Models with Multiple Waiting Lines

Queueing Systems: Theory and Applications
Bounding the Mean Response Time of the Minimum Expected Delay Routing Policy: An Algorithmic Approach

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an algorithmic approach to bounding the mean response time of a multi-server system in which the minimum expected delay routing policy issued, i.e., an arriving job will join the queue which has the minimal expected value of unfinished work. We assume the queueing system to have K servers, each with an infinite capacity queue. The arrival process is Poisson with parameter &lgr;, and the service time of server i is exponentially distributed with mean 1/&mgr;i, 1 ≤ i ≤ K. The computation algorithm we present allows one to tradeoff accuracy and computational cost. Upper and lower bounds on the expected response time and expected number of customers are computed; the spread between the bounds can be reduced with additional space and time complexity. Examples are presented which illustrate the excellent relative accuracy attainable with relatively little computation.