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

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