Abstract
Third generation Peer-to-Peer (P2P) networks are characterized by the fact, that they are based on Distributed Hash Tables (DHT). Thus, it is intended to reduce the high signaling overhead observed in unstructured P2P networks like in Gnutella. However especially if the churn rate in the considered approach is high, i.e. nodes leaving and joining the network frequently (small session duration) the signaling traffic needed to maintain the DHT structure increases considerably. In the Chord protocol, which is investigated in this work, so called fingers are used to establish shortcuts though the DHT structure to achieve a scalable routing performance. To keep these fingers up to date in regular Chord, a significant amount of signaling traffic is necessary, especially in high churn scenarios. Therefore we propose a new scheme which provides additional finger update methods without causing additional traffic.
Chapter PDF
6. References
Binzenhöfer, A., Staehle, D., and Henjes, R. (2004).“On the Stability of Chord-based P2P Systems,” University of Würzburg 347, Nov 2004.
BitTorrent (2004). Incentives to Build Robustness in BitTorrent, bitconjurer.org/BitTorrent/bittorrentecon.pdf, 2004
Cordasco, G., Gargano, L., Hammar, M., Negro, A., and Scarano, V. (2004). “F-Chord: Improved Uniform Routing on Chord,” presented at Structural Information and Communication Complexity: 11th International Colloquium, SIROCCO 2004.
Gnutella (2002) Gnutella 0.6 RFC, http://rfc-gnutella.sourceforge.net/draft.txt, 2002
Gummadi, K. et al. (2003). “The Impact of DHT Routing Geometry on Resilience and Proximity,” presented at ACM SIGCOMM 2003.
Kazaa (2003) Kazaa homepage, http://www.kazaa.com/us/index.htm
Mesaros, V.A., Carton, B., and Roy P.V. (2003). “S-Chord: Using Symmetry to Improve Lookup Efficiency in Chord,” presented at 2003 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’03).
Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S., (2001). “A Scalable Content-Addressable Network,” presented at ACM SIGCOMM Conference.
Schollmeier, R. and Dumanois, A. (2003).“Peer-to-Peer Traffic Characteristics” UNICE2003
Skype (2004) homepage, http://www.skype.com/. 2004
Stoica, I., Morris, R., Karger, D., Kaashoek, M. and Balakrishnan, H. (2001). “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” presented at ACM SIGCOMM Conference.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Kunzmann, G., Schollmeier, R. (2006). Exploiting the Overhead in a DHT to Improve Lookup Latency. In: Kloos, C.D., Marín, A., Larrabeiti, D. (eds) EUNICE 2005: Networks and Applications Towards a Ubiquitously Connected World. IFIP International Federation for Information Processing, vol 196. Springer, Boston, MA. https://doi.org/10.1007/0-387-31170-X_18
Download citation
DOI: https://doi.org/10.1007/0-387-31170-X_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30815-9
Online ISBN: 978-0-387-31170-8
eBook Packages: Computer ScienceComputer Science (R0)