Design of a Hierarchical Based DHT Overlay P2P Routing Algorithm

Peer-to-Peer (P2P) applications running over a distributed hash table (DHT) based overlay do not benefit from dominant characteristics of nodes in the network (such as resources and speed). This paper presents a model for applications to set the predominant features of a node and also a way through which it can prioritize those features on several hierarchical layers. Our architecture is based on several hierarchical modules identified by an ID, each one being modeled through a set of rules defined by the application at the upper layer. We provide extensions to the original Chord protocol for scaling under a requested number of interconnected hierarchical modules. The simulation results and theoretical analyses for our model architecture indicate increased performance for scaling and overall routing costs.