This Article 
 Bibliographic References 
 Add to: 
The Optimal Control of Heterogeneous Queueing Systems: A Paradigm for Load-Sharing and Routing
December 1989 (vol. 38 no. 12)
pp. 1724-1735
The essence of the basic control decisions implicit in load-sharing and routing algorithms is captured in a simple model of heterogeneous queue control. The authors solve for the optimal control policy and investigate the performance of previously proposed policies in a tractable limit of this model. Using their understanding of this solvable limit, the authors propose heuristic policies for th

[1] A. Agrawala, E. Coffman, M. Garey, and S. Tripathi, "A stochastic optimization algorithm minimizing expected flow times on uniform processors,"IEEE Trans. Comput., vol. C-33, pp. 351-356, 1984.
[2] S. Banawan and J. Zahorjan, "Load sharing in heterogeneous queueing systems," inProc. IEEE INFOCOM '89, 1988, pp. 731-739.
[3] C. Bell and S. Stidham, "Individual versus social optimization in the allocation of customers to alternative servers,"Management Sci., vol. 29, pp. 831-839, 1983.
[4] F. Bonomi and A. Kumar, "Adaptive optimal load balancing in a heterogeneous multiserver system with a central job scheduler," inProc. 8th DCS, June 1988, pp. 500-507.
[5] Y. Chow and W. Kohler, "Models for dynamic load balancing in a heterogeneous multiple processor system,"IEEE Trans. Comput., vol. C-28, pp. 354-361, 1979.
[6] D. Houck, "Comparison of policies for routing customers to parallel queueing systems,"Oper. Res., vol. 35, no. 2, pp. 306-310, 1987.
[7] R. Howard,Dynamic Programming and Markov Processes. Cambridge, MA: MIT Press, 1960.
[8] D. L. Jagerman, "Some properties of the Erlang loss function,"Bell Syst. Tech. J., vol. 53, pp. 525-551, 1974.
[9] F. P. Kelly, "Routing in circuit switched networks: Optimization, shadow prices and decentralization,"Advances Appl. Probability, vol. 20, pp. 112-144, 1988.
[10] L. Kleinrock,Communication Nets. New York: McGraw-Hill, 1964, pp. 125-126.
[11] K. R. Krishnan, "Joining the right queue and routing in data networks," Bellcore Tech. Memo.; also see "Joining the right queue: A Markov decision rule," inProc. IEEE Conf. Decision Contr., 1987, pp. 1863-1868.
[12] K. R. Krishnan, "Adaptive routing for telephone traffic," Bellcore Tech. Memo., 1987.
[13] P. Kumar and J. Walrand, "Individually optimal routing in parallel systems,"J. Appl. Probability, vol. 22, pp. 989-995, 1985.
[14] R. Larsen and A. Agrawala, "Control of a heterogeneous two-server exponential queueing system,"IEEE Trans. Software Eng., vol. SE- 9, pp. 522-526, 1983.
[15] W. Lin and P. R. Kumar, "Optimal control of a queueing system with two heterogeneous servers,"IEEE Trans. Automat. Contr., vol. AC-29, pp. 696-703, Aug. 1984.
[16] S. Lippman and S. Stidham, "Individual versus social optimization in exponential congestion systems,"Oper. Res., vol. 25, pp. 233-247, 1977.
[17] P. Naor, "On the regulation of queue size by levying tolls,"Econometrica, vol. 37, pp. 15-24, 1969.
[18] R. Nelson and D. Towsley, "On maximizing the number of departures before a deadline on multiple processors," IBM Rep. RC 11255, 1985.
[19] R. Nelson and D. Towsley, "Comparison of threshold scheduling policies for multiple server systems," IBM Rep. RC 11256, 1985.
[20] G. F. Newell,Approximate Stochastic Behavior of n-Server Service Systems with Large n. Berlin, Germany: Springer-Verlag, 1973.
[21] R. Righter, "The stochastic sequential assignment problem with random deadlines,"Probability Eng. Inform. Sci., vol. 1, pp. 189-202, 1987.
[22] Z. Rosberg and P. Kermani, "Customer routing to different servers with complete information," IBM Rep. RC 13765, 1988.
[23] Z. Rosberg and P. Kermani, "Customer routing to different servers with complete information," inProc. Twenty-Sixth Annu. Allerton Conf. Commun., Contr., Comput., 1988, pp. 566-568.
[24] S. Shenker and A. Weinrib, "Asymptotic analysis of large heterogeneous queueing systems," inProc. Sigmetrics 88, 1988, pp. 56-62.
[25] S. Stidham, "Optimal control of admissions to a queueing system,"IEEE Trans. Automat. Contr., vol. AC-30, Aug. 1985.
[26] S. Stidham, "Scheduling, routing, and flow control in stochastic networks," Univ. of North Carolina Tech. Rep. UNC/ORSAFFR-86/22, 1986.
[27] J. Walrand, "A note on 'Optimal control of a queueing system with heterogeneous servers,"Syst. Contr. Lett., vol. 4, pp. 131-134, 1984.
[28] A. Weinrib and S. Shenker, "Greed is not enough: Adaptive load sharing in large heterogeneous systems," inIEEE INFOCOM'88--Conf. Comput. Commun. Proc., 1988, pp. 986-994.
[29] T. P. Yum and M. Schwartz, "The join-biased-queue rule and its application to routing in computer communication networks,"IEEE Trans. Commun., vol. COM-29, no. 4, pp. 505-511, Apr. 1981.

Index Terms:
optimal control; heterogeneous queueing systems; load-sharing; routing algorithms; performance; heuristic policies; optimal control; performance evaluation; queueing theory.
S. Shenker, A. Weinrib, "The Optimal Control of Heterogeneous Queueing Systems: A Paradigm for Load-Sharing and Routing," IEEE Transactions on Computers, vol. 38, no. 12, pp. 1724-1735, Dec. 1989, doi:10.1109/12.40850
Usage of this product signifies your acceptance of the Terms of Use.