Abstract
A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn – changes in membership – in order to maintain its ability to route lookups efficiently. This paper formulates a unified framework for evaluating cost and performance. Communication costs are combined into a single cost measure (bytes), and performance benefits are reduced to a single latency measure. This approach correctly accounts for background maintenance traffic and timeouts during lookup due to stale routing data, and also correctly leaves open the possibility of different preferences in the tradeoff of lookup time versus communication cost. Using the unified framework, this paper analyzes the effects of DHT parameters on the performance of four protocols under churn.
This research was conducted as part of the IRIS project (http://project-iris.net/), supported by the National Science Foundation under Cooperative Agreement No. ANI-0225660.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Castro, M., Costa, M., Rowstron, A.: Performance and dependability of structured peer-to-peer overlays. Tech. Rep. MSR-TR-2003-94, Microsoft Research (December 2003)
Gummadi, K.P., Gummadi, R., Gribble, S., Ratnasamy, S., Shenker, S., Stoica, I.: The impact of DHT routing geometry on resilience and proximity. In: Proceedings of the 2003 ACM SIGCOMM, Karlsruhe, Germany (August 2003)
Gummadi, K.P., Saroiu, S., Gribble, S.D.: King: Estimating latency between arbitrary Internet end hosts. In: Proceedings of the 2002 SIGCOMM Internet Measurement Workshop, Marseille, France (November 2002)
Gummadi, P.K., Saroiu, S., Gribble, S.: A measurement study of Napster and Gnutella as examples of peer-to-peer file sharing systems. Multimedia Systems Journal 9(2), 170–184 (2003)
Gupta, A., Liskov, B., Rodrigues, R.: One hop lookups for peer-to-peer overlays. In: Proceedings of the Ninth Workshop on Hot Topics in Operating Systems (May 2003)
Gupta, I., Birman, K., Linga, P., Demers, A., van Renesse, R.: Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Kaashoek, M.F., Karger, D.R.: Koorde: A simple degree-optimal hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Liben-Nowell, D., Balakrishnan, H., Karger, D.R.: Analysis of the evolution of peer-to-peer systems. In: Proceedings of the 2002 ACM Symposium on Principles of Distributed Computing (August 2002)
Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable dynamic emulation of the butterfly. In: Proceedings of the 2002 ACM Symposium on Principles of Distributed Computing (August 2002)
Maymounkov, P., Mazieres, D.: Kademlia: A peer-to-peer information system based on the XOR metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 53. Springer, Heidelberg (2002)
Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: Handling churn in a DHT. Tech. Rep. UCB/CSD-3-1299, UC Berkeley, Computer Science Division (December 2003)
Rhea, S., Roscoe, T., Kubiatowicz, J.: Structured peer-to-peer overlays need application-driven benchmarks. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networking, 149–160 (2002)
Xu, J.: On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. In: Proceedings of the IEEE Infocom (March 2003)
Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications 22(1), 41–53 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, J., Stribling, J., Gil, T.M., Morris, R., Kaashoek, M.F. (2005). Comparing the Performance of Distributed Hash Tables Under Churn. In: Voelker, G.M., Shenker, S. (eds) Peer-to-Peer Systems III. IPTPS 2004. Lecture Notes in Computer Science, vol 3279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30183-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-30183-7_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24252-9
Online ISBN: 978-3-540-30183-7
eBook Packages: Computer ScienceComputer Science (R0)