A Note on Evaluating the Overflow Probability Using the Infinite Queue

Benjamin Avi-Itzhak and Shlomo Halfin
Additional contact information
Benjamin Avi-Itzhak: Rutgers Center for Operations Research, Rutgers University, New Brunswick, New Jersey 08903
Shlomo Halfin: Rutgers Center for Operations Research, Rutgers University, New Brunswick, New Jersey 08903

Management Science, 1995, vol. 41, issue 8, 1402-1403

Abstract: This note evaluates the approximation of overflow probability put forward by Sakasegawa et al (in a paper published recently in Management Science [5]), and its level of accuracy when applied to traffic generated by bursty sources.

Keywords: overflow probability; ATM networks; queueing; bursty traffic (search for similar items in EconPapers)
Date: 1995
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.41.8.1402 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:41:y:1995:i:8:p:1402-1403

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().