Implementing Chord for HP2P Network
暂无分享,去创建一个
Yang Cao | Zhenhua Duan | Jian-Jun Qi | Zhuo Peng | Ertao Lv
[1] Jeffrey Considine,et al. Cluster-Based Optimizations for Distributed Hash Tables , 2002 .
[2] Scott Shenker,et al. Routing Algorithms for DHTs: Some Open Questions , 2002, IPTPS.
[3] David R. Karger,et al. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.
[4] Ben Y. Zhao,et al. An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .
[5] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM 2001.
[6] Hector Garcia-Molina,et al. Designing a super-peer network , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).
[7] Krishna P. Gummadi,et al. Canon in G major: designing DHTs with hierarchical structure , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..
[8] Peter Druschel,et al. Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .
[9] Olivier Festor,et al. A Hierarchical Architecture for a Distributed Management of P2P Networks and Services , 2005, DSOM.
[10] Edith Cohen,et al. Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.
[11] Ben Y. Zhao,et al. Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and , 2001 .
[12] Edith Cohen,et al. Search and replication in unstructured peer-to-peer networks , 2002 .
[13] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.
[14] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.