Skip to main content

A Fair Utility Function for Incentive Mechanism against Free-Riding in Peer-to-Peer Networks

  • Conference paper
Next Generation Teletraffic and Wired/Wireless Advanced Networking (NEW2AN 2008)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 5174))

Included in the following conference series:

Abstract

There are two problems, unfair and too strict, with the utility function of the proposed incentive mechanisms for restraining the free-riding in peer-to-peer (P2P) networks. This paper is devoted to establish a new fair utility function to solve those problems. We absorb both the absolute contribution value and the physical performance of peers in our utility function and the absolute contribution value is divided into supply value and profit value. Besides, we take the time the user is in the system as a factor of a peer’s utility. The mathematical modeling, Analytic Hierarchy Process (AHP), is used in this paper to construct the function. The simulations compare the fair utility function with the proposed three functions and the results verify that this function is effective to solve those two problems.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Stephanos, A., Diomidis, S.: A Survey of Peer-to-Peer Content Distribution Technologies. ACM Computing Surveys 36(4), 335–371 (2004)

    Article  Google Scholar 

  2. Adar, E., Huberman, B.: Free Riding on Gnutella. First Monday 5(10), 134–139 (2000)

    Google Scholar 

  3. Karakaya, M., Korpeouglu, I., Ulusoy, O.: A distributed and measurement based framework against free riding in Peer-to-Peer networks. In: 4th International Conference on Peer-to-Peer Computing Zurich, pp. 276–277 (2004)

    Google Scholar 

  4. Yijiao, Y., Hai, J.: A Survey on Overcoming Free Riding in Peer-to-Peer Networks. Chinese Journal of Computers 31(1), 1–15 (2008)

    Google Scholar 

  5. Ramaswamy, L., Ling, L.: Free Riding: A New Challenge to Peer-to-Peer File Sharing Systems. In: 36th Annual Hawaii International Conference on System Sciences (HICSS-36 2003), pp. 220–229. IEEE Computer Society, Big Island (2003)

    Chapter  Google Scholar 

  6. Anceaume, E., Gradinariu, M., Ravoajia, A.: Incentive for P2P fair resource sharing. In: 5th IEEE International Conference on Peer-to-Peer Computing, Konstanz, pp. 253–260 (2005)

    Google Scholar 

  7. Ahsan, H., John, C.: An Incentive Mechanism for Peer-to-Peer Media Streaming. In: International Workshop on Quality of Service (IWQoS), Montreal, pp. 171–180 (2004)

    Google Scholar 

  8. Ma, R.T.B., Lee, S.C.M., Lui, J.C.S.: A Game Theoretic Approach to Provide Incentive and Service Differentiation in P2P Networks. In: ACM SIGMETRICS/Performance 2004, New York, pp. 189–198 (2004)

    Google Scholar 

  9. Figueiredo, D., Shapiro, J., Towsley, D.: Incentives to Promote Availability in Peer-to-Peer Anonymity Systems. In: 13th IEEE International Conference on Network Protocols (ICNP 2005), pp. 110–121. IEEE Computer Society, Boston (2005)

    Chapter  Google Scholar 

  10. Saaty, T.L.: The Analytic Hierarchy Process. McGraw Hill Company, New York (1980)

    MATH  Google Scholar 

  11. Yuhua, L., Chun, Y., Liansheng, T., Shaohua, T.: A Generalized B-A Model for the Recognition of Intermediate Vertex Effect. Dynamics of Continuous, Discrete and Impulsive Systems (DCDIS), Series B. 14(S7), 23-27 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Sergey Balandin Dmitri Moltchanov Yevgeni Koucheryavy

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, Y., Yang, C., Xu, K., Chen, H. (2008). A Fair Utility Function for Incentive Mechanism against Free-Riding in Peer-to-Peer Networks. In: Balandin, S., Moltchanov, D., Koucheryavy, Y. (eds) Next Generation Teletraffic and Wired/Wireless Advanced Networking. NEW2AN 2008. Lecture Notes in Computer Science, vol 5174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85500-2_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85500-2_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85499-9

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics