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

DOI10.1023/A:1019143221956zbMATH Open0949.90016OpenAlexW1605858860MaRDI QIDQ1809736FDOQ1809736

Authors: 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

Recommendations

• Overflow and losses in a network queue with a self-similar input
• scientific article; zbMATH DE number 1420992
• Cell loss asymptotics for buffers fed with a large number of independent stationary sources
• Buffer overflow asymptotics for a buffer handling many traffic sources

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (5)

• On the moments of overflow and freed carried traffic for the \(GI/M/C/0\) system
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the enrouting protocol problem under uncertainty
• Overflow and losses in a network queue with a self-similar input

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809736)