Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T08:51:16.853Z Has data issue: false hasContentIssue false

User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss

Published online by Cambridge University Press:  14 July 2016

Scott Spicer*
Affiliation:
The University of Auckland
Ilze Ziedins*
Affiliation:
The University of Auckland
*
∗ Postal address: Department of Statistics, The University of Auckland, Private Bag 92019, Auckland, New Zealand.
∗ Postal address: Department of Statistics, The University of Auckland, Private Bag 92019, Auckland, New Zealand.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider a system of parallel, finite tandem queues with loss. Each tandem queue consists of two single-server queues in series, with capacities C 1 and C 2 and exponential service times with rates μ1 and μ2 for the first and second queues, respectively. Customers that arrive at a queue that is full are lost. Customers arriving at the system can choose which tandem queue to enter. We show that, for customers choosing a queue to maximise the probability of their reaching the destination (or minimise their individual loss probability), it will sometimes be optimal to choose queues with more customers already present and/or with greater residual service requirements (where preceding customers are further from their final destination).

Information

Type
Short Communications
Copyright
© Applied Probability Trust 2006