Skip to main content
Log in

Algorithmic Solutions to Two-Dimensional Birth–Death Processes with Application to Capacity Planning

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Capacity planning of modern telecommunication systems using the Erlang-B or Erlang-C models is hampered by the inability of these models to capture critical system characteristics. Two-dimensional birth–death models offer the opportunity to remedy this. The steady state behavior of two-dimensional birth–death processes is found by numerically solving a linear matrix equation whose special structure is exploited to substantially speed its solution. Two detailed applications drawn from telecommunications capacity planning are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. Engeln-Mullges and F. Uhlig, Numerical Algorithms with Fortran (Springer, Berlin, 1996).

    Google Scholar 

  2. D.P. Gaver, P.A. Jacobs and G. Latouche, Finite birth-and-death models in randomly changing environments, Advances in Applied Probability 16 (1984) 715–731.

    Google Scholar 

  3. W.K. Grassmann, M.I. Taskar and D.P. Heyman, Regenerative analysis and steady state distributions for Markov chains, Operations Research 35 (1985) 1107–1116.

    Google Scholar 

  4. J. Keilson, U. Sumita and M. Zachmann, Row-continuous finite Markov chains - structures and algorithms, Journal of Operations Research Soc. Japan 3 (1987) 291–314, also University of Rochester Working paper No. 8115 (1981).

    Google Scholar 

  5. J. Keilson and M. Zachmann, Homogeneous row-continuous bivariate Markov chains with boundaries, Journal of Applied Probability 25a (1988) 237–256.

    Google Scholar 

  6. M. Neuts, Matrix Geometric Solutions in Stochastic Models - An Algorithmic Approach (Johns Hopkins Univ. Press, Baltimore, MD, 1981).

    Google Scholar 

  7. L.D. Servi, Algorithmic solutions to recursively tridiagonal linear equations with applications to multi-dimensional birth-death equations, INFORMS Journal on Computing (1999) submitted.

  8. L.D. Servi, A recursive algorithm for solving multi-dimensional birth-death models, Journal of Applied Probability (2000) submitted.

  9. L.D. Servi and L. Liu, A complete solution to the singular problem encountered when solving multi-dimensional birth-death equations (2000) in preparation.

  10. W.J. Stewart, Introduction to the Numerical Solutions of Markov Chains (Princeton Univ. Press, Princeton, 1994).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Servi, L. Algorithmic Solutions to Two-Dimensional Birth–Death Processes with Application to Capacity Planning. Telecommunication Systems 21, 205–212 (2002). https://doi.org/10.1023/A:1020942430425

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020942430425

Navigation