TCS-Chord: An Improved Routing Algorithm to Chord Based on the Topology-aware Clustering in Self-organizing Mode
暂无分享,去创建一个
[1] Peter Druschel,et al. Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .
[2] Balachander Krishnamurthy,et al. Early measurements of a cluster-based architecture for P2P systems , 2001, IMW '01.
[3] Daniel M. Lewin,et al. Consistent hashing and random trees : algorithms for caching in distributed networks , 1998 .
[4] Ben Y. Zhao,et al. Brocade: Landmark Routing on Overlay Networks , 2002, IPTPS.
[5] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.
[6] 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.
[7] Peter Druschel,et al. Exploiting network proximity in peer-to-peer overlay networks , 2002 .
[8] Moni Naor,et al. Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.
[9] Mark Handley,et al. Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[10] Jie Liu,et al. QUERY ROUTING IN A PEER‐TO‐PEER SEMANTIC LINK NETWORK , 2005, Comput. Intell..
[11] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.