2007/02/27 by Matei Ripeanu, Ripeanu, Matei, Adriana Iamnitchi +5
Computer Science · #Caching and Content Delivery #Distributed #Distributed and Parallel Computing Systems #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Parallel #Peer-to-Peer Network Technologies #Performance (cs.PF) #and Cluster Computing (cs.DC) #cs.DC #cs.NI #cs.PF
paper · pdf · doi:10.48550/arxiv.cs/0702157
arxiv created 2007/02/27 · openalex publication_date 2007/02/27 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Multicast communication primitives have broad utility as building blocks for distributed applications. The challenge is to create and maintain the distributed structures that support these primitives while accounting for volatile end nodes and variable network characteristics. Most solutions proposed to date rely on complex algorithms or global information, thus limiting the scale of deployments and acceptance outside the academic realm. This article introduces a low-complexity, self organizing solution for maintaining multicast trees, that we refer to as UMM (Unstructured Multi-source Multicast). UMM uses traditional distributed systems techniques: layering, soft-state, and passive data collection to adapt to the dynamics of the physical network and maintain data dissemination trees. The result is a simple, adaptive system with lower overheads than more complex alternatives. We have implemented UMM and evaluated it on a 100-node PlanetLab testbed and on up to 1024-node emulated ModelNet networks Extensive experimental evaluations demonstrate UMM's low overhead, efficient network usage compared to alternative solutions, and ability to quickly adapt to network changes and to recover from failures.