全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
Mathematics  2008 

Series Jackson networks and non-crossing probabilities

DOI: 10.1287/moor.1090.0421

Full-Text   Cite this paper   Add to My Lib

Abstract:

This paper studies the queue length process in series Jackson networks with external input to the first station. We show that its Markov transition probabilities can be written as a finite sum of non-crossing probabilities, so that questions on time-dependent queueing behavior are translated to questions on non-crossing probabilities. This makes previous work on non-crossing 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, which he proved for two queues in series.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133