Abstract
Nowadays, emerging Peer-to-Peer (P2P) network system has become a popular medium for people to share their resources such as files, services, computing, and etc. Resource search scheme is the core design of P2P network system. How to design an efficient and scalable search scheme is still an important issue on P2P network systems. The previous search schemes can be classified into two categories: flooding-based and routing-based. This thesis proposed an efficient routing-based search scheme that utilizes distributed hash table (DHT) mechanism to handle the storage of resource information. The overlay network is built on the binary tree topology, and we propose three kinds of routing-base search schemes including simple routing, regional routing, and fast routing on this tree topology. Fast routing can efficiently forward the query message to find physical resource location. Moreover, the message overhead is taken into account to save the network bandwidth.