An invariance property of sojourn times in cyclic networks

DOI10.1016/J.ORL.2004.03.006zbMath1076.90015OpenAlexW1964793653MaRDI QIDQ1886791

Christian Malchin, Hans Daduna

Publication date: 19 November 2004

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.03.006

zbMATH Keywords

BottleneckSojourn timesCycle timesGordon-Newell network

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Deterministic network models in operations research (90B10)

Related Items (1)

Weak Convergence Limits for Sojourn Times in Cyclic Queues Under Heavy Traffic Conditions

Cites Work

• Formulas and representations for cyclic Markovian networks via Palm calculus
• The cyclic queue with one general and one exponential server
• A note on cycle times in tree-like queueing networks
• Technical Note—On Normalizing Constants in Queueing Networks
• Sojourn times in queuing networks with multiserver modes
• The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues
• Sojourn times and the overtaking condition in Jacksonian networks
• Sojourn Times in Queueing Networks
• The Time for a Round Trip in a Cycle of Exponential Queues
• Conditional job-observer property for multitype closed queueing networks
• Closed Queuing Systems with Exponential Servers
• Computational algorithms for closed queueing networks with exponential servers

This page was built for publication: An invariance property of sojourn times in cyclic networks