Abstract
Distributed Hash Tables (DHT) provide a lookup service in peer-to-peer overlay networks. The known problem is that lookups function poorly when no direct IP connectivity is available to some nodes (e.g., located behind a NAT or firewall) or in the presence of overloaded or malicious nodes. In this chapter, we describe a method for DHT-based routing called Cyclic Routing (CR). It generalizes existing single-hop look-ahead approach (also known as “Know thy neighbor’s neighbor”) and supports multipath routing. The method provides a systematic way for collecting stable and efficient overlay paths. Cyclic routing has the same theoretical dependability and efficiency upper bounds as basic DHT routing but it is more resilient when IP connectivity is limited or when the overlay suffers from overloaded nodes. The CR method was implemented in the CR-Chord protocol and its experimental evaluation showed improvement in the lookup availability.
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
Notes
- 1.
References
Castro, M., Drushel, P., Hu, Y., Rowstron, A.: Exploiting network proximity in peer-to-peer networks. Technical Report MSR-TR-2002-82, Microsoft Research (2002)
Castro, M., Drushel, P., Ganesh, A., Rowstron, A., Wallach, D.S.: Secure routing for structured peer-to-peer overlay networks. In: Proceedings of 5th USENIX Symposium on Operating System Design and Implementation (OSDI 2002), pp. 299–314. ACM, Boston (2002)
Castro, M., Costa, M., Rowstron, A.: Performance and dependability of structured peer-to-peer overlays. Technical Report MSR-TR-2003-94, Microsoft Research (2003)
Freedman, M.J., Lakshminarayanan, K., Rhea, S., Stoica, I.: Non-transitive connectivity and DHTs. In: Proceedings of the 2nd USENIX Workshop on Real, Large Distributed Systems (WORLDS’05), pp. 55–60, USENIX Association San Francisco (2005)
Gummadi, K., Gummadi, R., Gribble, S., Ratnasamy, S., Shenker, S., Stoica, I.: The impact of DHT routing geometry on resilience and proximity. In: Proceedings of ACM SIGCOMM’03, pp. 381–394. ACM, New York (2003). doi: http://doi.acm.org/10.1145/863955.863998
Kaashoek, M.F., Karger, D.R.: Koorde: A simple degree-optimal distributed hash table. In: IPTPS ’03: Proceedings of 2nd International Workshop on Peer-to-Peer Systems. Lecture Notes in Computer Science, vol. 2735, pp. 98–107. Springer, Berlin (2003)
Korzun, D., Nechaev, B., Gurtov, A.: CR-Chord: Improving lookup availability in the presence of malicious DHT nodes. HIIT Technical Report 2008-2, Helsinki Institute for Information Technology HIIT (2008). URL: http://www.hiit.fi/nrg-publications
Kurose, J.F., Ross, K.: Computer Networking: A Top-Down Approach Featuring the Internet. Addison-Wesley Longman Publishing Co. Inc., Boston (2002)
Leong, B., Liskov, B., Demaine, E.: Epichord: parallelizing the Chord lookup algorithm with reactive routing state management. In: ICON 2004: Proceedings of 12th International Conference on Networks, IEEE, USA pp. 270–276 (2004)
Li, J., Stribling, J., Morris, R., Kaashoek, M.F.: Bandwidth-efficient management of DHT routing tables. In: Proceedings of the 2nd Symposium on Networked Systems Design and Implementation (NSDI ’05), USENIX Association. USA pp. 99–114 (2005)
Manku, G.S., Naor, M., Wieder, U.: Know thy neighbor’s neighbor: the power of lookahead in randomized P2P networks. In: STOC ’04: Proceedings of 36th Annual ACM Symposium on Theory of Computing, pp. 54–63. ACM, New York (2004). doi: http://doi.acm.org/10.1145/1007352.1007368
Naor, M., Wieder, U.: Know thy neighbor’s neighbor: better routing for skip-graphs and small worlds. In: IPTPS ’04: Proceedings of 3rd International Workshop on Peer-to-Peer Systems. Lecture Notes in Computer Science, vol. 3279. Springer, Berlin (2004)
Sharma, V., Hellstrand, F.: Framework for multi-protocol label switching (MPLS)-based recovery. RFC 3469, IETF (2003). URL: http://www.ietf.org/rfc/rfc3469.txt
Srivatsa, M., Liu, L.: Vulnerabilities and security threats in structured overlay networks: a quantitative analysis. In: ACSAC ’04: Proceedings of 20th Annual Computer Security Applications Conference, pp. 252–261. IEEE Computer Society, USA (2004). doi: http://dx.doi.org/10.1109/CSAC.2004.50
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. IEEE/ACM Trans. Netw. 11(1), 17–32 (2003)
Stutzbach, D., Rejaie, R.: Understanding churn in peer-to-peer networks. In: IMC ’06: Proceedings of 6th ACM SIGCOMM Conference on Internet Measurement, pp. 189–202. ACM, New York (2006). doi: http://doi.acm.org/10.1145/1177080.1177105
Zhang, H., Goel, A., Govindan, R.: Incrementally improving lookup latency in distributed hash table systems. In: Proceedings of 2003 ACM SIGMETRICS International Conference Measurement and Modeling of Computer Systems, pp. 114–125. ACM, New York (2003). doi: http://doi.acm.org/10.1145/781027.781042
Zhao, B.Y., Huang, L., Stribling, J., Joseph, A.D., Kubiatowicz, J.D.: Exploiting routing redundancy via structured peer-to-peer overlays. In: ICNP ’03: Proceedings of 11th IEEE International Conference on Network Protocols, pp. 246–257 (2003)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Korzun, D., Gurtov, A. (2013). Cyclic Routing. In: Structured Peer-to-Peer Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-5483-0_8
Download citation
DOI: https://doi.org/10.1007/978-1-4614-5483-0_8
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-5482-3
Online ISBN: 978-1-4614-5483-0
eBook Packages: Computer ScienceComputer Science (R0)