| Structured Superpeers: Leveraging Heterogeneity (2003) | |||||||||||||||
Abstract | |||||||||||||||
| Peer-to-peer (P2P) systems are typically divided into those that centralize lookup functionality in a single location and those that distribute the lookup operation across the set of participating hosts. The former approach can offer constant time lookup latency, but is more expensive to scale and suffers from single points of failure. In contrast, the fully distributed approach is easier to scale and can be more resilient to failures, but the lookup latency scales as a function of the total number of participants. While the research community has made great progress in improving the latency of distributed lookup, these systems, exemplified by Chord[17], typically require O(logN) hops to locate an object in a system with N hosts. | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||