Skip to Main Content
In this paper we propose adaptive data dissemination algorithms for intelligently routing search queries in a peer-to-peer network. In our mechanism nodes build content synopses of their data and adaptively disseminate them to the most appropriate nodes. Based on the content synopses, a routing mechanism is being built to forward the queries to those nodes that have a high probability of providing the desired results. Our simulation results show that our approach is highly scalable and significantly improves resources usage by saving both bandwidth and processing power.
Date of Conference: 17-17 March 2009