- Call packing bound for overflow loss systems
- Performance Evaluation
- Volume | Issue number
- 66 | 1
- Pages (from-to)
- Number of pages
- Document type
- Faculty of Economics and Business (FEB)
- Amsterdam School of Economics Research Institute (ASE-RI)
Finite loss queues with overflow naturally arise in a variety of communications structures. For these systems, there is no simple analytic expression for the loss probability. This paper proves and promotes easily computable bounds based on the so-called call packing principle. Under call packing, a standard product form expression is available.
It is proven that call packing leads to a guaranteed upper bound for the loss probability. In addition, an analytic error bound for the accuracy is derived. This also leads to a secure lower bound. The call packing bound is also proven to be superior to the standard loss bound.
Numerical results seem to indicate that the call packing bound is a substantial improvement over the standard loss bound and a quite reasonable upper bound approximation. The results seem to support a practical usefulness.
Keywords: Overflow; Call packing; Finite loss queues; Product-form models
- go to publisher's site
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.