Minimizing churn in distributed systems

Computer Communication Review

Volumn 36, Issue 4, 2006, Pages 147-158

  Godfrey, P Brighten ^a   Shenker, Scott ^a   Stoica, Ion ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Churn; DHT; Multicast; Node selection

Indexed keywords

CHURN; NODE SELECTION; REALISTIC NODE FAILURE PATTERNS; STOCHASTIC MODELS; UNIFORM RANDOM REPLACEMENT;

COMPUTATIONAL METHODS; COMPUTER AIDED DESIGN; MATHEMATICAL MODELS; MULTICASTING; OPTIMIZATION; QUALITY OF SERVICE;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33750291183     PISSN: 01464833     EISSN: 01464833     Source Type: Conference Proceeding    
DOI: 10.1145/1151659.1159931     Document Type: Conference Paper

References (39)

1. B. C. Arnold. Majorizarion and the Lorenz order: A Brief Introduction, volume 43. Lecture Notes in Statistics, Springer-Verlag, 1987.
2. M. Bakkaloglu, J. J. Wylie, C. Wang, and G. R. Ganger. On correlated failures in survivable storage systems. Technical Report CMU-CS-02-129, Carnegie Mellon University, May 2002.
3. H. Ballani and P. Francis. Towards a global IP anycast service. In Proc. ACM SIGCOMM, 2005.
4. A. Bavier, M. Bowman, B. Chun, D. Culler, S. Karlin, S. Muir, L. Peterson, T. Roscoe, T. Spalink, and M. Wawrzoniak. Operating system support for planetary-scale network services. In Proc. NSDI, 2004.
5. R. Bhagwan, K. Tati, Y.-C. Cheng, S. Savage, and G. M. Voelker. Total recall: System support for automated availability management. In NSDI, 2004.
6. C. Blake and R. Rodrigues. High availability, scalable storage, dynamic peer neetworks: Pick two. In Proc. HOTOS, May 2003.
7. W. J. Bolosky, J. R. Douceur, D. Ely, and M. Theimer. Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In Proc. SIGMETRICS, 2000.
8. F. Dabek, F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proc. ACM SOSP, 2001.
9. A. Dan and D. Towsley. An approximate analysis of the LRU and FIFO buffer replacement schemes. In Proc. ACM SIGMETRICS, pages 143-152, 1990.
10. P. Flajolet, D. Gardy, and L. Thimonier. Birthday paradox, coupon collectors, caching algorithms and self-organizing search. In Discrete Applied Mathematics, pages 207-229, 1992.
11. P. A. Franaszek and T. J. Wagner. Some distribution-free aspects of paging algorithm performance. In Journal of the ACM, pages 31-39, Jan. 1974.
12. M. J. Freedman, K. Lakshminarayanan, and D. Mazieres. Oasis: Anycast for any service. In NSDI, 2006.
13. L. Garces-Erice, E. W. Biersack, K. W. Ross, P. A. Felber, and G. Urvoy-Keller. Hierarchical P2P systems. In Proc. ACM/IFIP International Conference on Parallel and Distributed Computing (Euro-Par), 2003.
14. P. B. Godfrey, S. Shenker, and I. Stoica. Minimizing churn in distributed systems. Technical Report EECS-2006-25, EECS Department, University of California, Berkeley, 2006.
15. S. Guha, N. Daswani, and R. Jain. An experimental study of the Skype peer-to-peer VoIP system. In IPTPS. 2006.
16. K. Gummadi, R. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica. The Impact of DHT Routing Geometry on Resilience and Proximity. In Proc. ACM SIGCOMM, 2003.
17. M. F. Kaashoek and D. R. Karger. Koorde: A simple degree-optimal distributed hash table. In Proc. IPTPS, 2003.
18. J. Ledlie, J. Shneidman, M. Amis, M. Mitzenmacher, and M. Seltzer. Reliability- and capacity-based selection in distributed hash tables. Technical report, Harvard University Computer Science, Sept. 2003.
19. D. Leonard, V. Rai, and D. Loguinov. On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks. In SIGMETRICS, 2005.
20. J. Li, J. Stribling, R. Morris, and M. F. Kaashoek. Bandwidth-efficient management of DHT routing tables. In Proc. NSDI, 2005.
21. J. Li, J. Stribling, R. Morris, M. F. Kaashoek, and T. M. Gil. A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In Proc. INFOCOM, 2005.
22. G. S. Manku, M. Bawa, and P. Raghavan. Symphony: distributed hashing in a small world. In USENIX Symposium on Internet Technologies and Systems, 2003.
23. G. S. Manku, M. Naor, and U. Wieder. Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. In STOC, 2004.
24. J. Mickens and B. Noble. Predicting node availability in peer-to-peer networks. In ACM SIGMETRICS poster, 2005.
25. M. Naor and U. Wieder. Novel architectures for P2P applications: the continuous-discrete approach. In Proc. SPAA, 2003.
26. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Proc. ACM SIGCOMM, 2001.
27. S. Rhea, B.-G. Chun, J. Kubiatowicz, and S. Shenker. Fixing the embarrassing slowness of OpenDHT on PlanetLab. In Proc. WORLDS, 2005.
28. S. Rhea, P. Eaton, D. Geels, H. Weatherspoon, B. Zhao, and J. Kubiatowicz. Pond: the OceanStore prototype. In Proc. USENIX File and Storage Technologies (FAST), 2003.
29. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling churn in a DHT. In Proc. USENIX Annual Technical Conference, June 2004.
30. A. Rowstron and P. Druschel. Storage management and caching in apst, a large-scale, persistent peer-to-peer storage utility. In SOSP, 2001.
31. S. Saroiu, P. K. Gummadi, and S. D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. In Proc. MMCN, 2002.
32. K. Sripanidkulchai, A. Ganjam, B. Maggs, and H. Zhang. The feasibility of supporting large-scale live streaming applications with dynamic application end-points. In Proc. ACM SIGCOMM, 2004.
33. I. Stoica, D. Adkins, S. Zhuang, S. Shenker, and S. Surana. Internet indirection infrastructure. In Proc. SIGCOMM, 2002.
34. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. SIGCOMM, 2001.
35. J. Stribling. Planetlab all pairs ping. http://infospect.planet-lab.org/ pings.
36. K. Tati and G. M. Voelker. On object maintenance in peer-to-peer systems. In Proc. IPTPS, 2006.
37. H. Weatherspoon, B.-G. Chun, C. W. So, and J. Kubiatowicz. Long-Term Data Maintenance: A Quantitative Approach. Technical Report UCB/CSD-05-1404, EECS Department, University of California, Berkeley, July 2005.
38. B. Wong, A. Slivkins, and E. G. Sirer. Meridian: A lightweight network location service without virtual coordinates. In Proc. ACM SIGCOMM, 2005.
39. B. Zhang, T. S. Ng, A. Nandi, R. Riedi, P. Druschel, and G. Wang. Measurement-based analysis, modeling, and synthesis of the Internet delay space, 2006. http://www.cs.rice.edu/bozhang/synthesizer.html.