By Topic

Auto-adaptive distributed hash tables

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

1 Author(s)
Dury, A. ; Centre de Recherche en Informatique de Montreal, Que., Canada

In this paper we propose a new distributed hash table model called auto-adaptive distributed hash table (AA-DHT). This model uses a distributed profiling of the nodes of the DHT to dynamically adapt the size of the index tables in order to reduce both the message cost and the request latency. This work is an evolution of the architecture for a P2P computing model described by Dury (2004), We detail the auto-adaptive model, the protocols we implemented and tested and we give experimental results of the architecture in simulated networks of up to 640 nodes.

Published in:

Grid Computing, 2005. The 6th IEEE/ACM International Workshop on

Date of Conference:

13-14 Nov. 2005