Home > Research > Publications & Outputs > Routing performance in a hierarchical DHT-based...
View graph of relations

Routing performance in a hierarchical DHT-based overlay network

Research output: Contribution in Book/Report/ProceedingsPaper


Publication date2008
Host publicationPDP '08: Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)
Place of PublicationWashington, DC, USA
PublisherIEEE Computer Society
Number of pages8
ISBN (Print)9780769530895
<mark>Original language</mark>English


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.