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
Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
A New Layered P2P Architecture with Efficient Resource Location Strategy
CEC-EAST '04 Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference
Supporting Cooperative Caching in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Cache-Friendly implementations of transitive closure
Journal of Experimental Algorithmics (JEA)
Hi-index | 0.00 |
Unstructured peer-to-peer (P2P) networks have power-law topology, and the number of content requests also follows power-law distributions. These properties cause two problems: the high-load of high-degree peers and the quick deletion of rarely requested contents. We propose a new caching scheme that replaces the cache on the basis of the number of request messages per unit of time. It significantly reduces the load of high-degree peers and improves the hit rate. Moreover, we use a simulation to show the effectivity of our proposed method.