TY - GEN

T1 - The Information Velocity of Packet-Erasure Links

AU - Domanovitz, Elad

AU - Philosof, Tal

AU - Khina, Anatoly

N1 - Publisher Copyright:
© 2022 IEEE.

PY - 2022

Y1 - 2022

N2 - 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 probabilities. We then elevate all these results for a stream of packets with independent geometrically distributed interarrival times, and prove that the information velocity and the exponential decay rate remain the same for any stationary ergodic arrival process and for deterministic interarrival times. We demonstrate the significance of the derived fundamental limits - the information velocity and the arrive-failure exponential decay rate - by comparing them to simulation results.

AB - 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 probabilities. We then elevate all these results for a stream of packets with independent geometrically distributed interarrival times, and prove that the information velocity and the exponential decay rate remain the same for any stationary ergodic arrival process and for deterministic interarrival times. We demonstrate the significance of the derived fundamental limits - the information velocity and the arrive-failure exponential decay rate - by comparing them to simulation results.

KW - Packet erasures

KW - error exponent

KW - information velocity

KW - multi-stage queues

UR - http://www.scopus.com/inward/record.url?scp=85133267302&partnerID=8YFLogxK

U2 - 10.1109/INFOCOM48880.2022.9796916

DO - 10.1109/INFOCOM48880.2022.9796916

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85133267302

T3 - Proceedings - IEEE INFOCOM

SP - 190

EP - 199

BT - INFOCOM 2022 - IEEE Conference on Computer Communications

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 41st IEEE Conference on Computer Communications, INFOCOM 2022

Y2 - 2 May 2022 through 5 May 2022

ER -