Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T03:20:02.641Z Has data issue: false hasContentIssue false

Optimality of the round-robin routing policy

Published online by Cambridge University Press:  14 July 2016

Zhen Liu*
Affiliation:
INRIA
Don Towsley*
Affiliation:
University of Massachusetts, Amherst
*
∗ Postal address: INRIA Centre Sophia Antipolis, 2004 Route des Lucioles, 06560 Valbonne, France. This author's research was partially supported by CEC DG-XIII under the ESPRIT-BRA grant QMIPS.
∗∗ Postal address: Department of Computer Science, University of Massachusetts, Amherst, MA 01003, USA.

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.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1994 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable