Skip to main content
Log in

The time‐dependent Erlang loss model with retrials

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

We consider a generalization of the classical Erlang loss model with both retrials of blocked calls and a time‐dependent arrival rate. We make exponential‐distribution assumptions so that the number of calls in progress and the number of calls in retry mode form a nonstationary, two‐dimensional, continuous‐time Markov chain. We then approximate the behavior of this Markov chain by two coupled nonstationary, one‐dimensional Markov chains, which we solve numerically. We also develop an efficient method for simulating the two‐dimensional Markov chain based on performing many replications within a single run. Finally, we evaluate the approximation by comparing it to the simulation. Numerical experience indicates that the approximation does very well in predicting the time‐dependent mean number of calls in progress and the times of peak blocking. The approximation of the time‐dependent blocking probability also is sufficiently accurate to predict the number of lines needed to satisfy blocking probability requirements.

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.

Similar content being viewed by others

References

  1. J.W. Cohen, Basic problems of telephone traffic theory and the influence of repeated calls, Philips Telecom. Rev. 18 (1957) 49–100.

    Google Scholar 

  2. G. Falin, A survey of retrial queues, Queueing Systems 7 (1990) 127–167.

    Article  Google Scholar 

  3. D.L. Jagerman, Nonstationary blocking in telephone traffic, Bell System Technical Journal 54 (1975) 625–661.

    Google Scholar 

  4. F.P. Kelly, Loss networks, Ann. Appl. Probab. 1 (1991) 319–378.

    Google Scholar 

  5. A.Y. Khintchin, Mathematical methods in the theory of queueing, Trudy Math. Inst. Steklov. 49 (1955) (in Russian). English translation by Charles Griffin and Co., London (1960).

    Google Scholar 

  6. L. Kosten, On the influence of repeated calls in the theory of probabilities of blocking, De Ingenieur 59 (1947) 1–25 (in Dutch).

    Google Scholar 

  7. W.A. Massey and W. Whitt, An analysis of the modified offered load approximation for the nonstationary Erlang loss model, Ann. Appl. Probab. 4 (1994) 1145–1160.

    Google Scholar 

  8. C. Palm, Intensity variations in telephone traffic, Ericsson Technics 44 (1943) 1–189 (in German). English translation by North-Holland, Amsterdam (1988).

    Google Scholar 

  9. R. Syski, Introduction to Congestion Theory in Telephone Systems (North-Holland, Amsterdam, 2nd ed., 1986).

    Google Scholar 

  10. M.R. Taaffe and K.L. Ong, Approximating Ph(t)/M(t)/S/C queueing systems, Ann. Oper. Res. 8 (1987) 103–116.

    Article  Google Scholar 

  11. W. Whitt, Blocking when service is required from several facilities simultaneously, AT&T Tech. J. 64 (1985) 1807–1856.

    Google Scholar 

  12. R.W. Wolff, Stochastic Modeling and the Theory of Queues (Prentice-Hall, Englewood Cliffs, NJ, 1989).

    Google Scholar 

  13. T. Yang and J.G.C. Templeton, A survey on retrial queues, Queueing Systems 2 (1987) 201–233.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grier, N., Massey, W.A., McKoy, T. et al. The time‐dependent Erlang loss model with retrials. Telecommunication Systems 7, 253–265 (1997). https://doi.org/10.1023/A:1019176413237

Download citation

  • Issue Date:

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

Keywords

Navigation