Epidemic broadcast trees
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...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | conferencePaper |
| Language: | eng |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1822/38894 |
| Country: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/38894 |
| Summary: | 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. |
|---|