An optimal algorithm to fetch DHT routable

During recent years, distributed hash tables (DHTs) have been a hot topic in P2P community. 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. A splitting tree like algorithm named as APQ (adaptive prefix query) has been developed to get node routable. We will show APQ is an optimal algorithm in sense of worst-case query numbers.