On tandem blocking queues with a common retrial queue

We consider systems of tandem blocking queues having a common retrial queue. The model represents dynamics of short TCP transfers in the Internet. Analytical results are available only for a specific example with two queues in tandem. We propose approximation procedures involving simple analytic expressions, based on Mean Value Analysis (MVA) and on Fixed Point Approach (FPA). The mean sojourn time of a job in the system and the mean number of visits to the orbit queue are estimated by the MVA which needs as an input the fractions of blocked jobs in the primary queues. The fractions of blocked jobs are estimated by FPA. Using a benchmark example of the system with two primary queues, we conclude that the approximation works well in the light traffic regime. We note that our approach becomes exact if the blocking probabilities are fixed. Finally, we consider two optimization problems regarding minimizing mean total sojourn time of a job in the system: (i) finding the best order of queu...

• Type: Journal
• Year: 2010
• Where: COR
• Authors: Konstantin Avrachenkov, Uri Yechiali
• Keywords: Common Retrial Queue, COR 2010, Primary Queues, Sojourn Time