Optimality of the round-robin routing policy
Authors:
- Zhen LiuZLZhen Liu
- Don TowsleyDTDon Towsley
- 1 June 1994
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 31 (2) , 466-475
Abstract
In this paper we consider the problem of routing customers to identical servers, each with its own infinite-capacity queue. Under the assumptions that (i) the service times form a sequence of independent and identically distributed random variables with increasing failure rate distribution and (ii) state information is not available, we establish that the round-robin policy minimizes, in the sense of a separable increasing convex ordering, the customer response times and the numbers of customers in the queues.Keywords
This publication has 25 references indexed in Scilit:
- Extremal scheduling of parallel processing with and without real-time constraintsJournal of the ACM, 1993
- Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service ratesJournal of Applied Probability, 1993
- A new ordering for stochastic majorization: theory and applicationsAdvances in Applied Probability, 1992
- Optimal routing and buffer allocation for a class of finite capacity queueing systemsIEEE Transactions on Automatic Control, 1992
- Optimality of routing and servicing in dependent parallel processing systemsQueueing Systems, 1991
- Upper bounds on work in system for multichannel queuesJournal of Applied Probability, 1987
- Deciding Which Queue to Join: Some CounterexamplesOperations Research, 1986
- Comparison of servicing strategies in multichannel queueing systemsSiberian Mathematical Journal, 1981
- Technical Note—An Inequality for the Variance of Waiting Time under a General Queuing DisciplineOperations Research, 1977
- An upper bound for multi-channel queuesJournal of Applied Probability, 1977