Proactive Caching for Better than Single-Hop Lookup Performance

@inproceedings{Ramasubramanian2007ProactiveCF,
  title={Proactive Caching for Better than Single-Hop Lookup Performance},
  author={Venugopalan Ramasubramanian},
  year={2007}
}
High lookup latencies prohibit peer-to-peer overlays from being used in many performance intensive applications, even though they provide self-organization, scalability, and failure resilience. In this paper, we show that lookup performance of structured DHTs can be improved to any desired constant, even under a single hop, by controlled proactive replication. By exploiting the popularity distribution of objects, we can minimize the number of replicas and reduce the storage and bandwidth cost… CONTINUE READING