2008 · 24 citations · 16 references
ComputingComputer ScienceComputer NetworksDistributed SystemsInterconnection NetworksNetwork TopologyPeer-to-peer NetworksPeer-to-peer SystemsRoutingRouting AlgorithmsRouting ProtocolsHierarchical RoutingNetwork ScalabilityOverlay NetworksPeer-to-peer ArchitecturesRouting Performance AnalysisScalabilitySuper-peer ArchitecturesSuperpeer Architectures
The scalability properties of DHT based overlay networks is considered satisfactory. However, in large scale systems this might still cause a problem since they have a logarithmic complexity depending. Further, they only provide a one dimensional structure and do not make use on inherent clustering properties of some applications (e.g. P2PVoIP or locality aware overlays). Thus, structures based on a hierarchical approach can have performance as well as structural advantages. In this paper, a generic hierarchical architecture based on super-peers is presented where a peer ID is composed by a prefix ID and a suffix ID. Prefix ID is only routed at the super-peer level and the Suffix ID at the peer level. We specifically analyse the Routing Performance of this approach within the context of two specific overlays, viz. CAN and Kademlia.
16
A scalable content-addressable network
Sylvia Ratnasamy, Paul Francis, Mark Handley et al. · 2001 · 6.4K citations · Full text
A survey and comparison of peer-to-peer overlay network schemes
Eng Keong Lua, Jon Crowcroft, Marcelo Pias et al. · IEEE Communications Surveys & Tutorials · 2005 · 1.5K citations
Rodrigo Rodrigues, Peter Druschel · Communications of the ACM · 2010 · 562 citations
HIERARCHICAL PEER-TO-PEER SYSTEMS
Luis Garcés-Erice, Ernst W. Biersack, Keith W. Ross et al. · Parallel Processing Letters · 2003 · 218 citations