Optimality of the round-robin routing policy

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.

[1]  Zhen Liu,et al.  Stochastic Scheduling in in-Forest Networks , 1994, Advances in Applied Probability.

[2]  P. D. Sparaggis,et al.  Optimal control of multiclass parallel service systems with and without state information , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[3]  Donald F. Towsley,et al.  Extremal scheduling of parallel processing with and without real-time constraints , 1993, JACM.

[4]  Alain Jean-Marie,et al.  Parallel queues with resequencing , 1993, JACM.

[5]  Christos G. Cassandras,et al.  Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates , 1993, Journal of Applied Probability.

[6]  Christos G. Cassandras,et al.  On the duality between routing and scheduling systems with finite buffer space , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.

[7]  Alain Jean-Marie,et al.  Stochastic comparisons for queueing models via random sums and intervals , 1992, Advances in Applied Probability.

[8]  Cheng-Shang Chang,et al.  A new ordering for stochastic majorization: theory and applications , 1992, Advances in Applied Probability.

[9]  Christos G. Cassandras,et al.  Optimal routing and buffer allocation for a class of finite capacity queueing systems , 1992 .

[10]  Donald F. Towsley,et al.  Effects of service disciplines inG/GI/s queueing systems , 1992, Ann. Oper. Res..

[11]  Christos G. Cassandras,et al.  Extremal properties of the SNQ and the LNQ policies in finite capacity systems with state-dependent service rates , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.

[12]  Richard F. Serfozo,et al.  Optimality of routing and servicing in dependent parallel processing systems , 1991, Queueing Syst. Theory Appl..

[13]  Michael Pinedo,et al.  A note on queues with Bernoulli routing , 1990, 29th IEEE Conference on Decision and Control.

[14]  Ger Koole,et al.  On the Optimality of the Generalized Shortest Queue Policy , 1990, Probability in the Engineering and Informational Sciences.

[15]  Ronald Menich,et al.  Optimally of shortest queue routing for dependent service stations , 1987, 26th IEEE Conference on Decision and Control.

[16]  Ronald W. Wolff,et al.  Upper bounds on work in system for multichannel queues , 1987, Journal of Applied Probability.

[17]  Guy Pujolle,et al.  Introduction to queueing networks , 1987 .

[18]  Ward Whitt,et al.  Comparison methods for queues and other stochastic models , 1986 .

[19]  Bruce E. Hajek,et al.  Extremal Splittings of Point Processes , 1985, Math. Oper. Res..

[20]  N. L. Lawrie,et al.  Comparison Methods for Queues and Other Stochastic Models , 1984 .

[21]  Anthony Ephremides,et al.  A simple dynamic routing problem , 1980 .

[22]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

[23]  R. Weber.  On the optimal assignment of customers to parallel servers , 1978, Journal of Applied Probability.

[24]  R. Wolff.  An upper bound for multi-channel queues , 1977, Journal of Applied Probability.

[25]  Oldrich A. Vasicek,et al.  Technical Note - An Inequality for the Variance of Waiting Time under a General Queuing Discipline , 1977, Oper. Res..

[26]  J. Ben Atkinson,et al.  An Introduction to Queueing Networks , 1988 .

[27]  D. Daley.  Certain optimality properties of the first-come first-served discipline for G/G/s queues , 1987 .

[28]  Ward Whitt,et al.  Deciding Which Queue to Join: Some Counterexamples , 1986, Oper. Res..

[29]  Tapani Lehtonen,et al.  On the optimality of the shortest line discipline , 1984 .

[30]  Serguei Foss,et al.  Approximation of multichannel queueing systems , 1980 .

[31]  J. Kingman.  Inequalities in the Theory of Queues , 1970 .