Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
SCRIBE: The Design of a Large-Scale Event Notification Infrastructure
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Remindin': semantic query routing in peer-to-peer networks based on social metaphors
Proceedings of the 13th international conference on World Wide Web
Semantic Small World: An Overlay Network for Peer-to-Peer Search
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Foreseer: a novel, locality-aware peer-to-peer system architecture for keyword searches
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Guiding queries to information sources with InfoBeacons
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Subscription propagation in highly-available publish/subscribe middleware
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Adlib: A Self-Tuning Index for Dynamic Peer-to-Peer Systems
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
An analysis of internet content delivery systems
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Publish/subscribe functionality in IR environments using structured overlay networks
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
Probabilistic file indexing and searching in unstructured peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
High availability, scalable storage, dynamic peer networks: pick two
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
One hop lookups for peer-to-peer overlays
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Debunking some myths about structured and unstructured overlays
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Bandwidth-efficient management of DHT routing tables
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Efficient peer-to-peer keyword searching
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Searching dynamic communities with personal indexes
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
The case for a hybrid p2p search infrastructure
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Clustering in peer-to-peer file sharing workloads
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
| Hi-index | 0.00 |
Most of the existing search algorithms for unstructured peer-to-peer (P2P) systems share one common approach: the requesting node sends out a keyword search query and the query message is repeatedly routed and forwarded to other peers in the overlay network. Due to multiple hops involved in query forwarding, the search may result in a long delay before it is answered. Furthermore, some incapable nodes may be overloaded when the query traffic becomes intensive or bursty. In this paper, we present a novel content-pushing, Advertisement-based Search Algorithm for unstructured Peer-to-peer systems (ASAP). An advertisement (ad) is a synopsis of contents a peer tends to share, and appropriately distributed and selectively cached by other peers in the system. In ASAP, nodes proactively advertise their contents by delivering ads, and selectively storing interesting ads received from other peers. Upon a request, a node can locate the destination nodes by looking up its local ads repository, and thus obtain a one-hop search latency with modest search cost. Comprehensive experimental results show that, compared with traditional query-based search algorithms, ASAP achieves much better search efficiency, and maintains system load at a low level with small variations. In addition, ASAP works well under node churn.