Series Jackson networks and noncrossing probabilities

Series Jackson networks and noncrossing probabilities

0.00 Avg rating0 Votes
Article ID: iaor20104585
Volume: 35
Issue: 2
Start Page Number: 257
End Page Number: 266
Publication Date: May 2010
Journal: Mathematics of Operations Research
Authors: ,
Keywords: Jackson network
Abstract:

This paper studies the queue-length process in series Jackson networks with external input to the first station only. We show that its Markov transition probabilities can be written as a finite sum of noncrossing probabilities, so that questions on time-dependent queueing behavior are translated to questions on noncrossing probabilities. This makes previous work on noncrossing probabilities relevant to queueing systems and allows new queueing results to be established. To illustrate the latter, we prove that the relaxation time (i.e., the reciprocal of the ‘spectral gap’) of a positive recurrent system equals the relaxation time of an M/M/1 queue with the same arrival and service rates as the network's bottleneck station. This resolves a conjecture of Blanc that he proved for two queues in series.

Reviews

Required fields are marked *. Your email address will not be published.