Model and Evaluation of Redundant Data Organization for High Availability in Structured Overlay Networks

The paper presents a hierarchical organization of two storage redundancy schemes to improve data availability caused by churn in structured overlay networks. To mask or hide the high churn from the portion of short-lived but frequent churn peers and permanent failure peers, we use replication among the nodes in a certain interval that can be considered as a virtual node. Then a set of virtual nodes that cooperatively provide guaranteed over the networks with erasure coding. We present the analysis of the behaviors of single one virtual node and cluster of virtual nodes. According to the stochastic models of the behaviors, the data availability under churn is presented. We also give some quantitative analysis based on one empirical trace dataset.

[1]  Krishna P. Gummadi,et al.  A measurement study of Napster and Gnutella as examples of peer-to-peer file sharing systems , 2002, CCRV.

[2]  Gang Wang,et al.  A Hybrid Redundancy Approach for Data Availability in Structured P2P Network Systems , 2007 .

[3]  Scott Shenker,et al.  Minimizing churn in distributed systems , 2006, SIGCOMM.

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

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

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

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

[8]  D. M. Chiu,et al.  Erasure code replication revisited , 2004, Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings..

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

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

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

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

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

[14]  Yoon-Hwa Choi,et al.  A Fault-Tolerant Bloom Filter for Deep Packet Inspection , 2007 .

[15]  Douglas M. Blough,et al.  The Effect of Replica Placement on Routing Robustness in Distributed Hash Tables , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[16]  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.

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

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

[19]  Sheldon M. Ross.  Introduction to Probability Models. , 1995 .

[20]  David R. Karger,et al.  Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems , 2004, IPTPS.

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

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

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

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

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