A Flexible Resource Location Protocol for Peer-to-Peer Network
暂无分享,去创建一个
[1] Sam Toueg,et al. On the impossibility of Directed Moore Graphs , 1980, J. Comb. Theory, Ser. B.
[2] Gurmeet Singh Manku,et al. Symphony: Distributed Hashing in a Small World , 2003, USENIX Symposium on Internet Technologies and Systems.
[3] X. Xiang,et al. ABC: a cluster-based protocol for resource location in peer-to-peer systems , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..
[4] Moni Naor,et al. Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.
[5] Moni Naor,et al. Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds , 2004, IPTPS.
[6] David R. Karger,et al. Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.
[7] Abhishek Kumar,et al. Ulysses: a robust, low-diameter, low-latency peer-to-peer network , 2004, Eur. Trans. Telecommun..
[8] Ben Y. Zhao,et al. Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.
[9] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM '01.
[10] Jianguo Chen,et al. A Secure Routing Protocol for Peer-to-Peer Network , 2010, J. Convergence Inf. Technol..
[11] Dmitri Loguinov,et al. Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience , 2003, IEEE/ACM Transactions on Networking.
[12] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.
[13] Gade Krishna,et al. A scalable peer-to-peer lookup protocol for Internet applications , 2012 .