The ballot theorem strikes again: Packet loss process distribution

DOI10.1109/18.887866MaRDI QIDQ2705983zbMATH OpenOpenAlexFDO

Authors Omer Gurewitz, Moshe Sidi, Israel Cidon

Publication date 19 March 2001

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/a5f1078249940e69c8e8b44cb07925296108ad39

zbMATH Keywords

blocking probabilityfinite queueshigh-speed networksBallot Theoremforward error recoverypacket loss processes

Mathematics Subject Classification ID

Communication theory (94A05) Circuits, networks (94C99) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Combinatorial probability (60C05)

Recommendations

• On the loss process in a batch arrival queue
• The distribution of the number of arrivals in a subinterval of a busy period of a single server queue
• Cell loss probability for M/G/1 and time-slotted queues
• Duality and Other Results for M/G/1 and GI/M/1 Queues, Via a New Ballot Theorem
• Ballots, queues and random graphs

Cited in

(4)

• On the loss process in a batch arrival queue
• The distribution of the number of arrivals in a subinterval of a busy period of a single server queue
• Packet loss characteristics for \(M/G/1/N\) queueing systems
• Takács' asymptotic theorem and its applications: a survey

This page was built for publication: The ballot theorem strikes again: Packet loss process distribution

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