[论文解读] Network Codes with Overlapping Chunks over Line Networks: A Case for Linear-Time Codes

Anoosheh Heidarzadeh, Amir H. Banihashemi|arXiv (Cornell University)|May 28, 2011

Cooperative Communication and Network Coding参考文献 20被引用 9

一句话总结

本文提出重叠分块编码（OCC）用于线路网络，实现线性时间网络编码，并在任意调度下相比传统分块编码（CC）实现更快的收敛速度。通过允许分块重叠，OCC 在计算效率与误码率之间实现了更优的权衡，在保持容量逼近性能的同时，使用小而固定的分块大小，优于传统CC。

ABSTRACT

In this paper, the problem of designing network codes that are both communicationally and computationally efficient over packet line networks with worst-case schedules is considered. In this context, random linear network codes (dense codes) are asymptotically capacity-achieving, but require highly complex coding operations. To reduce the coding complexity, Maymounkov et al. proposed chunked codes (CC). Chunked codes operate by splitting the message into non-overlapping chunks and send a randomly chosen chunk at each transmission time by a dense code. The complexity, that is linear in the chunk size, is thus reduced compared to dense codes. In this paper, the existing analysis of CC is revised, and tighter bounds on the performance of CC are derived. As a result, we prove that (i) CC with sufficiently large chunks are asymptotically capacity-achieving, but with a slower speed of convergence compared to dense codes; and (ii) CC with relatively smaller chunks approach the capacity with an arbitrarily small but non-zero constant gap. To improve the speed of convergence of CC, while maintaining their advantage in reducing the computational complexity, we propose and analyze a new CC scheme with overlapping chunks, referred to as overlapped chunked codes (OCC). We prove that for smaller chunks, which are advantageous due to lower computational complexity, OCC with larger overlaps provide a better tradeoff between the speed of convergence and the message or packet error rate. This implies that for smaller chunks, and with the same computational complexity, OCC outperform CC in terms of the speed of approaching the capacity for sufficiently small target error rate. In fact, we design linear-time OCC with very small chunks (constant in the message size) that are both computationally and communicationally efficient, and that outperform linear-time CC.

研究动机与目标

• 解决在任意调度下线路网络中网络编码的计算复杂度与收敛速度之间的权衡问题。
• 改进现有分块编码（CC）的性能，后者尽管复杂度降低，但收敛速度仍较慢。
• 设计一种新型编码方案，在保持低计算成本的同时，能更快速地逼近容量，尤其适用于小消息尺寸。
• 通过最坏情况调度下的渐近分析与有限长度分析，严格分析OCC的性能。

提出的方法

• 提出重叠分块编码（OCC），其中消息被划分为重叠的分块，而非非重叠分块。
• 对每个重叠分块应用随机线性网络编码，以降低每分块的编码复杂度。
• 使用Janson不等式与集中不等式分析分块可解码的概率与误码率。
• 通过依赖指示变量的分数覆盖，推导不可恢复分块比例的上界。
• 将网络建模为具有单输入单输出最坏情况调度的线路，并分析在负相关超分块邻域下的性能。
• 通过有限长度仿真验证理论结果，结果与渐近分析一致。

实验结果

研究问题

• RQ1 具有重叠分块的分块编码能否在保持低计算复杂度的同时，相比传统非重叠分块编码更快地逼近容量？
• RQ2 OCC与密集编码在消息误码率与收敛速度方面的性能差距如何？
• RQ3 重叠参数如何影响OCC中计算成本与误码率之间的权衡？
• RQ4 使用固定大小分块的OCC能否实现线性时间复杂度，同时仍优于现有线性时间编码方案？
• RQ5 在任意调度下，OCC中不可恢复消息分组比例的最紧可达上界是什么？

主要发现

• 当重叠足够大时，OCC渐近逼近网络容量，但相同误码率下收敛速度慢于CC。
• 对于较小分块，OCC在较大重叠下比CC更快收敛至容量，尤其在目标误码率较低时优势明显。
• 使用固定大小分块（与消息长度线性相关）的OCC实现线性时间编码与解码复杂度，同时优于现有线性时间CC方案。
• OCC中不可恢复消息分组的比例紧密集中在上界η附近，其偏离概率受 e−eck 限制，其中 c = O(λ/α)。
• 有限长度仿真验证了理论结果，表明使用小而重叠的分块时，OCC相比CC显著降低误码率并提升收敛速度。
• 分析证明，当重叠参数τ与孔径大小 α = Ω((l³/λ³)τ ln((l/λǫ)τ)) 时，OCC在任意调度下以高概率实现高可靠性。