Improved approximations for the Erlang loss model

DOI10.1007/s11134-009-9117-xzbMath1190.90037OpenAlexW2025625324MaRDI QIDQ2269482

Yingdong Lu, M. Sharma, Jonatha Anselmi, Mark S. Squillante

Publication date: 17 March 2010

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-009-9117-x

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Nonlinear programming (90C30) Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Signal detection and filtering (aspects of stochastic processes) (60G35)

Related Items

Revisiting Stochastic Loss Networks: Structures and Approximations ⋮ Economies-of-Scale in Many-Server Queueing Systems: Tutorial and Partial Review of the QED Halfin--Whitt Heavy-Traffic Regime

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Loss networks
• Computational complexity of loss networks
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
• Structural Analysis of a Queueing System with Multiclasses of Correlated Arrivals and Blocking
• On critically loaded loss networks
• Insensitivity of blocking probabilities in a circuit-switching network
• Blocking probabilities in large circuit-switched networks
• Probabilistic Models of Database Locking
• Routing in circuit-switched networks: optimization, shadow prices and decentralization
• A Proof for the Queuing Formula: L = λW