Overlay networks with class
暂无分享,去创建一个
Giovanni Chiola | Gennaro Cordasco | Alberto Negro | Vittorio Scarano | Luisa Gargano | G. Cordasco | G. Chiola | L. Gargano | A. Negro | V. Scarano
[1] Moni Naor,et al. Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks , 2004, STOC '04.
[2] David R. Karger,et al. Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.
[3] Moni Naor,et al. Novel architectures for P2P applications: the continuous-discrete approach , 2003, SPAA '03.
[4] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.
[5] Jon M. Kleinberg,et al. The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.
[6] Ben Y. Zhao,et al. An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .
[7] Gurmeet Singh Manku,et al. Symphony: Distributed Hashing in a Small World , 2003, USENIX Symposium on Internet Technologies and Systems.
[8] Jun Xu. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks , 2004, IEEE Journal on Selected Areas in Communications.
[9] Gennaro Cordasco,et al. Degree-optimal deterministic routing for P2P systems , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).
[10] James Aspnes,et al. Skip graphs , 2003, SODA '03.
[11] David R. Karger,et al. Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.
[12] Moni Naor,et al. Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.
[13] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.