The Time for a Round Trip in a Cycle of Exponential Queues
From MaRDI portal
Publication:4746783
DOI10.1145/322358.322369zbMath0508.68022DBLPjournals/jacm/SchassbergerD83OpenAlexW2012643894WikidataQ56574521 ScholiaQ56574521MaRDI QIDQ4746783
Publication date: 1983
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322358.322369
Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (12)
Features of some discrete-time cyclic queueing networks ⋮ An invariance property of sojourn times in cyclic networks ⋮ The cycle time distribution of exponential cyclic queues with multiple servers ⋮ Weak Convergence Limits for Sojourn Times in Cyclic Queues Under Heavy Traffic Conditions ⋮ Dependence structure of sojourn times via partition separated ordering ⋮ The cyclic queue and the tandem queue ⋮ Estimating the throughput of an exponential CONWIP assembly system ⋮ Cycle times in single server cyclic Jackson networks. ⋮ Cyclic queueing networks with subexponential service times ⋮ Estimating variance of output from cyclic exponential queueing systems ⋮ Travel times in queueing networks and network sojourns ⋮ The cycle-time distribution in a central server network with state-dependent branching
This page was built for publication: The Time for a Round Trip in a Cycle of Exponential Queues