Minimizing response times and queue lengths in systems of parallel queues

Journal of Applied Probability

Volumn 36, Issue 4, 1999, Pages 1185-1193

  Koole, Ger ^a   Sparaggis, Panayotis D ^b   Towsley, Don ^c  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b University of Massachusetts   (United States)

^c Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

Increasing likelihood ratio distributions; Response times; Routeing; Stochastic majorization

Indexed keywords

EID: 0033233846     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0021900200017952     Document Type: Article

References (13)

1. BARLOW, R. E. AND PROSCHAN, F. (1975). Statistical Theory of Reliability and Life Testing. Holt, Rinehart and Winston, New York.
2. EPHREMIDES, A., VARAIYA, P. AND WALRAND, J. (1980). A simple dynamic routing problem. IEEE Trans. Automatic Control 25, 690-693.
3. HORDIJK, A. AND KOOLE, G. M. (1990). On the optimality of the generalized shortest queue policy. Prob. Eng. Inf. Sci. 4, 477-487.
4. LIU, Z. AND TOWSLEY, D. (1994). Stochastic scheduling in in-forest networks. Adv. Appl. Prob. 26, 222-241.
5. MARSHALL, A. W. AND OLKIN, I. (1979). Inequalities: Theory of Majorization and its Applications. Academic Press, New York.
6. MENICH, R. AND SERFOZO, R. F. (1991). Monotonicity and optimality of symmetric parallel processing systems. Queueing Systems 9, 403-418.
7. RICHTER, R. (1994). Scheduling. In Stochastic Orders and their Applications, eds. M. Shaked and J. G. Shanthikumar. Academic Press, New York, pp. 381-432.
8. RICHTER, R. AND SHANTHIKUMAR, J. G. (1992). Extremal properties of the FIFO discipline in queueing networks. J. Appl. Prob. 29, 967-978.
9. ROSS, S. M. (1983). Stochastic Processes. John Wiley, New York.
10. TOWSLEY, D., SPARAGGIS, P. D. AND CASSANDRAS, C. G. (1992). Optimal routing and buffer allocation for a class of finite capacity queueing systems. IEEE Trans. Automatic Control 37, 1446-1451.
11. WEBER, R. R. (1978). On the optimal assignment of customers to parallel queues. J. Appl. Prob. 15, 406-413.
12. WHITT, W. (1986). Deciding which queue to join: some counterexamples. Operat Res. 34, 55-62.
13. WINSTON, W. (1977). Optimality of the shortest line discipline. J. Appl. Prob. 14, 181-189.