2003 · 59 citations · 14 references
ComputingComputer ScienceComputer SystemsComputer NetworksDigital CommunicationDistributed SystemsDistributed AlgorithmsDistributed ComputingNetwork ProtocolsPeer-to-peer NetworkingPeer-to-peer NetworksPeer-to-peer SystemsBandwidthGossip AlgorithmsHeuristicsOverhead ReductionOverlay NetworksProximityRouting In Peer-to-peer NetworksStructured Peer-to-peer Networks
Structured peer-to-peer (p2p) overlay networks provide a useful substrate for building distributed applications. They assign object keys to overlay nodes and provide a primitive to route a message to the node responsible for a key. Proximity neighbor selection (PNS) can be used to achieve both low delay routes and low bandwidth usage but it introduces high overhead. This paper presents a detailed evaluation of PNS and heuristic approximations. We describe a new heuristic called constrained gossiping (PNS-CG) and show that it achieves performance similar to perfect PNS with low overhead. We also compare constrained gossiping with previous heuristics and show that it achieves better performance with lower overhead.
14
Ion Stoica, Robert Morris, David R. Karger et al. · 2001 · 9.7K citations
A scalable content-addressable network
Sylvia Ratnasamy, Paul Francis, Mark Handley et al. · 2001 · 6.4K citations · Full text
Ellen Zegura, Kenneth L. Calvert, S. Bhattacharjee · 2002 · 1.7K citations
Wide-area cooperative storage with CFS
Frank Dabek, M. Frans Kaashoek, David R. Karger et al. · 2001 · 1.4K citations