By Topic

Adaptive Prefix Query (APQ) For Route Table Finding In Overnet

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)
Yong-xiang Zhao ; Sch. of Electron. & Inf. Eng., Beijing Jiaotong Univ. ; Chang-jia Chen

During recent years, distributed hash tables (DHTs) have been extensively studied by the networking community through simulation and analysis. Route table of each peer is the key component to ensure high performance and scalability for DHT network. Hence to measure peer's route table in real network is an important research topics for evaluation the performance and for understanding the structure of real network. How to find peer's route table in overnet is addressed in this paper. In this paper, the table finding problem is formally presented, a heuristic algorithm is proposed and an up bound on the number of queries needed in finding a table is proved. The algorithm and the up bound is discussed analytically and examined by simulation and real network measurement as well. Our studies show that our algorithm is correct and efficient, and our up bound is tight

Published in:

Computer and Computational Sciences, 2006. IMSCCS '06. First International Multi-Symposiums on  (Volume:2 )

Date of Conference:

20-24 June 2006