Pie: scalable routing in peer-to-peer networks
Peter Lichodzijewski, Leigh Wetmore, Nur Zincir-Heywood · 2004
Distributed hash tables (DHTs) are a class of algorithms used to store and retrieve information in peer-to-peer (P2P) systems in a scalable and robust fashion. Pie, a routing protocol for a new DHT framework, is presented. The performance of this algorithm is empirically compared to an existing DHT framework, Chord. Results show that Pie performs better than Chord with respect to the number of logical hops. It also yields a smaller delay and better load balancing. The results are supported by a paired t-test at an alpha level of 0.01.