Directional Gossip: Gossip in a Wide Area Network

Meng-Jang Lin and Keith Marzullo
CS1999-0622
June 16, 1999

We study the problem of reliable dissemination information in a wide area network. Traditional reliable broadcast protocols provide high reliability but do not scale well. Gossip-based protocols appear to be a viable approach. They have been developed to address scalability while still providing high reliability of message delivery. However, gossip protocols either ignore the topology of the wide-area network and thus incur a large load on some network elements or can suffer from a low reliability because they do not take the connectivity of the wide-area network into account. We present a new gossip protocol, called {\em directional gossip}, that uses flooding when necessary to attain good reliability and that uses gossip when flooding (and hence its inherent high overhead) is not needed. The determination of when to use flooding or gossip is done dynamically.


How to view this document


The authors of these documents have submitted their reports to this technical report series for the purpose of non-commercial dissemination of scientific work. The reports are copyrighted by the authors, and their existence in electronic format does not imply that the authors have relinquished any rights. You may copy a report for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect the author's copyright. For information concerning the use of this document for other than research or instructional purposes, contact the authors. Other information concerning this technical report series can be obtained from the Computer Science and Engineering Department at the University of California at San Diego, techreports@cs.ucsd.edu.


[ Search ]


NCSTRL
This server operates at UCSD Computer Science and Engineering.
Send email to webmaster@cs.ucsd.edu