An invariance property of sojourn times in cyclic networks

Authors:
Christian Malchin;Hans Daduna
Affiliations:
Department of Mathematics, Hamburg University, 20146 Hamburg, Germany;Department of Mathematics, Hamburg University, 20146 Hamburg, Germany
Venue:
Operations Research Letters
Year:
2005

Citing 5
Cited 0

The Time for a Round Trip in a Cycle of Exponential Queues

Journal of the ACM (JACM)
The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues

Journal of the ACM (JACM)
Computational algorithms for closed queueing networks with exponential servers

Communications of the ACM
Formulas and representations for cyclic Markovian networks via Palm calculus

Queueing Systems: Theory and Applications
The Dependence of Sojourn Times in Closed Queueing Networks

Proceedings of the International Workshop on Computer Performance and Reliability

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate a customer's roundtrip behaviour in a cycle of exponential single server nodes. The conditional joint sojourn time distribution, given the cycle time, is independent of the number of circulating customers. We compare the consequences of this invariance property with previous results on passage time behaviour in case of bottlenecks.