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 convergence to stationarity of the number of customers in the system, and display some bounds for the total variation distance between the time-dependent and stationary distributions. We also pay attention to time-dependent rates.
|Name||Memorandum / Department of Applied Mathematics|
|Publisher||University of Twente, Department of Applied Mathematics|
- Charlier polynomials
- Rate of convergence
- Total variation distance