Monotonicity and error bounds for networks of Erlang loss queues
From MaRDI portal
Publication:833104
DOI10.1007/s11134-009-9118-9zbMath1166.90325OpenAlexW2143720727MaRDI QIDQ833104
Richard J. Boucherie, Nico M. van Dijk
Publication date: 11 August 2009
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-009-9118-9
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
Cites Work
- Loss networks
- Monotone matrices and monotone Markov processes
- Blocking probabilities in mobile communications networks with time-varying rates and redialing subscribers
- Simple Bounds and Monotnicity the Call Congestion of Finite Multiserver Delay Systems
- Monotonicity of the Throughput of a Closed Queueing Network in the Number of Jobs
- Stochastic Orderings for Markov Processes on Partially Ordered Spaces
- Perturbation theory for unbounded Markov reward processes with applications to queueing
- Perturbation theory for Markov reward processes with applications to queueing systems
- Monotonicity of throughput in non-Markovian networks
- Comparing counting processes and queues
- Bounds and Approximations in Queuing through Monotonicity and Continuity
- Comparing multi-server queues with finite waiting rooms, I: Same number of servers
- Comparing multi-server queues with finite waiting rooms, II: Different numbers of servers
- ASYMPTOTIC EVALUATION OF BLOCKING PROBABILITIES IN A HIERARCHICAL CELLULAR MOBILE NETWORK
- On a Queueing Network Model for Cellular Mobile Telecommunications Networks
- Modeling Handovers in Cellular Mobile Networks with Dynamic Channel Allocation
- A Note on Bounds and Error Bounds for Nonexponential Batch Arrival Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
