Using Tractable and Realistic Churn Models to Analyze Quiescence Behavior of Distributed Protocols

Large-scale distributed systems are subject to churn, i.e., continuous arrival, departure and failure of processes. Analysis of protocols under churn requires one to use churn models that are tractable (easy to apply), realistic (apply to deployment settings), and general (apply to many protocols and properties). In this paper, we propose two new churn models - called train and crowd - that together achieve these goals, for a broad class of stability properties called quiescent properties, and for arbitrary distributed protocols. We show (i) how analysis of protocol quiescence in the train model can be extended to the crowd model, (ii) how to apply the train and crowd model to several distributed membership protocols, (iii) how, even under real churn traces, the train and crowd models are reasonably good at predicting system-wide stability metrics for membership protocols.

[1]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

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

[3]  Margo I. Seltzer,et al.  Network Coordinates in the Wild , 2007, NSDI.

[4]  Dmitri Loguinov,et al.  On Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-Peer Networks , 2005, IEEE/ACM Transactions on Networking.

[5]  Mukund Seshadri,et al.  On Cooperative Content Distribution and the Price of Barter , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[6]  Imdea Networks.  Eventual Leader Election with Weak Assumptions on Initial Knowledge,Communication Reliability,and Synchrony , 2010 .

[7]  Daniel Stutzbach,et al.  Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems , 2005, IEEE/ACM Transactions on Networking.

[8]  Marcos K. Aguilera,et al.  On Quiescent Reliable Communication , 2000, SIAM J. Comput..

[9]  Jacky C. Chu,et al.  Availability and locality measurements of peer-to-peer file systems , 2002, SPIE ITCom.

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

[11]  Keith W. Ross,et al.  A Measurement Study of a Large-Scale P2P IPTV System , 2007, IEEE Transactions on Multimedia.

[12]  Roberto Baldoni,et al.  Connectivity in Eventually Quiescent Dynamic Distributed Systems , 2007, LADC.

[13]  Robbert van Renesse,et al.  A Gossip-Style Failure Detection Service , 2009 .

[14]  Maarten van Steen,et al.  CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays , 2005, Journal of Network and Systems Management.

[15]  David R. Karger,et al.  Analysis of the evolution of peer-to-peer systems , 2002, PODC '02.

[16]  Walter Willinger,et al.  On unbiased sampling for unstructured peer-to-peer networks , 2009, TNET.

[17]  Michel Raynal,et al.  Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony , 2006, International Conference on Dependable Systems and Networks (DSN'06).

[18]  Achour Mostéfaoui,et al.  From static distributed systems to dynamic systems , 2005, 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05).

[19]  Seif Haridi,et al.  A Statistical Theory of Chord Under Churn , 2005, IPTPS.

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

[21]  Vwani P. Roychowdhury,et al.  A General Framework for Scalability and Performance Analysis of DHT Routing Systems , 2006, International Conference on Dependable Systems and Networks (DSN'06).

[22]  Abhinandan Das,et al.  SWIM: scalable weakly-consistent infection-style process group membership protocol , 2002, Proceedings International Conference on Dependable Systems and Networks.

[23]  Dmitri Loguinov,et al.  On Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-Peer Networks , 2005, IEEE/ACM Transactions on Networking.

[24]  Krishna P. Gummadi,et al.  Measurement, modeling, and analysis of a peer-to-peer file-sharing workload , 2003, SOSP '03.

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