Sciweavers

Share
PDP
2008
IEEE

Routing Performance in a Hierarchical DHT-based Overlay Network

8 years 8 months ago
Routing Performance in a Hierarchical DHT-based Overlay Network
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.
Isaías Martinez-Yelmo, Rubén Cuevas
Added 01 Jun 2010
Updated 01 Jun 2010
Type Conference
Year 2008
Where PDP
Authors Isaías Martinez-Yelmo, Rubén Cuevas Rumín, Carmen Guerrero, Andreas Mauthe
Comments (0)
books