Title :
Optimal allocation of customers in a two server queue with resequencing
Author_Institution :
Dept. of Electr. Eng., Maryland Univ., College Park, MD, USA
Abstract :
The author deals with the problem of optimal allocation of customers in a two-server queue with heterogeneous service rates and resequencing. The resequencing constraint ensures that the customers leave the system in the order in which they entered it. It is shown that the optimal policy that minimizes the average end-to-end delay of customers in the system is independent of the number of customers in the resequencing buffer. Moreover, it is also shown that the faster server should be kept busy whenever possible and that the optimal control of the slower server is of the threshold type in the number of customers in the main queue buffer.<>
Keywords :
computer networks; data communication systems; queueing theory; telecommunication traffic; average end-to-end delay; heterogeneous service rates; optimal allocation of customers; optimal control; resequencing buffer; two server queue with resequencing; Computer networks; Delay systems; Dynamic programming; Educational institutions; Equations; Fault tolerance; Network servers; Optimal control; Telecommunication traffic; Traffic control;
Conference_Titel :
Computer Networking Symposium, 1988., Proceedings of the
Conference_Location :
Washington, DC, USA
Print_ISBN :
0-8186-0835-8
DOI :
10.1109/CNS.1988.5000
