Routing Performance in a Hierarchical DHT-based Overlay Network

  • Authors:
  • Isaias Martinez-Yelmo;Ruben Cuevas;Carmen Guerrero;Andreas Mauthe

  • Affiliations:
  • -;-;-;-

  • Venue:
  • PDP '08 Proceedings of the 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008)
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 alogarithmic complexity depending. Further, they only provide a one dimensional structure and do not make use on inherent clustering properties of some applications (e.g. P2P VoIP 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 SuffixID. 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,v iz. CAN and Kademlia.