The ballot theorem strikes again: packet loss process distribution
From MaRDI portal
Publication:2705983
DOI10.1109/18.887866zbMath0999.94501OpenAlexW2162313757MaRDI QIDQ2705983
Omer Gurewitz, Israel Cidon, Moshe Sidi
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
blocking probabilityfinite queueshigh-speed networksBallot Theoremforward error recoverypacket loss processes
Combinatorial probability (60C05) Circuits, networks (94C99) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication theory (94A05)
Related Items
Packet loss characteristics for \(M/G/1/N\) queueing systems, The distribution of the number of arrivals in a subinterval of a busy period of a single server queue, Takács' asymptotic theorem and its applications: a survey, On the loss process in a batch arrival queue