BaRT, balanced randomized tree: a scalable and distributed protocol for lookup in peer-to-peer networks
暂无分享,去创建一个
[1] Karl Aberer,et al. P-Grid: A Self-Organizing Access Structure for P2P Information Systems , 2001, CoopIS.
[2] David R. Karger,et al. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.
[3] Moni Naor,et al. Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks , 2004, STOC '04.
[4] de Ng Dick Bruijn. A combinatorial problem , 1946 .
[5] Andrey Soares. Legitimate applications of peer-to-peer networks , 2006, J. Assoc. Inf. Sci. Technol..
[6] Tesi di Laurea,et al. UNIVERSITÀ DEGLI STUDI DI ROMA "LA SAPIENZA" , 2000 .
[7] David R. Karger,et al. Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.
[8] Michael B. Jones,et al. SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.
[9] David R. Karger,et al. Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.
[10] Ben Y. Zhao,et al. OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.
[11] David R. Karger,et al. Wide-area cooperative storage with CFS , 2001, SOSP.
[12] Rajmohan Rajaraman,et al. Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1999, Theory of Computing Systems.
[13] Anjali Gupta,et al. One Hop Lookups for Peer-to-Peer Overlays , 2003, HotOS.
[14] Dinesh C. Verma. The Peer‐to‐Peer Architecture , 2004 .
[15] Jon M. Kleinberg,et al. The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.