Sojourn Times in Queueing Networks

Published Online:https://doi.org/10.1287/moor.7.2.223

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.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.