DocumentCode :
1897808
Title :
Epidemic Broadcast Trees
Author :
Leitão, João ; Pereira, José ; Rodrigues, Luís
Author_Institution :
Univ. of Lisbon, Lisbon
fYear :
2007
fDate :
10-12 Oct. 2007
Firstpage :
301
Lastpage :
310
Abstract :
There is an inherent trade-off between epidemic and deterministic tree-based broadcast primitives. Tree-based approaches have a small message complexity in steady-state but are very fragile in the presence of faults. Gossip, or epidemic, protocols have a higher message complexity but also offer much higher resilience. This paper proposes an integrated broadcast scheme that combines both approaches. We use a low cost scheme to build and maintain broadcast trees embedded on a gossip-based overlay. The protocol sends the message payload preferably via tree branches but uses the remaining links of the gossip overlay for fast recovery and expedite tree healing. Experimental evaluation presented in the paper shows that our new strategy has a low overhead and that is able to support large number of faults while maintaining a high reliability.
Keywords :
broadcasting; communication complexity; protocols; trees (mathematics); deterministic tree-based broadcast primitives; epidemic broadcast trees; gossip protocol; gossip-based overlay; message complexity; tree branches; tree healing; Availability; Broadcasting; Costs; Large-scale systems; Maintenance; Multicast protocols; Payloads; Peer to peer computing; Resilience; Steady-state;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Reliable Distributed Systems, 2007. SRDS 2007. 26th IEEE International Symposium on
Conference_Location :
Beijing
ISSN :
1060-9857
Print_ISBN :
0-7695-2995-X
Type :
conf
DOI :
10.1109/SRDS.2007.27
Filename :
4365705
Link To Document :
بازگشت