论文标题
及时用文件切片和网络编码闲聊
Timely Gossiping with File Slicing and Network Coding
论文作者
论文摘要
我们考虑一个由$ n $用户和文件库组成的系统，其中基于八卦机制建立了用户之间的通信。每个文件最初都以一个节点恰好存在，该节点被指定为文件\ emph {source}。根据任意分发的实时，该源将使用文件的较新版本进行更新，网络中的其他用户希望获取该文件的最新版本。我们提供一类八卦协议，这些协议在单文件系统中的典型节点上实现$ o（1）$ age，而在$ n $ file系统中给定文件的典型节点$ o（n）$ age。我们表明，基于文件切片和基于网络编码的协议属于提出的协议类别。提出了数值评估结果以确认上述界限。
We consider a system consisting of a large network of $n$ users and a library of files, wherein inter-user communication is established based upon gossip mechanisms. Each file is initially present at exactly one node, which is designated as the file \emph{source}. The source gets updated with newer versions of the file according to an arbitrary distribution in real time, and the other users in the network wish to acquire the latest possible version of the file. We present a class of gossip protocols that achieve $O(1)$ age at a typical node in a single-file system and $O(n)$ age at a typical node for a given file in an $n$-file system. We show that file slicing and network coding based protocols fall under the presented class of protocols. Numerical evaluation results are presented to confirm the aforementioned bounds.
