Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On the speed of convergence to stationarity of the Erlang loss system
 

Summary: On the speed of convergence to stationarity
of the Erlang loss system
Erik A. van Doorna
and Alexander I. Zeifmanb
a
Department of Applied Mathematics, University of Twente
P.O. Box 217, 7500 AE Enschede, The Netherlands
E-mail: e.a.vandoorn@utwente.nl
b
Vologda State Pedagogical University
Institute of Informatics Problems RAS
and VSCC CEMI RAS
S. Orlova 6, Vologda, Russia
E-mail: zai@uni-vologda.ac.ru
July 14, 2009
Abstract. We consider the Erlang loss system, characterized by N servers,
Poisson arrivals and exponential service times, and allow the arrival rate to be
a function of N. We discuss representations and bounds for the rate of conver-
gence to stationarity of the number of customers in the system, and display
some bounds for the total variation distance between the time-dependent and

  

Source: Al Hanbali, Ahmad - Department of Applied Mathematics, Universiteit Twente

 

Collections: Engineering