The ballot theorem strikes again: packet loss process distribution

Authors:
O. Gurewitz;M. Siki;S. Cidon
Affiliations:
Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 8

On Loss Probabilities in Presence of Redundant Packets with Random Drop

NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Utility Analysis of Simple FEC Schemes for VoIP

NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
On loss probabilities in presence of redundant packets with random drop

Performance Evaluation
The distribution of the number of arrivals in a subinterval of a busy period of a single server queue

Queueing Systems: Theory and Applications
On the effects of the packet size distribution on FEC performance

Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
On the effects of the packet size distribution on FEC performance

Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
Packet size distribution: an aside?

QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
On the packet loss process at a network node

NEW2AN'06 Proceedings of the 6th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking

Quantified Score

Hi-index	754.84

Visualization

Abstract

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 previous paper, Cidon, Khamisy and Sidi (1993) 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/1/K queue