Probabilistic Replication Based on Access Frequencies in Unstructured Peer-to-Peer Networks

  • Takahiro Hara
  • Yuki Kido
  • Shojiro Nishio
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4080)


Recently, there has been increasing interest in research on data sharing through peer-to-peer networks. In this paper, assuming a data-sharing service, we propose a new replication strategy that achieves not only load balancing but also improvement of search performance. The proposed strategy creates replicas at each peer on the path along which a query is successfully forwarded, depending on the peer’s rank of access frequency to the data. Moreover, we verify the effectiveness of the proposed strategy by simulation experiments.


Data Item Success Ratio Average Path Length Replication Strategy Query Rate 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adamic, L.A., Lukose, R.M., Puniyani, A.R., Huberman, B.A.: Search in Power-Law Networks. Physical Review E 64(4), 46135–46143 (2001)CrossRefGoogle Scholar
  2. 2.
    Bu, T., Towsley, D.: On Distinguishing Between Internet Power Law Topology Generators. In: Proc. INFOCOM 2002 (2002)Google Scholar
  3. 3.
    Cohen, E., Shenker, S.: Replication Strategies in Unstructured Peer-to-Peer Networks. In: Proc. SIGCOMM 2002, pp. 177–190 (2002)Google Scholar
  4. 4.
    Cuenca-Acuna, F.M., Martin, R.P., Nguyen, T.D.: Autonomous Replication for High Availability in Unstructured P2P Systems. In: Proc. SRDS 2003, pp. 99–108 (2003)Google Scholar
  5. 5.
    Datta, A., Hauswirth, M., Aberer, K.: Updates in Highly Unreliable, Replicated Peer-to-Peer Systems. In: Proc. ICDCS 2003, pp. 76–85 (2003)Google Scholar
  6. 6.
  7. 7.
  8. 8.
  9. 9.
    Keyani, P., Larson, B., Senthil, M.: Peer Pressure: Distributed Recovery from Attacks in Peer-to-Peer Systems. In: Proc. Networking Workshop 2002, pp. 306–320 (2002)Google Scholar
  10. 10.
    Kleinberg, J.: The Small-World Phenomenon: An Algorithm Perspective. In: Proc. STOC 2000, pp. 163–170 (2000)Google Scholar
  11. 11.
    Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proc. ICS 2002, pp. 84–95 (2002)Google Scholar
  12. 12.
    On, G., Schmitt, J., Steinmetz, R.: The Effectiveness of Realistic Replication Strategies on Quality of Availability for Peer-to-Peer Systems. In: Prop. P2P 2003, pp. 57–65 (2003)Google Scholar
  13. 13.
    Maymounkov, P., Mazières, D.: Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53–65. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  14. 14.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R.: A Scalable Content-Addressable Network. In: Proc. SIGCOMM 2001, pp. 161–171 (2001)Google Scholar
  15. 15.
    Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  16. 16.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proc. SIGCOMM 2001, pp. 149–160 (2001)Google Scholar
  17. 17.
    Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An Infrastructure for Wide-area Fault-tolerant Location and Routing. In: Proc. SIGCOMM 2001, pp. 161–170 (2001)Google Scholar
  18. 18.
    Zipf, G.K.: Human Behavior and the Principle of Least Effort. Addison-Wesley, Reading (1949)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Takahiro Hara
    • 1
  • Yuki Kido
    • 1
  • Shojiro Nishio
    • 1
  1. 1.Graduate School of Information Science and Tech.Osaka University 

Personalised recommendations