Flexible Routing in Grouped DHTs

In most DHTs proposed so far, all nodes are assumed to be homogeneous, and all messages are routed using a common algorithm. In practice, however, nodes in large-scale systems might be heterogeneous with respect to their capabilities, reputations, affiliations of administrative domains, and so on, which consequently makes it preferable to distinguish the heterogeneity of participant nodes. To achieve this, in this paper we present Grouped Tapestry (GTap), a novel Tapestry-based DHT that supports organizing nodes into groups and allows flexible DHT routing. The effectiveness of our proposals is demonstrated through theoretical analysis and extensive simulations.

• Type: Conference
• Year: 2008
• Where: P2P
• Authors: Yiming Zhang, Dongsheng Li, Lei Chen 0002, Xicheng Lu
• Keywords: Common Algorithm, Large-scale Systems, P2P 2008, Participant Nodes, Peer-to-Peer Computing