Optimal distributed policies for choosing among multiple servers

Author

Stamoulis, George D. ; Tsitsiklis, John N.

Author_Institution

Lab. for Inf. & Decision Syst., MIT, Cambridge, MA, USA

fYear

1991

fDate

11-13 Dec 1991

Firstpage

815

Abstract

The authors analyze a system consisting of multiple identical deterministic servers. Customers arrive in several streams; each customer has to decide which server to join by looking only at previous decisions of customers of the same stream. For three variations of this problem, it is proved that round robin is the policy minimizing the total expected delay over all customers of an individual stream. The problem of optimizing the total expected delay over all streams is considered. The performance of the round robin policy is investigated and the conclusion is that it is not optimal for this problem. Most of the results also apply under more general service time distributions

Keywords

optimisation; queueing theory; statistical analysis; delay minimization; multiple identical deterministic servers; optimal distributed policy; round robin policy; server choice; total expected delay; Communication standards; Computer networks; Decision making; Delay; Information analysis; Laboratories; Multiprocessor interconnection networks; Round robin; Routing; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 1991., Proceedings of the 30th IEEE Conference on

Conference_Location

Brighton

Print_ISBN

0-7803-0450-0

Type

conf

DOI

10.1109/CDC.1991.261428

Filename

261428