Chord#: Structured Overlay Network for Non-Uniform Load-Distribution

Please always quote using this URN: urn:nbn:de:0297-zib-8736
  • \newcommand{\chordsharp}{Chord$^\##$} Data lookup is a fundamental problem in peer-to-peer systems: Given a key, find the node that stores the associated object. Chord and other P2P algorithms use distributed hash tables (DHTs) to distribute the keys and nodes evenly across a logical ring. Using an efficient routing strategy, DHTs provide a routing performance of $O (\log N)$ in networks of $N$ nodes. While the routing performance has been shown to be optimal, the uniform key distribution makes it impossible for DHTs to support range queries. For range queries, consecutive keys must be stored on lo gically neighboring nodes. In this paper, we present an enhancement of Chord that eliminates the hash function while keeping the same routing performance. The resulting algorithm, named \chordsharp{}, provides a richer function ality while maintaining the same complexity. In addition to Chord, \chordsharp{} adapts to load imbalance.

Download full text files

Export metadata

  • Export Bibtex

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Thorsten Schütt, Florian Schintke, Alexander Reinefeld
Document Type:ZIB-Report
Tag:DHT ; P2P ; Range Queries
CCS-Classification:C. Computer Systems Organization / C.2 COMPUTER-COMMUNICATION NETWORKS / C.2.1 Network Architecture and Design
C. Computer Systems Organization / C.2 COMPUTER-COMMUNICATION NETWORKS / C.2.2 Network Protocols
Date of first Publication:2005/08/26
Series (Serial Number):ZIB-Report (05-40)

$Rev: 13581 $