|
Published Articles >> Table of Contents >> Abstract
The Third IEEE Workshop on Internet Applications
p. 104
Structured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup
Alper Tugay Mýzrak, University of California, San Diego
Yuchung Cheng, University of California, San Diego
Vineet Kumar, University of California, San Diego
Stefan Savage, University of California, San Diego
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/WIAPP.2003.1210294
Send link to a friend
| 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(log N) hops to locate an
object in a system with N hosts.
In this paper, we explore the costs and benefits of a new
hybrid approach that partially distributes lookup information
among a dynamically adjusted set of high-capacity
"superpeers". This design exploits the resource heterogeneity
inherent in existing P2P systems to provide many of
the advantages of a centralized system, even while avoiding
most of the problems associated with such systems. Lookup
is performed using superpeers in constant-time, and the system
performs well even in the event of simultaneous super-peer
failures. Finally, while our gain in performance is potentially
at the expense of scalability, we will show that a
straightforward implementation should be able to scale to
over one million peers with reasonable lookup rates.
|
 Additional Information
|
Citation:
Alper Tugay Mýzrak, Yuchung Cheng, Vineet Kumar, Stefan Savage,
"Structured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup,"
wiapp,
p. 104,
The Third IEEE Workshop on Internet Applications,
2003
|
|
