ASAP: An Advertisement-based Search Algorithm for Unstructured Peer-to-peer Systems
暂无分享,去创建一个
Jun Wang | Peng Gu | Hailong Cai | Hailong Cai | Jun Wang | Peng Gu
[1] Rodrigo Rodrigues,et al. Proceedings of Hotos Ix: the 9th Workshop on Hot Topics in Operating Systems Hotos Ix: the 9th Workshop on Hot Topics in Operating Systems High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two , 2022 .
[2] Scott Shenker,et al. Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.
[3] Christos Gkantsidis,et al. Hybrid search schemes for unstructured peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..
[4] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM '01.
[5] Hector Garcia-Molina,et al. Routing indices for peer-to-peer systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.
[6] 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.
[7] Anjali Gupta,et al. One Hop Lookups for Peer-to-Peer Overlays , 2003, HotOS.
[8] Li Fan,et al. Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.
[9] Robert Tappan Morris,et al. Bandwidth-efficient management of DHT routing tables , 2005, NSDI.
[10] Anand Sivasubramaniam,et al. Semantic small world: an overlay network for peer-to-peer search , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..
[11] Jun Wang,et al. Foreseer: A Novel, Locality-Aware Peer-to-Peer System Architecture for Keyword Searches , 2004, Middleware.
[12] Ellen W. Zegura,et al. How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[13] Ion Stoica,et al. The Case for a Hybrid P2P Search Infrastructure , 2004, IPTPS.
[14] Christos Gkantsidis,et al. Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.
[15] Yuanyuan Zhao,et al. Subscription Propagation in Highly-Available Publish/Subscribe Middleware , 2004, Middleware.
[16] Anne-Marie Kermarrec,et al. Clustering in Peer-to-Peer File Sharing Workloads , 2004, IPTPS.
[17] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[18] Miguel Castro,et al. Debunking some myths about structured and unstructured overlays , 2005, NSDI.
[19] Hector Garcia-Molina,et al. Semantic Overlay Networks for P2P Systems , 2004, AP2PC.
[20] Emin Gün Sirer,et al. Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays , 2004, NSDI.
[21] Stefan Saroiu,et al. A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .
[22] Michael B. Jones,et al. SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.
[23] Wednesday September,et al. 2007 International Conference on Parallel Processing , 2007 .
[24] Krishna P. Gummadi,et al. An analysis of Internet content delivery systems , 2002, OPSR.
[25] Edith Cohen,et al. Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.
[26] Krishna P. Gummadi,et al. Measurement, modeling, and analysis of a peer-to-peer file-sharing workload , 2003, SOSP '03.
[27] Indranil Gupta,et al. Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead , 2003, IPTPS.