Popularity-Based Content Replication in Peer-to-Peer Networks

  • Yohei Kawasaki
  • Noriko Matsumoto
  • Norihiko Yoshida
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3994)


Pure peer-to-peer (P2P) networks is widely used, however they broadcast query packets, and cause excessive network traffic in particular. Addressing this issue, we propose a new strategy for content replication which prioritizes popular and attracting contents. Our strategy is based on replication adjustment, being cooperated with index caching, as well as LRU-based content replacement, and a more effective replica placement method than well-known probabilistic ones. We also present some experiment results to show that our strategy is better than other ones in regards to network traffic and storage consumption.


Distribute Hash Table Search Path Replica Placement Content Popularity Query Packet 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Napster website,
  2. 2.
    Gnutella website,
  3. 3.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proc. ACM SIGCOMM 2001 (2001)Google Scholar
  4. 4.
    Cohen, E., Shenker, S.: Replication Strategies in Unstructured Peer-to-Peer Networks. In: Proc. ACM SIGCOMM 2002 (2002)Google Scholar
  5. 5.
    Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstrctured Peer-to-Peer Networks. In: Proc. 16th ACM Int’l. Conf. on Supercomputing (2002)Google Scholar
  6. 6.
    Maruta, D., Yamamoto, H., Oie, Y.: Replication Strategies to Enable Storage Load Balancing in P2P Networks. IEICE Technical Report, NS2003-319, 131–136 (2004) (in Japanese)Google Scholar
  7. 7.
    Sato, S., Kazama, K., Shimizu, S.: (in Japanese)
  8. 8.
    Adamic, L.A., Lukose, R.M., Puniyani, A.R., Huberman, B.A.: Search in Power-Law Networks. Physical Review E 64, 46135–46143 (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yohei Kawasaki
    • 1
  • Noriko Matsumoto
    • 1
  • Norihiko Yoshida
    • 1
  1. 1.Department of Information and Computer SciencesSaitama UniversitySaitamaJapan

Personalised recommendations