Efficient Content Location of Content Addressable Network
QI Qing-hu · Journal of Circuits and Systems · 2004
A fundamental problem that confronts P2P (Peer-to-Peer) application is to efficiently locate the node that stores a particular data item. In order to solve the problem, an efficient content location method using fast link and minimum distance is proposed in this paper. At the beginning, basic architecture and the principle of CAN are introduced, then above content location method is elucidated in detail. At last, results of simulation are given.