Efficient lookup on unstructured topologies
暂无分享,去创建一个
[1] Ittai Abraham,et al. Probabilistic Quorums for Dynamic Systems , 2003, DISC.
[2] Devdatt P. Dubhashi,et al. Balls and bins: A study in negative dependence , 1996, Random Struct. Algorithms.
[3] Christos Gkantsidis,et al. Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.
[4] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.
[5] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[6] Michael Mitzenmacher,et al. Compressed bloom filters , 2001, PODC '01.
[7] Richard P. Martin,et al. PlanetP: using gossiping to build content addressable peer-to-peer information sharing communities , 2003, High Performance Distributed Computing, 2003. Proceedings. 12th IEEE International Symposium on.
[8] Mikkel Thorup,et al. Compact name-independent routing with minimum stretch , 2004, SPAA '04.
[9] Moni Naor,et al. Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.
[10] Jacky C. Chu,et al. Availability and locality measurements of peer-to-peer file systems , 2002, SPIE ITCom.
[11] Rajmohan Rajaraman,et al. Compact routing with name independence , 2003, SPAA '03.
[12] Hector Garcia-Molina,et al. YAPPERS: a peer-to-peer lookup service over arbitrary topology , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[13] Rajeev Motwani,et al. Randomized algorithms , 1996, CSUR.
[14] Hector Garcia-Molina,et al. Improving search in peer-to-peer networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.
[15] Aravind Srinivasan,et al. Efficient lookup on unstructured topologies , 2005, IEEE Journal on Selected Areas in Communications.
[16] Ittai Abraham,et al. Name independent routing for growth bounded networks , 2005, SPAA '05.
[17] Krishna P. Gummadi,et al. Measuring and analyzing the characteristics of Napster and Gnutella hosts , 2003, Multimedia Systems.
[18] Ian T. Foster,et al. Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems , 2002, IPTPS.
[19] Venugopalan Ramasubramanian,et al. Beehive: Exploiting Power Law Query Distributions for O(1) Lookup Performance in Peer to Peer Overlays , 2003 .
[20] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM 2001.
[21] Scott Shenker,et al. Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.
[22] Ian Clarke,et al. Protecting Free Expression Online with Freenet , 2002, IEEE Internet Comput..
[23] Song Jiang,et al. LightFlood: an efficient flooding scheme for file search in unstructured peer-to-peer systems , 2003, 2003 International Conference on Parallel Processing, 2003. Proceedings..
[24] John Kubiatowicz,et al. Probabilistic location and routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[25] Robert Morris,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.
[26] Edith Cohen,et al. Search and replication in unstructured peer-to-peer networks , 2002 .