By Topic

Performance analysis of look strategies of DHT in NATed environment

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)
Cheng Yin-bo ; Sch. of Inf. & Commun. Eng., Beijing Univ. of Posts & Telecommun., Beijing, China ; Wen Xiang-ming

Network address translation (NAT) causes well-known difficulties for distributed hash table (DHT) application, which needs end-to-end communication. This paper focuses on the impact of NAT on the lookup performance of DHT. The evaluation models considering the impact of NATs are presented for the performances of three representative lookup strategies (symmetric recursive routing, semi-recursive routing and iterative routing). Based on the evaluation models, the performances of these lookup strategies are compared under different conditions. Analysis results show that symmetric recursive routing can outperform the other two lookup strategies in NATed environment.

Published in:

Computational Intelligence and Industrial Applications, 2009. PACIIA 2009. Asia-Pacific Conference on  (Volume:2 )

Date of Conference:

28-29 Nov. 2009