A scalable peer-to-peer lookup protocol for Internet applications
暂无分享,去创建一个
[1] 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.
[2] Michael Miller,et al. Discovering P2P , 2001 .
[3] S. Havlin,et al. Breakdown of the internet under intentional attack. , 2000, Physical review letters.
[4] Ke Xu,et al. Enhancing the robustness of scale-free networks , 2009, ArXiv.
[5] Gian Paolo Jesi,et al. Proximity-Aware Superpeer Overlay Topologies , 2006, IEEE Transactions on Network and Service Management.
[6] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..
[7] Minglu Li,et al. Constructing Incentive Oriented Overlay on Mobile Peer-to-Peer Networks , 2007, 2007 International Conference on Parallel Processing Workshops (ICPPW 2007).
[8] Laurent Massoulié,et al. Greening the internet with nano data centers , 2009, CoNEXT '09.
[9] David Mazières,et al. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.
[10] David R. Karger,et al. Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.
[11] Margo McCall,et al. IEEE Computer Society , 2019, Encyclopedia of Software Engineering.
[12] Daniel M. Lewin,et al. Consistent hashing and random trees : algorithms for caching in distributed networks , 1998 .