A Peer-to-Peer Overlay Network Routing Protocol Based on Bidirectional Circle Topology
暂无分享,去创建一个
[1] Ben Y. Zhao,et al. Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.
[2] W. Randolph Franklin. On an improved algorithm for decentralized extrema finding in circular configurations of processors , 1982, CACM.
[3] Peter Druschel,et al. Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .
[4] Jon Crowcroft,et al. A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.
[5] David R. Karger,et al. Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.
[6] Scott Shenker,et al. Spurring Adoption of DHTs with OpenHash, a Public DHT Service , 2004, IPTPS.
[7] Ernest J. H. Chang,et al. An improved algorithm for decentralized extrema-finding in circular configurations of processes , 1979, CACM.
[8] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.