Skip to main content

A Prediction-Based Fair Replication Algorithm in Structured P2P Systems

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4610))

Abstract

Highly skewed query distribution in structured Peer-to-Peer system may cause huge amount of dropped queries and consequently lead to poor system performance. This paper describes a Prediction-based Fair Replication Algorithm (PFR), which aims to maintain excellent system performance when the query is highly skewed. For the purpose of fairly distributing load onto each node, nodes that host hot items always shed load onto light-loaded nodes by creating replicas along the query path. Through the use of a simple prediction method, we can foresee traffic surge and replicate beforehand. Consequently, the number of dropped queries will decrease. Further more, each node can fairly decide the load redistribution speed for itself merely based on local information. The experimental evaluation demonstrates the effectiveness of our approach, which can simultaneously reduce the number of dropped queries as well as the number of created replicas without introducing unaffordable overhead.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gnutella. http://www.gnutella.com/

  2. Clarke, I., Sandberg, O., Wiley, B., et al.: Freenet: A distributed anonymous information storage and retrieval system. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 46–66. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Stoica, I., Morris, R., Karger, D., et al.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proc. of ACM SIGCOMM 2001, pp. 149–160. ACM Press, New York (2001)

    Google Scholar 

  4. Ratnasamy, S., Francis, P., Handley, M., et al.: A Scalable Content-Addressable Network. In: Proc. of ACM SIGCOMM 2001, pp. 161–172. ACM Press, New York (2001)

    Google Scholar 

  5. Rowstron, A., Druschel, P.: Pastry: Scalable, Distributed 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)

    Chapter  Google Scholar 

  6. Gopalakrishnan, V., Silaghi, B., Bhattacharjee, B.: Adaptive replication in peer-to-peer systems. In: Proc. of 24th ICDCS, pp. 360–369. IEEE Computer Society, Japan (2004)

    Google Scholar 

  7. Dabek, F., Kaashoek, M.F., Karger, D., et al.: Wide-area cooperative storage with CFS. In: Proc. of the 18th SOSP, pp. 202–215. ACM Press, Banff (2001)

    Google Scholar 

  8. Gupta, A., Dinda, P., Bustamante, F.E.: Distributed popularity indices. In: Proc. of the annual conference of the Special Interest Group on Data Communication, ACM Press, Philadelphia (2005)

    Google Scholar 

  9. Felber, P., Kaldewey, T., Weiss, S.: Proactive Hot Spot Avoidance for Web Server Dependability. In: Proc. of 23rd IEEE Symposium on Reliable Distributed Systems, pp. 309–318. IEEE Computer Society, Switzerland (2004)

    Chapter  Google Scholar 

  10. Zhao, W., Schulzrinne, H.: DotSlash: Handling Web Hotspots at Dynamic Content Web Sites. In: Proc. of 24th INFCOM, vol. 4, pp. 2836–2840. IEEE Computer Society, Florida (2005)

    Google Scholar 

  11. Adler, S.: The Slashdot effect: An analysis of three Internet publications (2000), http://ssadler.phy.bnl.gov/adler/SDE/SlashDotEffect.html

  12. http://www.pdos.lcs.mit.edu/chord (2001)

  13. Lv, Q., Cao, P., Cohen, E., et al.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proc. of 16th ACM International Conference on Supercomputing, vol. 30, p. 258. ACM Press, New York (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bin Xiao Laurence T. Yang Jianhua Ma Christian Muller-Schloer Yu Hua

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhu, X., Zhang, D., Li, W., Huang, K. (2007). A Prediction-Based Fair Replication Algorithm in Structured P2P Systems. In: Xiao, B., Yang, L.T., Ma, J., Muller-Schloer, C., Hua, Y. (eds) Autonomic and Trusted Computing. ATC 2007. Lecture Notes in Computer Science, vol 4610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73547-2_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73547-2_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73546-5

  • Online ISBN: 978-3-540-73547-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics