Solving for read hot-spots is not difficult if you're willing to accept a small read penalty: Your typical Kademlia DHT has k-replicas of each piece of data, s

Solving for read hot-spots is not difficult if you're willing to accept a small read penalty: Your typical Kademlia DHT has k-replicas of each piece of data, so you read near the target node (node closest to the target key) rather than directly from it. This way, nodes at different points in the network read from many different replicas. Of course, this depends on your consistency requirements.