HP-Chord: A Peer-to-Peer Overlay to Achieve Better Routing Efficiency by Exploiting Heterogeneity and Proximity
暂无分享,去创建一个
[1] Zheng-tan Zhang,et al. Self-Balanced P2P Expressway: When Marxism Meets Confucian , 2002 .
[2] Ellen W. Zegura,et al. How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[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] Stefan Saroiu,et al. A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .
[5] David R. Karger,et al. Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.
[6] Scott Shenker,et al. Routing Algorithms for DHTs: Some Open Questions , 2002, IPTPS.
[7] Peter Druschel,et al. Exploiting network proximity in peer-to-peer overlay networks , 2002 .