Efficient epidemic-style protocols for reliable and scalable multicast
Efficient epidemic-style protocols for reliable and scalable multicast
复制标题
高效的流行式协议，实现可靠且可扩展的组播
DOI：
10.1109/reldis.2002.1180187
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
A. Ganesh
中科院分区：
文献类型：
--
作者：
Indranil Gupta;Anne;A. Ganesh
传染病式(基于八卦)技术最近作为一类可扩展的协议出现，用于在大型进程组中进行对等可靠的多播传播。这些协议在可靠性和可扩展性方面提供了概率保证。然而，流行式传播的流行实现被认为存在两个主要缺陷：(A)(网络开销)当在广域网或VPN范围内部署时，它们生成大量跨越多个网域(例如，局域网、子网、AS)的边界传输的分组，导致诸如网桥、路由器和相关链路的核心网络元件上的过载；(B)(缺乏适应性)即使在降低的故障率(即，分组丢失、进程故障)的情况下，它们也对进程组成员和网络施加相同的负载。在这篇文章中，我们报道了(第一个)针对这些问题的解决方案。该解决方案由两个协议组成：(1)分层八卦协议，和(2)允许使用其中的任何八卦原语的自适应多播传播框架。这些协议在称为Leaf Box层次结构的虚拟对等层次结构中工作。可以以拓扑感知的方式将进程分配给该结构的叶盒，从而(1)和(2)在网络中产生跨域边界的低通信量。出于对空间的考虑，本文仅对分层八卦协议进行了详细的讨论和评估(通过仿真)。我们给出了自适应传播协议及其性质的概述。
Epidemic-style (gossip-based) techniques have recently emerged as a scalable class of protocols for peer-to-peer reliable multicast dissemination in large process groups. These protocols provide probabilistic guarantees on reliability and scalability. However, popular implementations of epidemic-style dissemination are reputed to suffer from two major drawbacks: (a) (Network Overhead) when deployed on a WAN-wide or VPN-wide scale they generate a large number of packets that transit across the boundaries of multiple network domains (e.g., LANs, subnets, ASs), causing an overload on core network elements such as bridges, routers, and associated links; (b) (Lack of Adaptivity) they impose the same load on process group members and the network even under reduced failure rates (viz., packet losses, process failures). lit this paper we report on the (first) comprehensive set of solutions to these problems. The solution is comprised of two protocols: (1) a hierarchical gossiping protocol, and (2) an adaptive multicast dissemination framework that allows use of any gossiping primitive within it. These protocols work within a virtual peer-to-peer hierarchy called the Leaf Box hierarchy. Processes can be allocated in a topologically aware manner to the leaf boxes of this structure, so that (1) and (2) produce low traffic across domain boundaries in the network. In the interests of space, this paper focuses on a detailed discussion and evaluation (through simulations) of only the hierarchical gossiping protocol. We present an overview of the adaptive dissemination protocol and its properties.