By Topic

A Framework for supporting consistent lookup in Distributed Hash Table

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
$31 $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)
Aung, A.M. ; Univ. of Comput. Studies, Yangon, Myanmar ; Pwint, M.

There are many structured P2P systems that use Distributed Hash Table (DHT) to map data items onto the nodes in various ways for scalable routing and location. DHT are algorithms used in modern peer-to-peer applications, which provides a reliable, scalable and efficient way to manage peer-to-peer networks. As a fundamental problem in DHT based P2P system, the efficient location of the node that stores a desired data item, performance and consistent lookup are important to avoid performance degradation and guarantee system fairness. This paper presents a structural prevention strategy to remove inconsistent lookups on the basic that inconsistent lookup is generated by inconsistent routing tables. The algorithms keep the routing tables consistent with the state of the nodes in DHT and maintain a ring structure guaranteeing consistent lookup results in the presence of node joins and leaves. The goal is to be able to trust a lookup result to give the actual state of the DHT.

Published in:

Computer Design and Applications (ICCDA), 2010 International Conference on  (Volume:5 )

Date of Conference:

25-27 June 2010