d-SHAM: An O(d) Scalable Routing Algorithm

Many lookup algorithms were proposed with a constraint of keeping the volume of the routing table at each node/peer minimized while working on reducing the lookup latency. The justification behind this is that large routing tables require maintenance efforts and increased network traffic in order to keeping them updated. However, constant degree overlays come as a practical choice to a minimized lookup latency with limited routing tables. We present d-SHAM, a simple, scalable and robust constant degree algorithm that can adapt to frequent changes in the status of the overlay. In d-SHAM, lookups are within O(d) and each peer holds entries for d.N 1/d other peers, where N is the number of nodes/peers in the overlay, and d is the number of its dimensions.