Queue length and occupancy in discrete-time cyclic networks with several types of nodes
From MaRDI portal
Publication:1306533
DOI10.1023/A:1019122617412zbMath0934.90020OpenAlexW172231044MaRDI QIDQ1306533
Publication date: 4 October 1999
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1019122617412
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (2)
Throughput limits from the asymptotic profile of cyclic networks with state-dependent service rates ⋮ Asymptotic Throughput in Discrete‐Time Cyclic Networks with Queue‐Length‐Dependent Service Rates
This page was built for publication: Queue length and occupancy in discrete-time cyclic networks with several types of nodes