|
Second Workshop on Real, Large Distributed Systems—Preliminary Abstract
Pp. 25–30 of the Proceedings
Fixing the Embarrassing Slowness of OpenDHT on PlanetLab
Sean Rhea, Byung-Gon Chun, John Kubiatowicz, and Scott Shenker, University of California, Berkeley
Abstract
We adopt the position that the best solution to
the problem of slow nodes is to modify our algorithms
to account for them automatically. Using a combination
of delay-aware routing and a moderate amount of redundancy,
our best technique reduces the median latency of
get operations to 51 ms and the 99th percentile to 387 ms,
a tremendous improvement over our original algorithm.
- View the full text of this paper in PDF.
Until December 2006, you will need your USENIX membership identification in order to access the full papers. The Proceedings are published as a collective work, © 2005 by the USENIX Association. All Rights Reserved. Rights to individual papers remain with the author or the author's employer. Permission is granted for the noncommercial reproduction of the complete work for educational or research purposes. USENIX acknowledges all trademarks within this paper.
- If you need the latest Adobe Acrobat Reader, you can download it from Adobe's site.
|
Need help? Use our Contacts page.
