Beehive: Exploiting Power Law Query Distributions for O(1) Lookup Performance in Peer to Peer Overlays

Structured peer-to-peer hash tables provide decentraliza- tion, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high la- tencies (O( )) in the average case. Such high latencies pro- hibit them from being used in many relevant, demanding appli- cations such as DNS. In this paper, we present a proactive repli- cation framework that can achieve O( ) lookup performance for common Zipf-like query distributions. This framework is based around a closed-form solution that achieves O( ) lookup performance with low storage requirements, bandwidth over- head and network load. Simulations show that this replication framework can realistically achieve good latencies, outperform passive caching, and adapt efficiently to sudden changes in ob- ject popularity, also known as flash crowds. This framework provides a feasible substrate for high-performance, low-latency applications, such as peer-to-peer domain name service.