By Topic

IAC: Interest-Aware Caching for Unstructured P2P

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xucheng Luo ; Sch. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China ; Zhiguang Qin ; Ji Geng ; Jiaqing Luo

The simplicity and robustness of unstructured P2P system make it a preferable architecture for constructing real large scale file sharing system. Most of the existing paradigms require more overhead. The trace data analysis shows that the workloads among peers are correlated. The bigger the intersection of workloads, the higher the probability that they share other files is. By exploiting such principle, we propose IAC, an interest-aware resource advertisement caching paradigm for unstructured p2p system. Each peer advertises its resource list. If a peer is interested in the resource advertisement received, it then caches the advertisement. Through local cache search, usually the peer gets more than 50% success rate. If local cache search is failed, the random walk-based search is used. The simulations show that as to the same hit rate, the maintenance and search overheads are low and the search delay is very low.

Published in:

Semantics, Knowledge and Grid, 2006. SKG '06. Second International Conference on

Date of Conference:

1-3 Nov. 2006