References

• 1. 1)
     • 9. Serre, D.: ‘Matrices theory and applications’ (Springer-Verlag, New York, NY, USA, 2002).
  2. 2)
     • 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. 681804–1–681804–8.
  3. 3)
     • 8. Awasthi, S.K., Singh, Y.N.: ‘Absolute trust: algorithm for aggregation of trust in peer-to-peer network’. Available at: http://arxiv.org/abs/1601.01419.
  4. 4)
     • 7. Seneta, E.: ‘Non-negative matrices and markov chains’ (Springer-Verlag, New York, 1981, 2nd edn.).
  5. 5)
     • 1. Nishida, H., Nguyen, T.: ‘A global contribution approach to maintain fairness in P2P networks’, Trans. Parallel Distrib. Syst., 2010, 21, (6), pp. 812–826 (doi: 10.1109/TPDS.2009.122).
  6. 6)
     • 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. 102–111.
  7. 7)
     • 4. Lian, Q., Peng, Y., Yang, M., et al: ‘Robust incentives via multi-level tit-for-tat’, Concurrency Comput. Pract. Exp., 2008, 20, pp. 167–178 (doi: 10.1002/cpe.1190).
  8. 8)
     • 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. 119–228.
  9. 9)
     • 6. Sherman, A., Nieh, J., Stein, C.: ‘Fairtorrent: a deficit-based distributed algorithm to ensure fairness in peer-to-peer systems’, IEEE/ACM Trans. Netw., 2012, 20, (5), pp. 1361–1374 (doi: 10.1109/TNET.2012.2185058).