Design and analysis of adaptive strategies for locating internet-based servers in MANETs
Performance Evaluation
Novel approaches to efficient flooding search in peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient file search in non-DHT P2P networks
Computer Communications
Dynamic Querying in Structured Peer-to-Peer Networks
DSOM '08 Proceedings of the 19th IFIP/IEEE international workshop on Distributed Systems: Operations and Management: Managing Large-Scale Service Deployment
Popularity adaptive search in hybrid P2P systems
Journal of Parallel and Distributed Computing
Utilizing XML Clustering for Efficient XML Data Management on P2P Networks
DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
A novel approach to improving search efficiency in unstructured peer-to-peer networks
Journal of Parallel and Distributed Computing
Evaluation of P2P search algorithms for discovering trust paths
EPEW'07 Proceedings of the 4th European performance engineering conference on Formal methods and stochastic models for performance evaluation
Enabling Dynamic Querying over Distributed Hash Tables
Journal of Parallel and Distributed Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fuzzy-based load self-configuration in mobile P2P services
Computer Networks: The International Journal of Computer and Telecommunications Networking
On pending interest table in named data networking
Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems
Improving the performance of P2P networks using SPIS with Query Filtering
Journal of High Speed Networks
| Hi-index | 0.00 |
In unstructured peer-to-peer networks, controlled flooding aims at locating an item at the minimum message cost. Dynamic querying is a new controlled flooding technique. While it is implemented in some peer-to-peer networks, little is known about its undesirable behavior and little is known about its general usefulness in unstructured peerto- peer networks. This paper describes the first evaluation and analysis of such techniques, and proposes novel techniques to improve them. We make three contributions. First, we find the current dynamic querying design is flawed. Although it is advantageous over the expanding ring algorithm in terms of search cost, it is much less attractive in terms of peer perceived latency, and its strict constraints on network connectivity prevent it from being widely adopted. Second, we propose an enhanced flooding technique which requires the search cost close to the minimum, reduces the search latency by more than four times, and loosens the constraints on the network connectivity. Thus, we make such techniques useful for the general unstructured peer-to-peer networks. Third, we show that our proposal requires only minor modifications to the existing search mechanisms and can be incrementally deployed in peer-to-peer networks.