Skip to main content
Log in

On the Number of Lost Customers in Stationary Loss Systems in the Light Traffic Case

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

For the stationary loss systems M/M/m/K and GI/M/m/K, we study two quantities: the number of lost customers during the time interval (0,t] (the first system only), and the number of lost customers among the first n customers to arrive (both systems). We derive explicit bounds for the total variation distances between the distributions of these quantities and compound Poisson–geometric distributions. The bounds are small in the light traffic case, i.e., when the loss of a customer is a “rare” event. To prove our results, we show that the studied quantities can be interpreted as accumulated rewards of stationary renewal reward processes, embedded into the queue length process or the process of queue lengths immediately before arrivals of new customers, and apply general results by Erhardsson on compound Poisson approximation for renewal reward processes.

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. S. Asmussen, Applied Probability and Queues (Wiley, Chichester, 1987).

    Google Scholar 

  2. A.D. Barbour and A. Xia, Poisson perturbations, ESAIM Probab. Statist. 3 (1999) 131-150.

    Google Scholar 

  3. E. Çinlar and R.L. Disney, Stream of overflows from a finite queue, Oper. Res. 15 (1967) 131-134.

    Google Scholar 

  4. T. Erhardsson, On stationary renewal reward processes where most rewards are zero, Probab. Theory Related Fields 117 (2000) 145-161.

    Google Scholar 

  5. A.K. Erlang, Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges, Elektroteknikeren 13 (1917) 5-13 (in Danish); translation in: E. Brockmeyer, H.A. Halstrøm and A. Jensen, The Life and Works of A.K. Erlang, Trans. Danish Acad. Tech. Sci. No. 2 (1948).

    Google Scholar 

  6. D.C. McNickle, A note on congestion in overflow queues, Opsearch 19 (1982) 171-177.

    Google Scholar 

  7. C. Palm, Intensitätsschwankungen im Fernsprechverkehr, Ericsson Technics, Vol. 44 (1943) pp. 1-189 (in German); translated as: Intensity Variations in Telephone Traffic, North-Holland Studies in Telecommunication, Vol. 10 (Elsevier Science Publishers, Amsterdam, 1988).

    Google Scholar 

  8. T. Rolski, Stationary Random Processes Associated with Point Processes, Lecture Notes in Statistics, Vol. 5 (Springer, New York, 1981).

    Google Scholar 

  9. B.A. Sevastyanov, An ergodic theorem for Markov processes and its application to telephone systems with refusals, Theory Probab. Appl. 2 (1957) 104-112.

    Google Scholar 

  10. L. Takács, On a probability problem concerning telephone traffic, Acta Math. Acad. Sci. Hungar. 8 (1957) 319-324.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Erhardsson, T. On the Number of Lost Customers in Stationary Loss Systems in the Light Traffic Case. Queueing Systems 38, 25–47 (2001). https://doi.org/10.1023/A:1010868028010

Download citation

  • Issue Date:

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

Navigation