Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
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
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Beehive: O(1)lookup performance for power-law query distributions in peer-to-peer overlays
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
A catalog-based caching strategy for structured P2P systems
Globe'10 Proceedings of the Third international conference on Data management in grid and peer-to-peer systems
| Hi-index | 0.00 |
Although Distributed Hash Tables (DHTs) are well suited for wide-area distributed applications, they suffer from high latencies (O(log N) in the average case). Such high latencies hinder them from being employed in many relevant wide-area applications such as DNS. To cope with this, a promising solution appears to be the caching of popular files. For effective caching, this requires that the caching protocol places the replicas in such a way that lookups paths are shortened. This implies to delve into the relationship between routing geometries and caching. In this paper, we explore the impact of routing on proactive caching using Chord as case study. To be specific, we clarify the role that path convergence plays upon caching and how this can be used to place file replicas. Also, we present a caching technique to increase the amount of path convergence for randomized topologies such as Symphony, wherein the presence of a certain degree of path convergence is not guaranteed.