Failure-Tolerant Overlay Trees for Large-Scale Dynamic Networks

Davide Frey, Amy L. Murphy
2008 2008 Eighth International Conference on Peer-to-Peer Computing  
The availability of high-bandwidth network connectivity and powerful, low-cost computing nodes at the network edge has fostered increasing interest in new models of distributed computation operating in an environment in which neither the computing components nor the communication infrastructure are stable. Nevertheless, developers are challenged to produce efficient and reliable applications. To overcome the difficulties, one common approach introduces a mesh overlay network connecting nodes
more » ... h multiple redundant paths. The drawback is the inefficiency of mesh networks for data distribution, as all packets must traverse all the links in the mesh. This observation spurred research on treebuilding mechanisms. However, the resulting systems either are not resilient to the dynamics of large-scale networks or incur the additional overhead of building trees as subsets of meshes. In this paper, we show that a tree overlay can instead be achieved directly in dynamic environments, achieving efficient, reliable communication with low maintenance overhead. A variety of middleware, e.g., publish/subscribe, can immediately exploit our tree maintenance protocol.
doi:10.1109/p2p.2008.30 dblp:conf/p2p/FreyM08 fatcat:uijsf7kpebespfx5dluzhwonqq