arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1008.0045cs.ITmath.IT
收藏

通用的鲁棒分布式网络码

Universal and Robust Distributed Network Codes

Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lingxiao Xia

摘要:

随机线性网络码可以以分布式方式设计和实现,具有低计算复杂性。然而,这些代码是经典的有限域上实现的,其大小取决于一些全局网络参数(网络的大小,汇的数量),可能是未知的代码设计之前。此外,如果新节点加入,整个网络代码可能必须重新设计。在这项工作中,我们提出了第一个通用的和强大的分布式线性网络编码方案。我们的计划是通用的,因为他们是独立的所有网络参数。它们是鲁棒的,因为如果节点加入或离开,剩余的节点不需要改变它们的编码操作,并且接收器仍然可以解码。它们是分布式的,因为节点只需要具有关于它们上游的网络部分的拓扑信息,这些信息可以作为通信协议的一部分自然地流传输。我们提出的概率和确定性的计划,都是渐近速率最优的编码块长度,并保证正确性。我们的概率设计是计算效率高,顺序最优的复杂性。我们的确定性设计保证零错误解码,虽然通过高计算复杂性的代码一般。我们的编码方案是基于"可扩展域”上的网络码。每个节点不是从每个节点的一个字段中选择编码系数,而是在“有效字段大小”上使用线性编码操作,该有效字段大小取决于节点与源节点的距离。对我们的方案进行分析需要可能具有独立利益的技术工具。特别是,我们推广的施瓦茨-齐佩尔引理证明一个非均匀的版本,其中变量是从可能不同的大小的集合中选择。我们还提供了一种新的强大的分布式算法分配唯一的ID到网络节点。

英文摘要:

Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented over finite fields whose size depends on some global network parameters (size of the network, the number of sinks) that may not be known prior to code design. Also, if new nodes join the entire network code may have to be redesigned. In this work, we present the first universal and robust distributed linear network coding schemes. Our schemes are universal since they are independent of all network parameters. They are robust since if nodes join or leave, the remaining nodes do not need to change their coding operations and the receivers can still decode. They are distributed since nodes need only have topological information about the part of the network upstream of them, which can be naturally streamed as part of the communication protocol. We present both probabilistic and deterministic schemes that are all asymptotically rate-optimal in the coding block-length, and have guarantees of correctness. Our probabilistic designs are computationally efficient, with order-optimal complexity. Our deterministic designs guarantee zero error decoding, albeit via codes with high computational complexity in general. Our coding schemes are based on network codes over ``scalable fields". Instead of choosing coding coefficients from one field at every node, each node uses linear coding operations over an ``effective field-size" that depends on the node's distance from the source node. The analysis of our schemes requires technical tools that may be of independent interest. In particular, we generalize the Schwartz-Zippel lemma by proving a non-uniform version, wherein variables are chosen from sets of possibly different sizes. We also provide a novel robust distributed algorithm to assign unique IDs to network nodes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑