Call packing bounds for overflow queues

Finite queueing loss systems are studied with overflow. For these systems there is no simple analytic expression for the loss probability or throughput. This paper aims to prove and promote easily computable bounds as based upon 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 which also leads to a secure lower bound. The call packing bound is also proven to be superior to the standard Erlang bound. Numerical results seem to indicate that the call packing bound is a substantial improvement over the Erlang bound and a quite reasonable first order and secure upper bound approximation. The results thus seem to support a practical usefulness as well as further extension.

[1]  J. Doob.  Stochastic processes , 1953 .

[2]  R. Schassberger.  The insensitivity of stationary probabilities in networks of queues , 1978, Advances in Applied Probability.

[3]  A. Barbour.  Networks of queues and the method of stages , 1976, Advances in Applied Probability.

[4]  Peter G. Taylor,et al.  Modeling Handovers in Cellular Mobile Networks with Dynamic Channel Allocation , 1995, Oper. Res..

[5]  Peter G. Taylor,et al.  Strong Stochastic Bounds for the Stationary Distribution of a Class of Multicomponent Performability Models , 1998, Oper. Res..

[6]  Nico M. van Dijk,et al.  Bounds and error bounds for queueing networks , 1998, Ann. Oper. Res..

[7]  Nico M. van Dijk.  A formal proof for the insensitivity of simple bounds for finite multi-server non-exponential tandem queues based on monotonicity results , 1987 .

[8]  Nico M. van Dijk.  Mixed parallel processors with interdependent blocking , 1990 .

[9]  Peter G. Taylor,et al.  ALTERNATIVE ROUTING NETWORKS AND INTERRUPTIONS , 1988 .

[10]  William A. Massey,et al.  Stochastic ordering for Markov processes on partially ordered spaces with applications to queueing networks , 1991 .

[11]  S. Zachary,et al.  Loss networks , 2009, 0903.0640.

[12]  Peter G. Taylor,et al.  A PRODUCT-FORM 'LOSS NETWORK' WITH A FORM OF QUEUEING , 1997 .

[13]  K. Sladký,et al.  A note on uniformization for dynamic non-negative systems , 2000 .

[14]  Nico M. van Dijk.  Simple and insensitive bounds for a grading and an overflow model , 1987 .

[15]  Ward Whitt,et al.  Comparison methods for queues and other stochastic models , 1986 .

[16]  N. M. van Dijk,et al.  A Note on Bounds and Error Bounds for nonexponential Batch Arrival Systems. , 1996 .

[17]  A. Hordijk,et al.  Stochastic inequalities for an overflow model , 1987, Journal of Applied Probability.

[18]  Erik A. van Doorn,et al.  On the Overflow Process from a Finite Markovian Queue , 1984, Perform. Evaluation.

[19]  Moshe Shaked,et al.  Stochastic orders and their applications , 1994 .

[20]  Paul J. Schweitzer,et al.  Stochastic Models, an Algorithmic Approach , by Henk C. Tijms (Chichester: Wiley, 1994), 375 pages, paperback. , 1996, Probability in the Engineering and Informational Sciences.

[21]  李幼升,et al.  Ph , 1989 .

[22]  D. Sonderman.  Comparing multi-server queues with finite waiting rooms, II: Different numbers of servers , 1979, Advances in Applied Probability.

[23]  N. L. Lawrie,et al.  Comparison Methods for Queues and Other Stochastic Models , 1984 .

[24]  Arie Hordijk,et al.  Stochastic inequalities for queueing networks , 1986 .

[25]  R. I. Wilkinson.  The interconnection of telephone systems — Graded multiples , 1931 .