A Survey of Decentralized Lookup Algorithms in Peer-to-Peer Networks
XIA Qi 1,2 , WANG Wei-nong2, YANG Rui-jun 1,2 (1. Dept. of Computer Science and Eng., Shanghai Jiaotong Univ., Shanghai 200030, China; 2. Network and Information Center, Shanghai Jiaotong Univ., Shanghai 200030, China)
The paper divided the decentralized lookup algorithms in peer-to-peer networks into two classes: structured and unstructured. The lookup mechanisms, network topology and lookup efficiency of these two types of algorithms were compared. From the comparison, it is concluded that there exists tradeoff in lookup algorithms. For example, to improve the time efficiency, the algorithm has to increase the routing table size or network overhead. The paper can be a reference for the design of new lookup algorithms or application of peer-to-peer lookup algorithms in related areas such as Grid computing.
【CateGory Index】： TP393.02