Probabilistic scalable P2P resource location services
ACM SIGMETRICS Performance Evaluation Review
Comparing Hybrid Peer-to-Peer Systems
Proceedings of the 27th International Conference on Very Large Data Bases
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
IEEE Internet Computing
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Efficient, Proximity-Aware Load Balancing for DHT-Based P2P Systems
IEEE Transactions on Parallel and Distributed Systems
An Effective Cooperative Cache Replacement Policy for Mobile P2P Environments
ICHIT '06 Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02
Overlay Networks with Linear Capacity Constraints
IEEE Transactions on Parallel and Distributed Systems
On scalability of proximity-aware peer-to-peer streaming
Computer Communications
Dynamic Multicast in Overlay Networks with Linear Capacity Constraints
IEEE Transactions on Parallel and Distributed Systems
Proximity-Aware Superpeer Overlay Topologies
IEEE Transactions on Network and Service Management
| Hi-index | 0.00 |
In large scale peer-to-peer networks, it is impossible to perform a query request by visiting all peers. There are some works that try to find the location of resources probabilistically (i.e. non-deterministically). They all have used inefficient protocols for finding the probable location of peers who manage the resources. This paper presents a more efficient protocol that is proximity-aware in the sense that it is able to cache and replicate the popular queries proportional to distance latency. The protocol dictates that the farther the resources are located from the origin of a query, the more should be the probability of their replication in the caches of intermediate peers. We have validated the proposed distributed caching scheme by running it on a simulated peer-to-peer network using the well-known Gnutella system parameters. The simulation results show that the proximity-aware distributed caching can improve the efficiency of peer-to-peer resource location services.