Blank Space: Adaptive Causal Coding for Streaming Communications Over Multi-Hop Networks
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918509875822592 |
|---|---|
| author | Gitik, Rivka Waxman, Adina Ginzach, Shai Glam, Aviel Cohen, Alejandro |
| author_facet | Gitik, Rivka Waxman, Adina Ginzach, Shai Glam, Aviel Cohen, Alejandro |
| contents | In this work, we introduce Blank Space Adaptive Causal Random Linear Network Coding (BS-AC-RLNC), a novel coding scheme designed to mitigate the triplet trade-off between throughput-delay-efficiency in multi-hop networks. BS-AC-RLNC leverages the physical limitations of the network, considering the bottleneck from each node to the destination. In particular, this approach introduces a light-computational re-encoding algorithm, called AC-RLNC (NET), implemented independently at intermediate nodes. NET adaptively adjusts the Forward Error Correction (FEC) rates and schedules idle periods. It incorporates two distinct suspension mechanisms: 1) Blank Space Period, accounting for the forward-channels bottleneck, and 2) No-New No-FEC approach, based on data availability. We present theoretical lower and upper bounds on in-order delivery delay, goodput, and throughput; in the case of in-order delay, we further derive a mean bound. These analytical results are extended to the multicast scenario, providing a broader understanding of the algorithm's performance under diverse network conditions. The experimental results achieve significant improvements in resource efficiency, demonstrating a 20% reduction in channel usage compared to baseline RLNC solutions. Notably, these efficiency gains are achieved while maintaining competitive throughput and delay performance, ensuring improved resource utilization does not compromise network performance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_11984 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Blank Space: Adaptive Causal Coding for Streaming Communications Over Multi-Hop Networks Gitik, Rivka Waxman, Adina Ginzach, Shai Glam, Aviel Cohen, Alejandro Information Theory Networking and Internet Architecture In this work, we introduce Blank Space Adaptive Causal Random Linear Network Coding (BS-AC-RLNC), a novel coding scheme designed to mitigate the triplet trade-off between throughput-delay-efficiency in multi-hop networks. BS-AC-RLNC leverages the physical limitations of the network, considering the bottleneck from each node to the destination. In particular, this approach introduces a light-computational re-encoding algorithm, called AC-RLNC (NET), implemented independently at intermediate nodes. NET adaptively adjusts the Forward Error Correction (FEC) rates and schedules idle periods. It incorporates two distinct suspension mechanisms: 1) Blank Space Period, accounting for the forward-channels bottleneck, and 2) No-New No-FEC approach, based on data availability. We present theoretical lower and upper bounds on in-order delivery delay, goodput, and throughput; in the case of in-order delay, we further derive a mean bound. These analytical results are extended to the multicast scenario, providing a broader understanding of the algorithm's performance under diverse network conditions. The experimental results achieve significant improvements in resource efficiency, demonstrating a 20% reduction in channel usage compared to baseline RLNC solutions. Notably, these efficiency gains are achieved while maintaining competitive throughput and delay performance, ensuring improved resource utilization does not compromise network performance. |
| title | Blank Space: Adaptive Causal Coding for Streaming Communications Over Multi-Hop Networks |
| topic | Information Theory Networking and Internet Architecture |
| url | https://arxiv.org/abs/2502.11984 |