The Information Velocity of Packet-Erasure Links
Elad Domanovitz, Tal Philosof, Anatoly Khina

TL;DR
This paper analyzes the maximum reliable transmission rate, called information velocity, over cascaded packet-erasure links with acknowledgment signals, providing bounds and decay rates for failure probabilities in various scenarios.
Contribution
It derives tight bounds on failure probabilities and introduces the concept of information velocity for packet transmission over erasure links, extending results to various arrival processes.
Findings
Derived tight bounds on arrive-failure probability.
Defined and characterized the information velocity.
Extended results to general stationary ergodic arrival processes.
Abstract
We consider the problem of in-order packet transmission over a cascade of packet-erasure links with acknowledgment (ACK) signals, interconnected by relays. We treat first the case of transmitting a single packet, in which ACKs are unnecessary, over links with independent identically distributed erasures. For this case, we derive tight upper and lower bounds on the probability of arrive failure within an allowed end-to-end communication delay over a given number of links. When the number of links is commensurate with the allowed delay, we determine the maximal ratio between the two -- coined information velocity -- for which the arrive-failure probability decays to zero; we further derive bounds on the arrive-failure probability when the ratio is below the information velocity, determine the exponential arrive-failure decay rate, and extend the treatment to links with different erasure…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Mobile Ad Hoc Networks · Wireless Communication Security Techniques
