Name
Abstract | ||
|---|---|---|
Structured peer to peer (P2P) overlay networks are becoming increasingly popular. Multi-hop systems achieve a successful lookup in O(log N) hops, whereas one-hop systems approach O(1) hops. Both approaches, but especially one-hop overlays suffer from a high number of identical messages being sent to a number of nodes on the overlay. Previous work showed that P2P networks benefit from the integration of the overlay network with the underlay network in which multi-destination multicast routing is available. This allows combining identical messages from the same source into joint multi-destination multicast messages to significantly reduce the number of messages. Our experimentation has centered around the one-hop EpiChord overlay. Here the problem is described using a Markov Model for more advanced analysis. The Markov Model is believed to be novel in two aspects: it is the first to investigate one-hop overlays and it is the first to study the performance of multi-destination multicast including the consideration of retransmissions of requests. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/ICC.2007.322 | Glasgow |
Keywords | Field | DocType |
Markov processes,multicast communication,peer-to-peer computing,telecommunication network routing,EpiChord peer-to-peer overlay,Markov model,P2P networks,XCAST enabled network,explicit multicast,multidestination multicast routing,multihop systems,one-hop EpiChord overlay,one-hop systems approach | Markov process,Peer-to-peer,Computer science,Markov model,Xcast,Computer network,Multicast,Unicast,Overlay,Overlay network,Distributed computing | Conference |
ISSN | ISBN | Citations |
1550-3607 | 1-4244-0353-7 | 5 |
PageRank | References | Authors |
0.49 | 13 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mario Kolberg | 1 | 503 | 43.73 |
| Florence Kolberg | 2 | 5 | 0.49 |
| Alan Brown | 3 | 5 | 0.49 |
| John Buford | 4 | 5 | 0.49 |