arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.1801cs.ITcs.DCcs.DSmath.IT
收藏

具有相关数据的网络编码流言

Network Coded Gossip with Correlated Data

Bernhard Haeupler, Asaf Cohen, Chen Avin, Muriel Médard

摘要:

我们设计并分析了具有相关数据的网络的八卦算法。在这些网络中,要分发的数据、节点上已经可用的数据或两者都是相关的。该模型适用于各种现代网络,如传感器网络、对等网络和内容分发网络。虽然相关数据的编码方案已被广泛研究,但重点一直是表征静态无记忆网络中的速率区域。然而,在基于流言的方案中,节点通过根据一些底层通信模型连续地交换分组来在彼此之间通信。此设置的主要优点是停止时间--节点成功解码所需的时间。虽然Gossip方案是实用的,分布式的和可扩展的,但它们只针对不相关的数据进行了研究。我们希望通过提供技术来分析具有相关数据的(动态)网络中的网络编码八卦来缩小这一差距。我们给出了一个干净的框架不经意的网络模型,适用于众多的网络和通信场景,指定一个通用的设置为分布式相关数据,并给出严格的界限在这个广泛的情况下的网络编码协议的停止时间。

英文摘要:

We design and analyze gossip algorithms for networks with correlated data. In these networks, either the data to be distributed, the data already available at the nodes, or both, are correlated. This model is applicable for a variety of modern networks, such as sensor, peer-to-peer and content distribution networks. Although coding schemes for correlated data have been studied extensively, the focus has been on characterizing the rate region in static memory-free networks. In a gossip-based scheme, however, nodes communicate among each other by continuously exchanging packets according to some underlying communication model. The main figure of merit in this setting is the stopping time -- the time required until nodes can successfully decode. While Gossip schemes are practical, distributed and scalable, they have only been studied for uncorrelated data. We wish to close this gap by providing techniques to analyze network coded gossip in (dynamic) networks with correlated data. We give a clean framework for oblivious network models that applies to a multitude of network and communication scenarios, specify a general setting for distributed correlated data, and give tight bounds on the stopping times of network coded protocols in this wide range of scenarios.

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

↑