网络中的数据流传播
Data Flow Dissemination in a Network
AI总结:
本研究针对区块链和实时流媒体网络,分析随机有用与最旧有用两种数据包传播策略,证明随机有用在一般网络中稳定性最优,最旧有用在对称网络中达到最优,并研究延迟渐近行为。
摘要:
我们考虑以下网络模型,该模型特别受到区块链和对等实时流媒体的启发。数据包流到达网络节点,并需要传播到所有其他节点。数据包通过网络中具有有限容量的链路进行中继。当数据包传播到所有节点时,它离开网络。我们关注两种通信纪律,它们决定了每个链路上数据包的传输顺序,即“随机有用”(RU)和“最旧有用”(OU)。我们证明RU在一般网络中具有最大稳定性区域。对于OU,我们证明,令人惊讶的是,它通常不具有最大稳定性区域。我们证明OU在对称网络的重要特殊情况下确实实现了最大稳定性,该对称网络由所有链路上具有相等容量且所有节点具有相等到达率的完整图给出。我们还给出了其他稳定性结果,并通过模拟比较了对称系统中不同纪律的性能。最后,我们研究了数据包在对称系统中传播时经历的累积延迟,特别是当N趋向无穷大时的延迟渐近行为。我们提出了关于这种行为的若干猜想,并得到了启发式论证和模拟实验的支持。
英文摘要:
We consider the following network model motivated, in particular, by blockchains and peer-to-peer live streaming. Data packet flows arrive at the network nodes and need to be disseminated to all other nodes. Packets are relayed through the network via links of finite capacity. A packet leaves the network when it is disseminated to all nodes. Our focus is on two communication disciplines, which determine the order in which packets are transmitted over each link, namely {\em Random-Useful} (RU) and {\em Oldest-Useful} (OU). We show that RU has the maximum stability region in a general network. For the OU we demonstrate that, somewhat surprisingly, it does {\em not} in general have the maximum stability region. We prove that OU does achieve maximum stability in the important special case of a symmetric network, given by the full graph with equal capacities on all links and equal arrival rates at all nodes. We also give other stability results, and compare different disciplines' performances in a symmetric system via simulation. Finally, we study the cumulative delays experienced by a packet as it propagates through the symmetric system, specifically the delay asymptotic behavior as $N \to \infty$. We put forward some conjectures about this behavior, supported by heuristic arguments and simulation experiments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。