A novel lookup and routing protocol based on CAN for structured P2P network

摘要

Distributed Hash Tables (DHTs) have emerged as the most popular scheme in the P2P network, which have drastically changed the way we share resources and gather information. In order to solve the problem of search flexibility In DHT, an improved lookup and routing protocol based on Content Addressable Networks (CANs) is proposed, which not only preserves CANs' simplicity, but also achieves a resilient and efficient greedy DHT routing algorithm. Furthermore, a binary partition tree algorithm is designed to estimate the underlying network topology. Simulation results shows that the proposed approach can gain better performance compared with the traditional CAN method.