Empowering Chord DHT overlays
暂无分享,去创建一个
[1] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.
[2] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[3] Dongsheng Wang,et al. Janus: Build Gnutella-Like File Sharing System over Structured Overlay , 2004, GCC.
[4] Scott Shenker,et al. Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.
[5] Cui Yong,et al. S-Chord: hybrid topology makes chord efficient , 2005 .
[6] Yiming Hu,et al. A Super-Peer Based Lookup in Structured Peer-to-Peer Systems , 2003, ISCA PDCS.
[7] Lada A. Adamic,et al. Local Search in Unstructured Networks , 2002, ArXiv.
[8] J. Ritter. Why Gnutella Can't Scale. No, Really , 2001 .
[9] Albert-László Barabási,et al. Statistical mechanics of complex networks , 2001, ArXiv.
[10] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.
[11] Changyong Liang,et al. BiChord: An Improved Approach for Lookup Routing in Chord , 2005, ADBIS.
[12] Jun Li,et al. Scalable supernode selection in peer-to-peer overlay networks , 2005 .
[13] Georgios Pitsilis,et al. A Policy for Electing Super-Nodes in Unstructured P2P Networks , 2004, AP2PC.