Resilience of structured P2P systems under churn: The reachable component method

Computer Communications

Volumn 31, Issue 10, 2008, Pages 2109-2123

  Kong, Joseph S ^a   Bridgewater, Jesse S A ^a   Roychowdhury, Vwani P ^a  

^a University of California   (United States)

Author keywords

Distributed hash table; Node lifetime; Peer to peer networks; Reachable component method; Renewal theory

Indexed keywords

COMPUTER SIMULATION; COMPUTER SYSTEM RECOVERY; GRAPH THEORY; MATHEMATICAL MODELS; ROUTING ALGORITHMS;

DISTRIBUTED HASH TABLE; NODE LIFETIME; PEER-TO-PEER NETWORKS; REACHABLE COMPONENT METHOD; RENEWAL THEORY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 44549083975     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2008.01.051     Document Type: Article

References (32)

1. Gummadi K., Gummadi R., Gribble S., Ratnasamy S., Shenker S., and Stoica I. The impact of dht routing geometry on resilience and proximity. Proceedings of SIGCOMM'03 (2003), ACM Press, New York 381-394
2. G.S. Manku, M. Bawa, P. Raghavan, Symphony: distributed hashing in a small world, in: Proceedings of Fourth USENIX Symposium on Internet Technologies and Systems, 2003, pp. 127-140.
3. Maymounkov P., and Mazières D. Kademlia: a peer-to-peer information system based on the xor metric. Proceedings of IPTPS'01 (2002), Springer-Verlag, London, UK 53-65
4. Stoica I., Morris R., Liben-Nowell D., Karger D.R., Kaashoek M.F., Dabek F., and Balakrishnan H. Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Network 11 1 (2003) 17-32
5. Ratnasamy S., Francis P., Handley M., Karp R., and Schenker S. A scalable content-addressable network. Proceedings of SIGCOMM'01 (2001), ACM Press, New York, NY, USA 161-172
6. Loguinov D., Kumar A., Rai V., and Ganesh S. Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. Proceedings of SIGCOMM'03 (2003), ACM Press, New York, NY, USA 395-406
7. F. Kaashoek, D.R. Karger, Koorde: A simple degree-optimal hash table, in: Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS03), Berkeley, CA, 2003.
8. Fraigniaud P., and Gauron P. D2b: a de bruijn based content-addressable network. Theoretical Computer Science 355 1 (2006) 65-79
9. O. Angel, I. Benjamini, E. Ofek, U. Wieder, Routing complexity of faulty networks, in: 24th ACM Symposium on Principles of Distributed Computing (PODC), Las Vegas, NV, 2005.
10. Lam S.S., and Liu H. Failure recovery for structured p2p networks: protocol design and performance evaluation. SIGMETRICS Performance Evaluation Review 32 1 (2004) 199-210
11. S. Wang, D. Xuan, W. Zhao, On resilience of structured peer-to-peer systems, in: Proceedings of GLOBECOM, 2005.
12. D. Leonard, Z. Yao, X. Wang, D. Loguinov, On static and dynamic partitioning behavior of large-scale networks, in: Proceedings of IEEE ICNP.
13. Leonard D., Rai V., and Loguinov D. On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks. SIGMETRICS'05: Proceedings of the 2005 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (2005), ACM Press, New York, NY, USA 26-37
14. R. Bhagwan, S. Savage, G.M. Voelker, Understanding availability, in: Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS03), Berkeley, CA, 2003.
15. L. Massouli, A.-M. Kermarrec, A. Ganesh, Network awareness and failure resilience in self-organising overlay networks, in: IEEE Symposium on Reliable and Distributed Systems, 2003.
16. Liben-Nowell D., Balakrishnan H., and Karger D. Analysis of the evolution of peer-to-peer systems. Proceedings of ACM PODC (2002), ACM Press, New York, NY, USA 233-242
17. Krishnamurthy S., El-Ansary S., Aurell E., and Haridi S. A statistical theory of chord under churn. Fourth International Workshop on Peer-To-Peer Systems (2005), Ithaca, New York
18. Li J., Stribling J., Morris R., Kaashoek M.F., and Gil T.M. A performance vs. cost framework for evaluating dht design tradeoffs under churn. Proceedings of the 24th Infocom (2005), Miami, Florida, USA
19. Pandurangan G., Raghavan P., and Upfal E. Building low-diameter p2p networks. IEEE Journal on Selected Areas in Communications 21 6 (2003) 905-1002
20. Godfrey P.B., Shenker S., and Stoica I. Minimizing churn in distributed systems. SIGCOMM Computer Communication Review 36 4 (2006) 147-158
21. Gummadi K.P., Dunn R.J., Saroiu S., Gribble S.D., Levy H.M., and Zahorjan J. Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. SOSP'03: Proceedings of the 19th ACM symposium on Operating systems principles (2003), ACM Press, New York, NY, USA 314-329
22. S. Saroiu, K.P. Gummadi, S.D. Gribble, A measurement study of peer-to-peer file sharing systems, in: Proceedings of Multimedia Computing and Networking, 2002.
23. Sen S., and Wang J. Analyzing peer-to-peer traffic across large networks. IEEE/ACM Transactions on Network 12 2 (2004) 219-232
24. F.E. Bustamante, Y. Qiao, Friendships that last: peer lifespan and its role in p2p protocols, in: IEEE WCW, 2003.
25. Stutzbach D., and Rejaie R. Understanding churn in peer-to-peer networks. IMC'06: Proceedings of the Sixth ACM SIGCOMM on Internet measurement (2006), ACM Press, New York, NY, USA 189-202
26. T.R. Sean Rhea, Dennis Geels, J. Kubiatowicz, Handling churn in a DHT, in: USENIX Annual Technical Conference, 2004.
27. J. Kleinberg, The Small-World Phenomenon: An Algorithmic Perspective, in: Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000.
28. G. Manku, The power of lookahead in small-world routing networks, Technical Report, CS Department, Stanford University, 2003.
29. G. Cordasco, L. Gargano, M. Hammar, V. Scarano, Degree-optimal deterministic routing for p2p systems, in: Proceedings of IEEE ISCC, IEEE Computer Society, Washington, DC, USA, 2005, pp. 158-163.
30. Plaxton C.G., Rajaraman R., and Richa A.W. Accessing nearby copies of replicated objects in a distributed environment. Proceedings of SPAA'97 (1997), ACM Press, New York, NY, USA 311-320
31. Zhang H., Goel A., and Govindan R. Incrementally improving lookup latency in distributed hash table systems. SIGMETRICS'03: Proceedings of the 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (2003), ACM Press, New York, NY, USA 114-125
32. Z. Yao, D. Leonard, X. Wang, D. Loguinov, Modeling heterogeneous user churn and local resilience of unstructured P2P networks, in: Proceedings of IEEE ICNP, 2006.