Abstract
Several different approaches to realizing the basic principles of DHTs have emerged over the last few years. Although they rely on the same fundamental idea, there is a large diversity of methods for both organizing the identifier space and performing routing. The particular properties of each approach can thus be exploited by specific application scenarios and requirements.
This overview focuses on the three DHT systems that have received the most attention in the research community: Chord, Pastry, and Content Addressable Networks (CAN). Furthermore, the systems Symphony, Viceroy, and Kademlia are discussed because they exhibit interesting mechanisms and properties beyond those of the first three systems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Götz, S., Rieche, S., Wehrle, K. (2005). 8. Selected DHT Algorithms. In: Steinmetz, R., Wehrle, K. (eds) Peer-to-Peer Systems and Applications. Lecture Notes in Computer Science, vol 3485. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11530657_8
Download citation
DOI: https://doi.org/10.1007/11530657_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29192-3
Online ISBN: 978-3-540-32047-0
eBook Packages: Computer ScienceComputer Science (R0)