Hostname: page-component-7b9c58cd5d-bslzr Total loading time: 0.001 Render date: 2025-03-15T04:24:44.269Z Has data issue: false hasContentIssue false

HITTING TIME IN AN ERLANG LOSS SYSTEM

Published online by Cambridge University Press:  21 May 2002

Sheldon M. Ross
Affiliation:
Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA 94720, E-mail: ross@newton.me.berkeley.edu
Sridhar Seshadri
Affiliation:
Operations Management Department, Leonard N. Stern School of Business, New York University, New York, NY 10012, E-mail: sseshadri@stern.nyu.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this article, we develop methods for estimating the expected time to the first loss in an Erlang loss system. We are primarily interested in estimating this quantity under light traffic conditions. We propose and compare three simulation techniques as well as two Markov chain approximations. We show that the Markov chain approximations proposed by us are asymptotically exact when the load offered to the system goes to zero. The article also serves to highlight the fact that efficient estimation of transient quantities of stochastic systems often requires the use of techniques that combine analytical results with simulation.

Type
Research Article
Copyright
© 2002 Cambridge University Press