Sojourn times in closed queueing networks-Reference-Cited by-同舟云学术

Sojourn times in closed queueing networks

Published:1983-09 Issue:3 Volume:15 Page:638-656
ISSN:0001-8678
Container-title:Advances in Applied Probability
language:en
Short-container-title:Advances in Applied Probability

Author:

Kelly F. P.,Pollett P. K.

Abstract

This paper obtains the stationary joint distribution of a customer's sojourn times along an overtake-free path in a closed multiclass Jackson network. The distribution has a simple representation in terms of the product form distribution for the state of the network at an arrival instant.

Publisher

Cambridge University Press (CUP)

Subject

Applied Mathematics,Statistics and Probability

Reference28 articles.

1. Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers

2. Regenerative Simulation of Response Times in Networks of Queues

3. Waiting Times When Queues are in Tandem

4. State-of-the-Art—Networks of Queues—A Survey of Equilibrium Analysis

5. Remarks on processes of calls;Ryll-Nardzewski;Proc. 4th Berkeley Symp. Math. Statist. Prob.,1961

Cited by 70 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Response Time Distribution in a Tandem Pair of Queues with Batch Processing;Journal of the ACM;2021-06-30

2. On the Exact Inter-departure, Inter-start, and Cycle Time Distribution of Closed Queueing Networks Subject to Blocking;IIE Transactions;2014-12-08

3. Sojourn Time;Wiley StatsRef: Statistics Reference Online;2014-09-29

4. The cyclic queue and the tandem queue;Queueing Systems;2013-10-25

5. Stochastic Comparison of Queueing Networks;International Series in Operations Research & Management Science;2010-11-15