Enabling routing control in a DHT

Authors:
Yiming Zhang;Lei Chen;Xicheng Lu;Dongsheng Li
Affiliations:
National Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha, China;Department of Computer Science, Hong Kong University of Science and Technology, Kowloon, Hong Kong, China;National Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha, China;National Laboratory for Parallel and Distributed Processing, National University of Defense Technology, Changsha, China
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2010

Citing 15
Cited 2

Chord: a scalable peer-to-peer lookup protocol for internet applications

IEEE/ACM Transactions on Networking (TON)
Brocade: Landmark Routing on Overlay Networks

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining

ACM Transactions on Computer Systems (TOCS)
The impact of DHT routing geometry on resilience and proximity

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Canon in G Major: Designing DHTs with Hierarchical Structure

ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
A scalable distributed information management system

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Ordered Slicing of Very Large-Scale Overlay Networks

P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Democratizing content publication with coral

NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
SkipNet: a scalable overlay network with practical locality properties

USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Experience with an object reputation system for peer-to-peer filesharing

NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Distributed Line Graphs: A Universal Framework for Building DHTs Based on Arbitrary Constant-Degree Graphs

ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Providing administrative control and autonomy in structured peer-to-peer overlays

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Diminished chord: a protocol for heterogeneous subgroup formation in peer-to-peer networks

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Tapestry: a resilient global-scale overlay for service deployment

IEEE Journal on Selected Areas in Communications

Autonomic Management of Cloud Neighborhoods through Pulse Monitoring

UCC '12 Proceedings of the 2012 IEEE/ACM Fifth International Conference on Utility and Cloud Computing
Resource allocation with multi-factor node ranking in data center networks

Future Generation Computer Systems

Quantified Score

Hi-index	0.07

Visualization

Abstract

DHTs are scalable, self-organizing, and adaptive to underlying topology changes, thus being a promising infrastructure for realizing autonomic communications in distributed systems. To provide the above advantages, however, DHTs sacrifice flexibility, that is, all messages are routed by using a common algorithm in a DHT on the assumption that all participant nodes are homogeneous. In practice, 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 and enable flexible control of routing destinations and paths. To achieve this, in this paper we propose a novel approach that supports organizing nodes into groups and enables routing control in a DHT. The effectiveness of our proposals is demonstrated through theoretical analysis and extensive simulations.