Replication in Peer-to-Peer Systems

  • Mirko Knoll
  • Haitham Abbadi
  • Torben Weis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5343)


We present a replication algorithm for peer-to-peer networks that automatically adapts to an increase of requests. If some information is suddenly very popular, the algorithm distributes it in the peer-to-peer system and reduces the replicas when the demand decreases. The algorithm is totally self-organizing, i.e. it does not need any administration and is very resilient to node failures. Furthermore, our algorithm uses the concept of geographical proximity. Data is preferably replicated on peers which are geographically close. This is especially useful for location-based information, such as traffic information, tourist data and weather alerts.


Hash Function Distribute Hash Table Dynamic Replication Replication Scheme Request 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.
    Elson, J., Howell, J.: Handling flash crowds from your garage. In: USENIX Annual Technical Conference (2008)Google Scholar
  2. 2.
    Cohen, B.: Incentives build robustness in bittorrent. In: Proceedings of the First Workshop on the Economics of Peer-to-Peer Systems, Berkeley, CA, USA (2003)Google Scholar
  3. 3.
    Knoll, M., Weis, T.: A P2P-Framework for Context-based Information. In: 1st International Workshop on Requirements and Solutions for Pervasive Software Infrastructures (RSPSI) at Pervasive 2006, Dublin, Ireland (2006)Google Scholar
  4. 4.
    Porter, R., Shoham, Y.: Addressing the Free-Rider Roblem in File-Sharing Systems: A Mechanism-Design Approach. In: Proceedings of EC 2004, New York, USA (2004)Google Scholar
  5. 5.
    Milojicic, D.S., Kalogeraki, V., Lukose, R., Nagaraja, K., Pruyne, J., Richard, B., Rollins, S., Xu, Z.: Peer-to-Peer Computing. Technical Report HPL-2002-57, HP Laboratories Palo Alto (2002)Google Scholar
  6. 6.
    Homepage, T.S.: What is the slashdot effect? (2000)Google Scholar
  7. 7.
    Knoll, M., Weis, T.: Optimizing Locality for Self-organizing Context-Based Systems. In: de Meer, H., Sterbenz, J.P.G. (eds.) IWSOS 2006. LNCS, vol. 4124. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object loaction for routing for large-scale peer-to-peer systems. In: Proceedings IFIP/ACM Middleware 2001, Heidelberg, Germany (2001)Google Scholar
  9. 9.
    Sanjay Ghemawat, H.G., Leung, S.T.: The google filesystem. In: 19th ACM Symposium on Operating Systems Principles, Lake George, NY, USA (2003)Google Scholar
  10. 10.
    Xu, B., Ouksel, A., Wolfson, O.: Opportunistic resource exchange in inter-vehicle ad hoc networks. In: Proc. of the Fifth IEEE International Conference on Mobile Data Management (MDM), Berkeley, CA, USA, pp. 4–12 (2004)Google Scholar
  11. 11.
    Rijmen, V., Oswald, E.: Update on sha-1. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 58–71. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  12. 12.
    Androutsellis-Theotokis, S., Spinellis, D.: A survey of peer-to-peer content distribution technologies. ACM Comput. Surv. 36(4), 335–371 (2004)CrossRefGoogle Scholar
  13. 13.
    Kubiatowicz, J., Bindel, D., Chen, Y., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: OceanStore: An Architecture for Global-scale Persistent Storage. In: Proceedings of ACM ASPLOS. ACM, New York (2000)Google Scholar
  14. 14.
    Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, p. 46. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  15. 15.
    Chen, Y., Katz, R.H., Kubiatowicz, J.D.: Scan: A dynamic, scalable and efficient content distribution network. In: Mattern, F., Naghshineh, M. (eds.) PERVASIVE 2002. LNCS, vol. 2414, pp. 145–148. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  16. 16.
    Kan, G.: Gnutella. In: Oram, A. (ed.) Peer-to-Peer. Harnessing the Power of Disruptive Technologies, Sebastopol, CA, USA, pp. 94–122. O’Reilly, Sebastopol (2001)Google Scholar
  17. 17.
    Kirk, P.: The annotated gnutella protocol specification v0.4 (2003)Google Scholar
  18. 18.
    Saroiu, S., Gummadi, P.K., Gribble, S.D.: A measurement study of peer-to-peer file sharing systems. In: SPIE/ACM Conference on Multimedia Computing and Networking (MMCN) 2002, San Jose, CA, USA (2002)Google Scholar
  19. 19.
    Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: International Conference on Supercomputing (ICS 2002). ACM, New York (2002)Google Scholar
  20. 20.
    Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: a resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications 22(1), 41–53 (2004)CrossRefGoogle Scholar
  21. 21.
    Rhea, S., Eaton, P., Geels, D., Weatherspoon, H., Zhao, B., Kubiatowicz, J.: Pond: The oceanstore prototype. In: FAST 2003: Proceedings of the 2nd USENIX Conference on File and Storage Technologies, pp. 1–14. USENIX Association, Berkeley (2003)Google Scholar
  22. 22.
    Rowstron, A., Druschel, P.: Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. In: 18th ACM SOSP, Lake Louise, Alberta, Canada (2001)Google Scholar
  23. 23.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM 2001: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, San Diego, CA, USA, pp. 149–160. ACM Press, New York (2001)CrossRefGoogle Scholar
  24. 24.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), San Diego, CA, USA, pp. 161–172. ACM Press, New York (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Mirko Knoll
    • 1
  • Haitham Abbadi
    • 1
  • Torben Weis
    • 1
  1. 1.University of Duisburg-EssenDuisburgGermany

Personalised recommendations