2008 Eighth International Conference on Peer-to-Peer Computing Flexible Routing in Grouped DHTs September 08-September 11 ISBN: 978-0-7695-3318-6
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/P2P.2008.43
In most DHTs proposed so far, all nodes areassumed 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.
Index Terms:
Flexible Routing, Grouped DHTs, GTap
Citation:
Yiming Zhang, Dongsheng Li, Lei Chen, Xicheng Lu, "Flexible Routing in Grouped DHTs," p2p, pp.109-118, 2008 Eighth International Conference on Peer-to-Peer Computing, 2008 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||