Cyclic Routing: Generalizing Look-Ahead in Peer-to-Peer Networks

Free registration required

Executive Summary

Distributed Hash Tables (DHT) provides a lookup service in peer-to-peer overlay networks. Many valuable applications have been recently built on top of several available DHTs. However, they 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 paper, the authors propose a new method for DHT-based routing called cyclic routing. 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.

  • Format: PDF
  • Size: 396.28 KB