A Content Searching Scheme Using Popularity and Link Degree of Nodes in Unstructured P2P Networks with Cache Routers

This paper improves the conventional scheme of contents sharing in unstructured P2P networks, where each of the peers and content cache routers keeps contents cache as well as query transmission records, which are used to guide content searching queries and reduce the number of the queries without losing contents discovery rates. In this paper, the decision whether a content item is cached or not on the router is executed as a part of the algorithm running in the contents sharing system according to the content item's popularity and the degree of the router as a network node, in order to reduce the frequency of contents loss caused by the displacement or overwriting of caches in the routers. The efficiency of the improvement is discussed using the results of computer simulations.