Biased contribution index: a new faster convergent index to maintain the fairness in peer-to-peer networks

Biased contribution index: a new faster convergent index to maintain the fairness in peer-to-peer networks

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The free-riding and large difference between upload and download amount of resources is a fundamental problem in a peer-to-peer network. An incentive mechanism, which can be implemented in a distributed fashion, can solve this problem. Global contribution (GC) approach is one such mechanism, but its speed of convergence is slow. This letter proposes a new index named biased contribution index (BCI). It is proved that BCI always converges at a certain value. Simulation results show that it converges faster than the GC.


    1. 1)
    2. 2)
      • 2. Feldman, M., Lai, K., Stoica, I., et al: ‘Robust incentive techniques for peer-to-peer networks’. Proc. Fifth ACM Conf. Electronic Commerce, New York, NY, USA, May 2004, pp. 102111.
    3. 3)
      • 3. Garbacki, P., Epema, D.H.J.: ‘An amortized tit-for-tat protocol for exchanging bandwidth instead of content in P2P networks’. First Int. Conf. Self-Adaptive and Self-Organizing Systems, Cambridge, MA, USA, July 2007, pp. 119228.
    4. 4)
    5. 5)
      • 5. Mol, J.J.D., Pouwelse, J.A., Epema, D.H.J., et al: ‘Give-to-get: free-riding resilient video-on-demand in P2P systems’. Proc. Multimedia Computing and Networking, San Jose, CA, USA, January 2008, pp. 6818041–681804–8.
    6. 6)
    7. 7)
      • 7. Seneta, E.: ‘Non-negative matrices and markov chains’ (Springer-Verlag, New York, 1981, 2nd edn.).
    8. 8)
      • 8. Awasthi, S.K., Singh, Y.N.: ‘Absolute trust: algorithm for aggregation of trust in peer-to-peer network’. Available at:
    9. 9)
      • 9. Serre, D.: ‘Matrices theory and applications’ (Springer-Verlag, New York, NY, USA, 2002).

Related content

This is a required field
Please enter a valid email address