Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-27T12:12:18.644Z Has data issue: false hasContentIssue false
  • English
  • Français

HITTING TIME IN AN ERLANG LOSS SYSTEM

Published online by Cambridge University Press:  21 May 2002

Sheldon M. Ross  and
Sridhar Seshadri
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
Get access Rights & Permissions [Opens in a new window]

Abstract

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
Information
Probability in the Engineering and Informational Sciences , Volume 16 , Issue 2 , April 2002 , pp. 167 - 184
Copyright
© 2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)