Non-uniform deterministic routing on F-Chord(/spl alpha/)
暂无分享,去创建一个
M. Hammar | L. Gargano | G. Cordasco | A. Negro | V. Scarano | G. Cordasco | L. Gargano | A. Negro | V. Scarano | M. Hammar | Mikael Hammar
[1] Rajeev Motwani,et al. Randomized Algorithms , 1995, SIGA.
[2] Moni Naor,et al. A Simple Fault Tolerant Distributed Hash Table , 2003, IPTPS.
[3] James Aspnes,et al. Skip graphs , 2003, SODA '03.
[4] Gennaro Cordasco,et al. Degree-optimal deterministic routing for P2P systems , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).
[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. Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.
[7] Gurmeet Singh Manku,et al. Optimal routing in Chord , 2004, SODA '04.
[8] Gennaro Cordasco,et al. Brief announcement: degree: optimal deterministic routing for P2P systems , 2004, PODC '04.
[9] Abhishek Kumar,et al. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks , 2004, IEEE J. Sel. Areas Commun..
[10] Abhishek Kumar,et al. Ulysses: a robust, low-diameter, low-latency peer-to-peer network , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..
[11] Edward M. Reingold,et al. Optimum lopsided binary trees , 1989, JACM.
[12] Moni Naor,et al. Novel architectures for P2P applications: the continuous-discrete approach , 2003, SPAA '03.
[13] Peter Druschel,et al. Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .
[14] Moni Naor,et al. Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks , 2004, STOC '04.
[15] Moni Naor,et al. Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.
[16] Moni Naor,et al. Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds , 2004, IPTPS.
[17] Gurmeet Singh Manku,et al. Symphony: Distributed Hashing in a Small World , 2003, USENIX Symposium on Internet Technologies and Systems.
[18] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM 2001.
[19] David R. Karger,et al. Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.
[20] Ben Y. Zhao,et al. Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.
[21] Jon M. Kleinberg,et al. The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.
[22] Sharon L. Milgram,et al. The Small World Problem , 1967 .
[23] D. Du,et al. Combinatorial Group Testing and Its Applications , 1993 .
[24] Scott Shenker,et al. Routing Algorithms for DHTs: Some Open Questions , 2002, IPTPS.
[25] D. Watts,et al. An Experimental Study of Search in Global Social Networks , 2003, Science.