Name
Abstract | ||
|---|---|---|
Many peer-to-peer overlay operations are inherently parallel and this parallelism can be exploited by using multi-destination multicast routing, resulting in significant message reduction in the underlying network. We propose criteria for assessing when multicast routing can effectively be used, and compare multi-destination multicast and host group multicast using these criteria. We show that the assumptions underlying the Chuang-Sirbu multicast scaling law are valid in large-scale peer-to-peer overlays, and thus Chuang-Sirbu is suitable for estimating the message reduction when replacing unicast overlay messages with multicast messages. Using simulation, we evaluate message savings in two overlay algorithms when multi-destination multicast routing is used in place of unicast messages. We further describe parallelism in a range of overlay algorithms including multi-hop, variable-hop, load-balancing, random walk, and measurement overlay. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.comcom.2007.08.019 | Computer Communications |
Keywords | Field | DocType |
Peer-to-peer overlay,Multi-destination multicast routing,Distributed hash table | Source-specific multicast,Protocol Independent Multicast,Multicast address,Computer science,Xcast,Computer network,Pragmatic General Multicast,Multicast,Distance Vector Multicast Routing Protocol,IP multicast,Distributed computing | Journal |
Volume | Issue | ISSN |
31 | 3 | 0140-3664 |
Citations | PageRank | References |
7 | 0.72 | 27 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Buford | 1 | 85 | 13.30 |
| Alan Brown | 2 | 25 | 2.31 |
| Mario Kolberg | 3 | 503 | 43.73 |