Routing performance in a hierarchical DHT-based overlay network

Martinez-Yelmo, Isaias and Cuevas, Ruben and Guerrero, Carmen and Mauthe, Andreas (2008) Routing performance in a hierarchical DHT-based overlay network. In: PDP '08: Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008). IEEE Computer Society, Washington, DC, USA, pp. 508-515. ISBN 9780769530895

Full text not available from this repository.


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.

Item Type:
Contribution in Book/Report/Proceedings
Uncontrolled Keywords:
ID Code:
Deposited By:
Deposited On:
20 Aug 2012 09:24
Last Modified:
21 Nov 2022 14:47