论文信息 - A simple dynamic routing problem

A simple dynamic routing problem

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.

[1] Luigi Fratta,et al. The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[2] Linus Schrage,et al. The Queue M/G/1 with the Shortest Remaining Processing Time Discipline , 1966, Oper. Res..

[3] G. J. Foschini,et al. A Basic Dynamic Routing Problem and Diffusion , 1978, IEEE Trans. Commun..

[4] H. Witsenhausen. Separation of estimation and control for discrete time systems , 1971 .

[5] Robert G. Gallager,et al. A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[6] Wayne L. Winston. OPTIMALITY OF THE SHORTEST LINE DISCIPLINE , 1977 .

[7] Michael H. Rothkopf. Scheduling with Random Service Times , 1966 .

[8] Kenneth C. Sevcik,et al. Scheduling for Minimum Total Loss Using Service Time Distributions , 1974, JACM.

[9] Wayne L. Winston,et al. Optimal Control of Discrete and Continuous Time Maintenance Systems with Variable Service Rates , 1977, Oper. Res..