Asymptotic behavior of large discrete-time cyclic queueing networks

DOI10.1214/AOAP/1177005074zbMath0810.60091OpenAlexW2081625937MaRDI QIDQ1333393

V. Pereyra

Publication date: 4 April 1995

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

Full work available at URL: https://doi.org/10.1214/aoap/1177005074

zbMATH Keywords

stationary distributionqueueing networkequilibrium distributioncyclic network of \(n\) single- server queues

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (4)

Features of some discrete-time cyclic queueing networks ⋮ Throughput limits from the asymptotic profile of cyclic networks with state-dependent service rates ⋮ Discrete time queueing networks with product form steady state. Availability and performance analysis in an integrated model ⋮ Asymptotic Throughput in Discrete‐Time Cyclic Networks with Queue‐Length‐Dependent Service Rates

This page was built for publication: Asymptotic behavior of large discrete-time cyclic queueing networks