Article contents
A Technique for Computing Sojourn Times in Large Networks of Interacting Queues
Published online by Cambridge University Press: 27 July 2009
Abstract
Consider a large number of interacting queues with symmetric interactions. In the asymptotic limit, the interactions between any fixed finite subcollection become negligible, and the overall effect of interactions can be replaced by an empirical rate. The evolution of each queue is given by a time inhomogeneous Markov process. This may be considered a technique for writing dynamic Erlang fixed-point equations. We explore this as a tool to approximate sojourn time distributions.
- Type
- Research Article
- Information
- Probability in the Engineering and Informational Sciences , Volume 7 , Issue 4 , October 1993 , pp. 441 - 464
- Copyright
- Copyright © Cambridge University Press 1993
References
- 10
- Cited by