A Hybrid Redundancy Approach for Data Availability in Structured P2P Network Systems

For practical deployment of peer-to-peer (P2P) systems, it is one of the most important and challengeable aspects to achieve high data availability in structured P2P systems since the environment is much scalable and dynamic. The paper utilizes the hybrid of two data redundancy schemes, namely replication and erasure coding, to improve system availability. To mask or hide the high churn from the short-lived but churn-frequent peers and permanent failure peers, we use replication among the nodes in a certain interval of the identifier space that can be considered as a virtual node. Then with an erasure-coded redundancy scheme, we consider that a set of virtual nodes that cooperatively provide guaranteed over the networks. The paper presents the hybrid redundancy prototype and protocol. The evaluation shows that the approach is effective with an empirical trace by setting different system parameters.

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

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

[3]  David R. Karger,et al.  Building peer-to-peer systems with chord, a distributed lookup service , 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.

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

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

[6]  Geoffrey M. Voelker,et al.  On Object Maintenance in Peer-to-Peer Systems , 2006, IPTPS.

[7]  John Kubiatowicz,et al.  Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks , 2003, DISC.

[8]  Richard M. Karp,et al.  Load Balancing in Structured P2P Systems , 2003, IPTPS.

[9]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[10]  Seif Haridi,et al.  Symmetric Replication for Structured Peer-to-Peer Systems , 2005, DBISP2P.

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

[12]  Stefan Savage,et al.  Understanding Availability , 2003, IPTPS.

[13]  Alexandros G. Dimakis,et al.  Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[14]  Stefan Saroiu,et al.  Dynamically Fault-Tolerant Content Addressable Networks , 2002, IPTPS.

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

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

[17]  Rodrigo Rodrigues,et al.  High Availability in DHTs: Erasure Coding vs. Replication , 2005, IPTPS.

[18]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

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

[20]  Stefan Savage,et al.  Total Recall: System Support for Automated Availability Management , 2004, NSDI.