Rate region for a class of delay mitigating codes and P2P networks
Rate region for a class of delay mitigating codes and P2P networks
复制标题
一类延迟缓解代码和 P2P 网络的速率区域
DOI：
--
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
J. Walsh
中科院分区：
文献类型：
--
作者：
S. Weber;Congduan Li;J. Walsh
本文证明了由Yeung和Zhang在1999年首次提出的分布式信源编码问题与网络设计中的两个应用：i)延迟减轻码的设计，ii)网络编码P2P网络的设计。当使用编码分组的集合通过多路径网络将时间敏感帧从源传输到目的地时，解码要求确定哪些分组子集将足以解码哪些帧。与这些要求一致的分组大小的速率区域被示为前述分布式信源编码问题的一个实例。在对等系统中将文件块编码成分组时，对等点希望在以尽可能低的速率上载数据的同时尽快接收它们的块。结果表明，与译码约束一致的编码分组大小区域是上述分布式信源编码问题的另一个实例。在设计延迟缓解代码和高效P2P系统时，这些速率区域被置于速率-延迟权衡的更大上下文中。
This paper identifies the relevance of a distributed source coding problem first formulated by Yeung and Zhang in 1999 to two applications in network design: i) the design of delay mitigating codes, and ii) the design of network coded P2P networks. When transmitting time-sensitive frames from a source to a destination over a multipath network using a collection of coded packets, the decoding requirements determine which subsets of packets will be sufficient for decoding which frames. The rate region of packet sizes consistent with these requirements is shown to be an instance of the aforementioned distributed source coding problem. When encoding file chunks into packets in a peer to peer system, the peers wish to receive their chunks as soon as possible while uploading data at as low a rate as possible. It is shown that the region of encoded packet sizes consistent with the decoding constraints is another instance of the aforementioned distributed source coding problem. These rate regions are placed in the larger context of rate-delay tradeoffs in designing delay mitigating codes and efficient P2P systems.