Title :
A simple dynamic routing problem
Author :
Ephremides, A. ; Varaiya, P. ; Walrand, J.
Author_Institution :
University of California, Berkeley, CA, USA
fDate :
8/1/1980 12:00:00 AM
Abstract :
As jobs arrive they have to be routed to one of two similar exponential servers. It is shown that if the queue lengths at both servers are observed then the Optimal decision is to route jobs to the shorter queue, whereas if the queue lenths are not observed then it is best to alternate between queues, provided the initial distribution of the two queue sizes is the same. The optimality of these routing strategies is independent of the statistics of the job arrivals.
Keywords :
Queuing analysis; Laboratories; Network servers; Queueing analysis; Routing; Senior members; Statistics; Stochastic processes;
Journal_Title :
Automatic Control, IEEE Transactions on
DOI :
10.1109/TAC.1980.1102445
