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

DOI10.1239/jap/1214950351zbMath1151.60040OpenAlexW2152764976MaRDI QIDQ3516407

Hans Daduna, Ryszard Szekli, Christian Malchin

Publication date: 5 August 2008

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/1214950351

zbMATH Keywords

heavy trafficcentral limit theoremcyclic queuesbottleneck nodejoint sojourn time distribution

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

The cyclic queue and the tandem queue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bottleneck analysis in multiclass closed queueing networks and its application
• An invariance property of sojourn times in cyclic networks
• Technical Note—On Normalizing Constants in Queueing Networks
• Conditioned Response-Time Distribution for a Large Closed Processor-Sharing System in Very Heavy Usage
• The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues
• The Cycle Time Distribution of Exponential Cyclic Queues
• State of the Art—Networks of Queues: A Survey of Weak Convergence Results
• 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