Neighbor-of-neighbor routing over deterministically modulated Chord-like DHTs
暂无分享,去创建一个
[1] Gennaro Cordasco,et al. Degree-optimal deterministic routing for P2P systems , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).
[2] Giovanni Chiola,et al. Overlay networks with class , 2005, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05).
[3] M. Hammar,et al. Non-uniform deterministic routing on F-Chord(/spl alpha/) , 2004, 2004 International Workshop on Hot Topics in Peer-to-Peer Systems.
[4] Gennaro Cordasco,et al. Non-uniform deterministic routing on F-Chord(α) , 2005, HOT-P2P.
[5] 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..
[6] David R. Karger,et al. Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.
[7] Moni Naor,et al. Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks , 2004, STOC '04.
[8] Moni Naor,et al. Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.
[9] Peter Druschel,et al. Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .
[10] Giovanni Chiola,et al. ``Optimizing the finger tables in Chord-like DHTs''}boo , 2008 .
[11] David R. Karger,et al. Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.
[12] Rajeev Motwani,et al. Randomized algorithms , 1996, CSUR.
[13] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.
[14] Jon M. Kleinberg,et al. The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.
[15] Ben Y. Zhao,et al. An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .
[16] Giovanni Chiola,et al. Optimizing the finger table in chord-like DHTs , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.