Stochastic ordering properties and optimal routing control for a class of finite capacity queueing systemsThe problem of routing jobs to parallel queues with identical exponential servers and unequal finite buffer capacities is considered. Stochastic ordering and weak majorization properties on critical performance measures are established by means of event-driven inductions. In particular, it is shown that the intuitive 'join the shortest non-full queue' (SNQ) policy is optimal with respect to an overall function that accounts for holding and blocking costs. Moreover, the buffer allocation problem is solved by proving the intuitive result that, for a fixed total buffer capacity, the optimal allocation scheme is the one in which the difference between the maximum and minimum queue capacities is minimized, i.e., becomes either 0 or 1.
Document ID
19920028751
Acquisition Source
Legacy CDMS
Document Type
Conference Paper
Authors
Towsley, Don (Massachusetts Univ. Amherst, MA, United States)
Sparaggis, Panayotis D. (Massachusetts Univ. Amherst, MA, United States)
Cassandras, Christos G. (Massachusetts, University Amherst, United States)