Sojourn Times in Queueing Networks
- 1 May 1982
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 7 (2) , 223-244
- https://doi.org/10.1287/moor.7.2.223
Abstract
We consider a queueing network with types of customers. Poisson arrivals, type dependent routing and state dependent service. A number of stochastic aspects relating to sojourn times are investigated. Included are limiting state distributions imbedded at customer move times, mean sojourn times, and sojourn time distributions along overtake-free paths. It is shown that Reich's results extend to overtake-free paths yielding limiting sojourn time distributions which correspond to the sum of exponential independent stages of sojourn in individual nodes. The analysis is bused solely on considerations of population distributions through conditioning on customers' itineraries in the network.Keywords
This publication has 0 references indexed in Scilit: