BGP-Based Clustering for Scalable and Reliable Gossip Broadcast

This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only have “local knowledge” about each other. They organize themselves dynamically (right from the bootstrapping phase), according to join, leave or crash events, to form a locality-based dissemination graph. Broadcast messages can be disseminated using these graphs in large networks like the Internet, without relying on any special infrastructure or intermediate brokers. Roughly speaking, a dissemination graph consists of “non-crossing” (independent) trees that provide multiple paths between processes for improved broadcast efficiency and reliability. Each tree is constructed using BGP routing information about process “locality”. We convey the feasibility of the algorithm using both simulation and experimental results and describe an application of our algorithm for broadcasting information streams.

• Type: Conference
• Year: 2004
• Where: GC
• Authors: M. Brahami, Patrick Th. Eugster, Rachid Guerraoui, Sidath B. Handurukande
• Keywords: Applied Computing, Dissemination Graph, Dissemination Graph Algorithm, GC 2004, Locality-based Dissemination Graph