The ballot theorem strikes again: packet loss process distribution

Omer Gurewitz, Moshe Sidi, Israel Cidon

Research output: Contribution to journalArticlepeer-review

26 Scopus citations


The probability distribution of the number of lost packets within a block of consecutive packet arrivals into a finite buffer is an important quantity in various networking problems. In a recent paper, Cidon, Khamisy, and Sidi introduced a recursive scheme to derive this distribution. In this paper, we derive explicit expressions for this distribution using various versions of the powerful Ballot Theorem. The expressions are derived for a single source M/M/l/K queue.

Original languageEnglish
Pages (from-to)2588-2595
Number of pages8
JournalIEEE Transactions on Information Theory
Issue number7
StatePublished - 1 Dec 2000
Externally publishedYes


  • Ballot theorem
  • Blocking probability
  • Finite queues
  • Forward error recovery
  • High-speed networks
  • Packet loss processes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'The ballot theorem strikes again: packet loss process distribution'. Together they form a unique fingerprint.

Cite this