BGP-based clustering for scalable and reliable gossip broadcast

Authors:
M. Brahami;P. Th. Eugster;R. Guerraoui;S. B. Handurukande
Affiliations:
Distributed Programming Laboratory, Swiss Federal Institute of Technology in Lausanne (EPFL);Sun Microsystems, Switzerland;Distributed Programming Laboratory, Swiss Federal Institute of Technology in Lausanne (EPFL);Distributed Programming Laboratory, Swiss Federal Institute of Technology in Lausanne (EPFL)
Venue:
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Year:
2004

Citing 14
Cited 0

Multicast routing in internetworks and extended LANs

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
MBONE: the multicast backbone

Communications of the ACM
Fault-tolerant broadcasts and related problems

Distributed systems (2nd Ed.)
Bimodal multicast

ACM Transactions on Computer Systems (TOCS)
IDMaps: a global internet host distance estimation service

IEEE/ACM Transactions on Networking (TON)
Directional Gossip: Gossip in a Wide Area Network

EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
Lightweight Probabilistic Broadcast

DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Probabilistic Multicast

DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining

ACM Transactions on Computer Systems (TOCS)
Efficient Epidemic-Style Protocols for Reliable and Scalable Multicast

SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
FEC-Based Video Streaming over Packet Loss Networks with Pre-Interleaving

ITCC '01 Proceedings of the International Conference on Information Technology: Coding and Computing
SplitStream: high-bandwidth multicast in cooperative environments

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Scattercast: an adaptable broadcast distribution framework

Multimedia Systems
A case for end system multicast

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.