Failure recovery for structured P2P networks: Protocol design and performance evaluation

Performance Evaluation Review

Volumn 32, Issue 1, 2004, Pages 199-210

  Lam, Simon S ^a   Liu, Huaiyu ^a  

^a University of Texas at Austin   (United States)

Author keywords

Failure recovery; Hypercube routing; K consistency; Peer to peer networks; Sustainable churn rate

Indexed keywords

COMPUTER SIMULATION; FAILURE ANALYSIS; QUERY LANGUAGES; ROBUSTNESS (CONTROL SYSTEMS); ROUTERS; TELECOMMUNICATION NETWORKS;

FAILURE RECOVERY; HYPERCUBE ROUTING; K-CONSISTENCY; PEER-TO-PEER (P2P) NETWORKS; SUSTAINABLE CHURN RATE;

PACKET NETWORKS;

EID: 8344258454     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1012888.1005712     Document Type: Conference Paper

References (13)

1. C. Blake and R. Rodrigues. High availability, scalable storage, dynamic peer networks: Pick two. In Prof. of Ninth Workshop on Hot Topics in Operating Systems (HotOS-IX), May 2003.
2. K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao. Distributed object location in a dynamic network. In Proc. of ACM Symposium on Parallel Algorithms and Architectures, August 2002.
3. S. S. Lam and H. Liu. Silk: a resilient routing fabric for peer-to-peer networks. Technical Report TR-03-13, Dept. of CS, Univ. of Texas at Austin, May 2003.
4. S. S. Lam and A. U. Shankar. A theory of interfaces and modules I-composition theorem. IEEE Transactions on Software Engineering, January 1994.
5. J. Li, J. Stribling, T. M. Gil, R. Morris, and F. Kaashoek. Comparing the performance of distributed hash tables under churn. In Proc. of International Workshop on Peer-to-Peer Systems, March 2004.
6. H. Liu and S. S. Lam. Neighbor table construction and update in a dynamic peer-to-peer network. In Proc. of IEEE International Conference on Distributed Computing Systems (ICDCS), May 2003.
7. C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proc. of ACM Symposium on Parallel Algorithms and Architectures, June 1997.
8. S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling churn in a DHT. Technical Report CSD-03-1299, U. C. Berkeley, Dec. 2003.
9. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. of IFIP/ACM International Conference on Distributed Systems Platforms, November 2001.
10. S. Sariou, P. K. Gummadi, and S. D. Gribble. A measurement study of peer-to-peer file sharing systems. In Proc. of Multimedia Computing and Networking, January 2002.
11. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. of ACM SIGCOMM, August 2001.
12. E. W. Zegura, K. Calvert, and S. Bhattacharjee. How to model an internetwork. In Proc. of IEEE Infocom, March 1996.
13. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowicz. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, Vol.22(No.1), January 2004.