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
Probabilistic scalable P2P resource location services
ACM SIGMETRICS Performance Evaluation Review
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
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Adaptive Probabilistic Search for Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
ICN: Interest-Based Clustering Network
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
Schema Caching for Improved XML Query Processing in P2P Systems
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
On the Performance of Flooding-Based Resource Discovery
IEEE Transactions on Parallel and Distributed Systems
IAC: Interest-Aware Caching for Unstructured P2P
SKG '06 Proceedings of the Second International Conference on Semantics, Knowledge, and Grid
Search Algorithms for Unstructured Peer-to-Peer Networks
LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks
An adaptive routing mechanism for efficient resource discovery in unstructured p2p networks
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Improving search in unstructured P2P systems: intelligent walks (I-walks)
IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning
Proactive replication for rare objects in unstructured peer-to-peer networks
Journal of Network and Computer Applications
Direction-aware resource discovery in large-scale distributed computing environments
The Journal of Supercomputing
| Hi-index | 0.00 |
Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorithms used in such systems. Blind flooding is not scalable because of its high communication cost. On the other hand, the performance of random walks approaches largely depends on the random choice of walks. Some informed mechanisms use additional information, usually obtained from previous queries, for routing. Such approaches can reduce the traffic overhead but they limit the query coverage. Furthermore, they usually rely on complex protocols to maintain information at each peer. In this paper, we propose two schemes which can be used to improve the search performance in unstructured peer-to-peer networks. The first one is a simple caching mechanism based on resource descriptions. Peers that offer resources send periodic advertisement messages. These messages are stored into a cache and are used for routing requests. The second is a dynamic Time-To-Live (TTL) which enables messages to break their horizon. Instead of decreasing the query TTL by 1 at each hop, it is decreased by a value v such as 0