Patterns of Buffer Overflow in a Class of Queues with Long Memory in the Input Stream

@inproceedings{Resnick1997PatternsOB,
  title={Patterns of Buffer Overflow in a Class of Queues with Long Memory in the Input Stream},
  author={Sidney Resnick and Gennady SamorodnitskyCornell UniversityAbstract},
  year={1997}
}
  • Sidney Resnick, Gennady SamorodnitskyCornell UniversityAbstract
  • Published 1997
We study the time it takes until a a uid queue with a nite, but large, holding capacity reaches the overrow point. The queue is fed by an on/oo process, with a heavy tailed on distribution, which is known to have long memory. It turns out that the expected time until overrow, as a function of capacity L, increases only polynomially fast, and so overrows happen much more often than in the \classical" light tailed case, where the expected overrow time increases as an exponential function of L… CONTINUE READING
Highly Cited
This paper has 55 citations. REVIEW CITATIONS

Topics

Statistics

0510'99'01'03'05'07'09'11'13'15'17
Citations per Year

56 Citations

Semantic Scholar estimates that this publication has 56 citations based on the available data.

See our FAQ for additional information.