A Pragmatic Approach to DHT Adoption
暂无分享,去创建一个
Jeffrey Considine | Michael Walfish | David G. Anderson | Michael Walfish | Jeffrey Considine | David.G. Anderson
[1] Larry L. Peterson,et al. The dark side of the Web , 2004, Comput. Commun. Rev..
[2] Indranil Gupta,et al. Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead , 2003, IPTPS.
[3] Ben Y. Zhao,et al. Approximate Object Location and Spam Filtering on Peer-to-Peer Systems , 2003, Middleware.
[4] Ben Y. Zhao,et al. Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.
[5] Ben Y. Zhao,et al. Towards a Common API for Structured Peer-to-Peer Overlays , 2003, IPTPS.
[6] Rajmohan Rajaraman,et al. Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1997, SPAA '97.
[7] Ian Clarke,et al. Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.
[8] Anjali Gupta,et al. One Hop Lookups for Peer-to-Peer Overlays , 2003, HotOS.
[9] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.
[10] Robert Tappan Morris,et al. Serving DNS Using a Peer-to-Peer Lookup Service , 2002, IPTPS.
[11] Krishna P. Gummadi,et al. The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.
[12] de Ng Dick Bruijn. A combinatorial problem , 1946 .
[13] David R. Karger,et al. Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.