Please use this identifier to cite or link to this item:
|Title:||Join minimum cost queue for multiclass customers - Stability and performance bounds|
|Publisher:||CAMBRIDGE UNIV PRESS|
|Citation:||PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 18(4), 445-472|
|Abstract:||We consider a system of K parallel queues providing different grades of service through each of the queues and serving a multiclass customer population. Service differentiation is achieved by specifying different join prices to the queues. Customers of class j define a cost function psi(ij)(c(i), x(i)) for taking service from queue i when the join price for queue i is ci and congestion in queue i is xi and join the queue that minimizes psi(ij)((.),(.)). Such a queuing system will be called the "join minimum cost queue" (JMCQ) and is a generalization of the join shortest queue (JSQ) system. Non-work-conserving (called Paris Metro pricing system) and work-conserving (called the Tirupati system) versions of the JMCQ are analyzed when the cost to an arrival of joining a queue is a convex combination of the join price for that queue and the expected waiting time in that queue at the arrival epoch. Our main results are for a two-queue system. We obtain stability conditions and performance bounds. To obtain the lower and upper performance bounds, we propose two quasi-birth-death (QBD) processes that are derived from the original systems by suitably truncating the state space. The state space truncation in the non-work-con serving JMCQ follows the method of van Houtum and colleagues. We then show that this method is not applicable to the work-conserving JMCQ and provide sample-path-based proofs to show that the number in each queue is bounded by the number in the corresponding queues of these QBD processes. These sample-path proof techniques might also be of independent interest. We then show that the performance measures like mean queue length and revenue rate of the system are also bounded by the corresponding quantities of these QBD processes. Numerical examples show that these bounds are fairly tight. Finally, we generalize some of these results to systems with more queues.|
|Appears in Collections:||Article|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.