The time-dependent Erlang loss model with retrials

Nathaniel Grier, William A. Massey, Tyrone McKoy, Ward Whitt

Research output: Contribution to journalArticlepeer-review

22 Scopus citations


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.

Original languageEnglish (US)
Pages (from-to)253-265
Number of pages13
JournalTelecommunication Systems
Issue number1-3
StatePublished - 1997
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering


Dive into the research topics of 'The time-dependent Erlang loss model with retrials'. Together they form a unique fingerprint.

Cite this