Name
Abstract | ||
|---|---|---|
One-hop overlays offer significant latency reduction compared to multi-hop overlays, but at a cost of increased maintenance traffic and routing table size. Recently the EDRA maintenance algorithm has been proposed and shown analytically to give low maintenance traffic compared to other active maintenance one-hop overlays. We identify issues with EDRA which lead to incorrect event detection and propagation. We define EDRA* fixing these issues and show through simulation EDRA* is stable, and compare the performance of EDRA* with the opportunistic maintenance mechanism of EpiChord. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/GLOCOM.2007.23 | Washington, DC |
Keywords | Field | DocType |
peer-to-peer computing,telecommunication network routing,telecommunication traffic,EDRA active maintenance algorithm,latency reduction,one-hop overlay,peer-to-peer network,routing table,traffic maintenance | Computer science,Latency (engineering),Peer to peer computing,Computer network,Algorithm,Real-time computing,Hop (networking),Routing table,Overlay,Distributed computing | Conference |
ISSN | ISBN | Citations |
1930-529X | 978-1-4244-1043-9 | 6 |
PageRank | References | Authors |
0.47 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Buford | 1 | 33 | 4.95 |
| Alan Brown | 2 | 6 | 0.47 |
| Mario Kolberg | 3 | 503 | 43.73 |