Convexity of Inverse Blocking Curves in Loss Systems
- 12 October 2026
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
Abstract
Why Larger Service Systems Benefit More from Scale How much extra demand can a service system handle when capacity is increased while keeping the same target level of customer blocking? In the paper “Convexity of Inverse Blocking Curves in Loss Systems,” Benjamin Legros establishes an exact economies-of-scale result for loss systems. The paper proves that the maximum supportable demand is an increasing and globally convex function of the number of servers. In practical terms, as a system becomes larger, each additional server can support progressively more additional demand while maintaining the same blocking target. Equivalently, the extra capacity required to accommodate additional demand decreases as the system grows. The result provides a rigorous mathematical foundation for resource pooling in capacity-constrained services. It applies to the classical Erlang-B loss model and extends to systems with a finite waiting room, with potential relevance for telecommunications, healthcare, emergency response, and other service operations.Keywords
This publication has 21 references indexed in Scilit:
- Managing Reusable Resources With Usage Time LimitsProduction and Operations Management, 2025
- Sharp and simple bounds for the Erlang delay and loss formulaeQueueing Systems, 2009
- Monotonicity and supermodularity results for the Erlang loss systemOperations Research Letters, 2009
- Monotonicity and error bounds for networks of Erlang loss queuesQueueing Systems, 2009
- Improved approximations for the Erlang loss modelQueueing Systems, 2009
- Asymptotic Inversion of the Erlang B FormulaSIAM Journal on Applied Mathematics, 2009
- Gaussian expansions and bounds for the Poisson distribution applied to the Erlang B formulaAdvances in Applied Probability, 2008
- On the convexity of loss probabilities when arrivals occur in batches and servers are heterogeneousOperations Research Letters, 2007
- Some Properties of the Erlang Loss FunctionBell System Technical Journal, 1974
- Proof of a Convexity Property of the Erlang B FormulaBell System Technical Journal, 1972