Combining Resource and Location Awareness in DHTs

Distributed hash tables are designed to provide reliable distributed data management, but present challenges for networks in which nodes have varying characteristics such as battery or computing power. Assuming that nodes are aware of their resource availability and relative network positions, this paper presents a novel distributed hash table protocol which uses nodes' resource levels to remove load from weak nodes, whose overuse may cause delays or failure, while using nodes' positions to reduce cross-network traffic, which may cause unwanted network load and delays. This protocol provides nodes with links that are physically near with high resource availability, and simultaneously provides scalability and an O(log(N)) routing complexity with N network nodes. Theoretical analysis and simulated evaluation show significant decreases in the routing and maintenance overhead for weak nodes, the physical distances that lookups traverse, and unwanted node failures, as well as an increase node lifetime.

[1]  Srinivasan Seshan,et al.  Mercury: supporting scalable multi-attribute range queries , 2004, SIGCOMM 2004.

[2]  Fabián E. Bustamante,et al.  Friendships that Last: Peer Lifespan and its Role in P2P Protocols , 2003, WCW.

[3]  Marcel Waldvogel,et al.  Efficient topology-aware overlay network , 2003, CCRV.

[4]  Wolfgang Kellerer,et al.  Cost-Based Analysis of Hierarchical DHT Design , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[5]  Peter Druschel,et al.  Peer-to-peer systems , 2010, Commun. ACM.

[6]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[7]  Guillaume Urvoy-Keller,et al.  Hierarchical Peer-To-Peer Systems , 2003, Parallel Process. Lett..

[8]  Krishna P. Gummadi,et al.  Canon in G major: designing DHTs with hierarchical structure , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[9]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[10]  Ingmar Baumgart,et al.  OverSim: A scalable and flexible overlay framework for simulation and real network applications , 2009, 2009 IEEE Ninth International Conference on Peer-to-Peer Computing.

[11]  Srinivasan Seshan,et al.  Mercury: supporting scalable multi-attribute range queries , 2004, SIGCOMM '04.

[12]  Esther Pacitti,et al.  Flower-CDN: a hybrid P2P overlay for efficient query processing in CDN , 2009, EDBT '09.

[13]  Brian D. Davison,et al.  Web Content Caching and Distribution , 2004, Springer Netherlands.

[14]  Song Jiang,et al.  SAT-Match: a self-adaptive topology matching method to achieve low lookup latency in structured P2P overlay networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[15]  Erik Hagersten,et al.  THROOM — Supporting POSIX Multithreaded Binaries on a Cluster , 2003 .

[16]  Robert Tappan Morris,et al.  Designing a DHT for Low Latency and High Throughput , 2004, NSDI.

[17]  Brighten Godfrey,et al.  Heterogeneity and load balance in distributed hash tables , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[18]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[19]  Anne-Marie Kermarrec,et al.  Build One, Get One Free: Leveraging the Coexistence of Multiple P2P Overlay Networks , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[20]  Antonio F. Gómez-Skarmeta,et al.  Cyclone: a novel design schema for hierarchical DHTs , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[21]  Antonio F. Gómez-Skarmeta,et al.  A Comparative Study of Hierarchical DHT Systems , 2007, 32nd IEEE Conference on Local Computer Networks (LCN 2007).

[22]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[23]  Krishna P. Gummadi,et al.  The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.

[24]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[25]  Mohamed Ould-Khaoua,et al.  Improving Probabilistic Route Discovery in Mobile Ad Hoc Networks , 2007 .

[26]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[27]  Hector Garcia-Molina,et al.  Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems , 2004, VLDB.

[28]  David R. Karger,et al.  Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems , 2004, SPAA '04.

[29]  David R. Karger,et al.  Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.

[30]  Zhiyong Xu,et al.  HIERAS: a DHT based hierarchical P2P routing algorithm , 2003, 2003 International Conference on Parallel Processing, 2003. Proceedings..