Efficient Data Management using the Session Log in DHT and its Evaluation

Distributed Hash Table (DHT) is a specialized distributed system that aims to lookup hashed identifiers efficiently in order to route messages to and from the corresponding nodes and objects. However DHTs are mechanisms sensitive to churn (the continuous and interleaved process of arrival / departure of nodes). As a result, they often cause loss of stored objects and failures in the lookup, a serious issue for all overlay networks. In this paper, we propose a dynamic replica location method using the session log in DHT. Our method can determine dynamically the effective number of replicas on session running periods among anticipate nodes. We also implemented a prototype based on an existing DHT routing algorithm, and we evaluated the performance of the prototype. Our proposed method was shown to reduce data loss and the cost for locating replication.

[1]  Antony I. T. Rowstron,et al.  Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001, SOSP.

[2]  Kazuyuki Shudo,et al.  Overlay Weaver: An overlay construction toolkit , 2008, Computer Communications.

[3]  Taoufik En-Najjary,et al.  A global view of kad , 2007, IMC '07.

[4]  Brighten Godfrey,et al.  Minimizing churn in distributed systems , 2006, SIGCOMM.

[5]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[6]  Werner Vogels,et al.  Dynamo: amazon's highly available key-value store , 2007, SOSP.

[7]  Brighten Godfrey,et al.  OpenDHT: a public DHT service and its uses , 2005, SIGCOMM '05.

[8]  Ben Y. Zhao,et al.  Towards a Common API for Structured Peer-to-Peer Overlays , 2003, IPTPS.

[9]  Daniel Stutzbach,et al.  Understanding churn in peer-to-peer networks , 2006, IMC '06.

[10]  Thomas E. Anderson,et al.  Profiling a million user dht , 2007, IMC '07.

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

[12]  Mahadev Satyanarayanan,et al.  Proceedings of the eighteenth ACM symposium on Operating systems principles , 2001, SOSP 2001.

[13]  Salma Ktari,et al.  Performance evaluation of replication strategies in DHTs under churn , 2007, MUM.

[14]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

[15]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

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

[17]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.