Overflow and loss probabilities in a finite ATM buffer fed by self-similar traffic

DOI10.1023/A:1019143221956zbMath0949.90016OpenAlexW1605858860MaRDI QIDQ1809736

Boris Tsyabakov, Nicolas D. Georganas

Publication date: 10 September 2000

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019143221956

zbMATH Keywords

lower boundsself-similar trafficATM queue systembuffer-overflowcell-loss probabilitiesself-similar cell input traffic

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (1)

On the enrouting protocol problem under uncertainty

This page was built for publication: Overflow and loss probabilities in a finite ATM buffer fed by self-similar traffic