Throughput limits from the asymptotic profile of cyclic networks with state-dependent service rates
From MaRDI portal
Publication:931401
DOI10.1007/S11134-008-9067-8zbMath1151.60041OpenAlexW1974022981MaRDI QIDQ931401
Publication date: 25 June 2008
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-008-9067-8
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (3)
Analysis of semi-open queueing networks using lost customers approximation with an application to robotic mobile fulfilment systems ⋮ Separable models for interconnected production-inventory systems ⋮ Throughput limits from the asymptotic profile of cyclic networks with state-dependent service rates
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Throughput limits from the asymptotic profile of cyclic networks with state-dependent service rates
- Monotonicity of the throughput of a closed exponential queueing network in the number of jobs
- Bottleneck analysis in multiclass closed queueing networks and its application
- Queue length and occupancy in discrete-time cyclic networks with several types of nodes
- Asymptotic behavior of large discrete-time cyclic queueing networks
- A queueing theoretical proof of increasing property of Polya frequency functions
- Condensation in large closed Jackson networks
- Asymptotic Throughput in Discrete‐Time Cyclic Networks with Queue‐Length‐Dependent Service Rates
- Closed Queuing Systems with Exponential Servers
- Queueing networks with discrete time scale. Explicit expressions for the steady state behaviour of discrete time stochastic networks
This page was built for publication: Throughput limits from the asymptotic profile of cyclic networks with state-dependent service rates
