By Topic

Coordinate-based routing: Refining nodeIds in structured peer-to-peer systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fabian Hartmann ; BrandMaker GmbH, Haid-und-Neu-Straße 7, D-76131 Karlsruhe, Germany ; Bernhard Heep

Structured peer-to-peer systems-also known as key-based routing protocols-offer a base for a broad range of applications. In the past, different topology adaptation mechanisms for minimizing key-based routing latencies were proposed and deployed with several today's state-of-the-art protocols. In this paper we introduce coordinate-based routing (CBR), a topology adaptation method, that utilizes landmark-based network coordinate systems and a global a-priori knowledge of node distribution to preserve the uniform distribution of node identifiers. With CBR, a notable decrease of routing latencies in prefix-based KBR-protocols can be achieved, even in combination with other topology adaptation mechanisms enabled. Additionally, CBR allows for a location-based replication strategy in distributed storage applications, which supports the lookup of closer replicas with respect to proximity. Simulation results show a significant decrease of KBR routing latencies and twice as fast get()-operations in DHTs.

Published in:

2009 International Conference on Ultra Modern Telecommunications & Workshops

Date of Conference:

12-14 Oct. 2009