The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2010 vol.21)
pp: 812-826
Hiroshi Nishida , Oregon State University, Corvallis
Thinh Nguyen , Oregon State University, Corvallis
ABSTRACT
For many P2P systems, implementing right incentives and policies to promote efficient and fair resource sharing is the key to improve the overall system performance. In this paper, we propose a points-based incentive mechanism named Global Contribution (GC) approach that efficiently and naturally maintains fairness in a P2P network. In this approach, a proposed GC algorithm first calculates a global score for each peer that accurately reflects its bandwidth contribution to the entire network. Then, these scores are used in a proposed data transfer policy to determine whether one peer can download data from other peers. Thus, the GC approach achieves: 1) efficiently preventing free-riding, 2) naturally balancing the upload and download amounts in each peer, and 3) reducing rejections in transactions between cooperative peers. Moreover, the GC algorithm requires only private transaction history as an input and can be fully decentralized. Also, its time complexities are approximately O(N^2) in a centralized system and O(N) per peer in a decentralized system.
INDEX TERMS
P2P, free-riding, global contribution, fairness, distributed systems.
CITATION
Hiroshi Nishida, Thinh Nguyen, "A Global Contribution Approach to Maintain Fairness in P2P Networks", IEEE Transactions on Parallel & Distributed Systems, vol.21, no. 6, pp. 812-826, June 2010, doi:10.1109/TPDS.2009.122
REFERENCES
[1] K.G. Anagnostakis, F. Harmantzis, S. Ioannidis, and M. Zghaibeh, "On the Impact of Practical P2P Incentive Mechanism on User Behavior," NET Institute Working Paper No. 06-14, Sept. 2006.
[2] J.M. Bahi, S. Contassot-Vivier, and R. Couurier, Parallel Iterative Algorithms. Chapman & Hall/CRC, 2007.
[3] G.M. Baudet, "Asynchronous Iterative Methods for Multiprocessors," J. ACM, vol. 25, no. 2, pp. 226-244, 1978.
[4] D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Athena Scientific, 1997.
[5] A.R. Bharambe, C. Herley, and V.N. Padmanabhan, "Analyzing and Improving BitTorrent Performance," Technical Report MSR-TR-2005-03, Microsoft Research, Microsoft Corporation, 2005.
[6] C. Buragohain, D. Agrawal, and S. Suri, "A Game-Theoretic Framework for Incentives in P2P Systems," Proc. Third Int'l Conf. Peer-to-Peer Computing, pp. 48-56, Sept. 2003.
[7] D. Chazan and W. Miranker, "Chaotic Relaxation," Linear Algebra and its Applications, vol. 2, pp. 199-222, 1969.
[8] K. Eger and U. Killat, "Fair Resource Allocation in Peer-to-Peer Networks (Extended Version)," Computer Comm., vol. 30, no. 16, pp. 3046-3054, Nov. 2007.
[9] M. Feldman and J. Chuang, "Overcoming Free-Riding Behavior in Peer-to-Peer Systems," ACM SIGecom Exchanges, vol. 5, no. 4, pp. 41-50, July 2005.
[10] M. Feldman, K. Lai, I. Stoica, and J. Chuang, "Robust Incentive Techniques for Peer-to-Peer Networks," Proc. Fifth ACM Conf. Electronic Commerce, pp. 102-111, May 2004.
[11] M. Feldman, C. Papadimitriou, J. Chuang, and I. Stoica, "Free-Riding and Whitewashing in Peer-to-Peer Systems," Proc. ACM SIGCOMM Workshop Practice and Theory of Incentives in Networked Systems, pp. 228-236, 2004.
[12] P. Garbacki and D.H.J. Epema, "An Amortized Tit-For-Tat Protocol for Exchanging Bandwidth Instead of Content in P2P Networks," Proc. First Int'l Conf. Self-Adaptive and Self-Organizing Systems, pp. 119-228, 2007.
[13] P. Golle, K. Leyton-Brown, and I. Mironov, "Incentives for Sharing in Peer-to-Peer Networks," Proc. Third ACM Conf. Electronic Commerce, pp. 75-78, 2001.
[14] A. Habib and J. Chuang, "Incentive Mechanism for Peer-to-Peer Media Streaming," Proc. 12th IEEE Int'l Workshop Quality of Service (IWQOS '04), pp. 171-180, 2004.
[15] S.D. Kamvar, M.T. Schlosser, and H. Garcia-Molina, "The EigenTrust Algorithm for Reputation Management in P2P Networks," Proc. 12th Int'l World Wide Web Conf., 2003.
[16] K. Lai, M. Feldman, I. Stoica, and J. Chuang, "Incentives for Cooperation in Peer-to-Peer Networks," Proc. Workshop Economics of Peer-to-Peer Systems, June 2003.
[17] Q. Lian, Y. Peng, M. Yang, Z. Zhang, Y. Dai, and X. Li, "Robust Incentives via Multi-Level Tit-for-Tat," Concurrency and Computation: Practice & Experience, vol. 20, pp. 167-178, 2008.
[18] J.J.D. Mol, J.A. Pouwelse, D.H.J. Epema, and H.J. Sips, "Free-Riding, Fairness, and Firewalls in P2P File-Sharing," Proc. Eighth Int'l Conf. Peer-to-Peer Computing, pp. 301-310, Sept. 2008.
[19] J.J.D. Mol, J.A. Pouwelse, D.H.J. Epema, and H.J. Sips, "Give-to-Get: Free-Riding Resilient Video-on-Demand in P2P Systems," Proc. Multimedia Computing and Networking, pp. 681804-1-681804-8, 2008.
[20] T. Ngan, D.S. Wallach, and P. Druschel, "Enforcing Fair Sharing of Peer-to-Peer Resources," Proc. Peer-to-Peer Systems II, pp. 149-159, Oct. 2003.
[21] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," Proc. Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm., pp. 161-172, Aug. 2001.
[22] A. Roczniak, A.E. Saddik, and P. Levy, "INCA: Qualitative Reference Framework for Incentive Mechanisms in P2P Networks," Int'l J. Computer Applications in Technology, vol. 29, no. 1, pp. 71-80, 2007.
[23] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, "A Scalable Peer-to-Peer Lookup Service for Internet," Proc. ACM SIGCOMM, pp. 149-160, Aug. 2001.
[24] P. Tseng, "Convergence of Asynchronous Matrix Iterations Subject to Diagonal Dominance," LIDS technical reports, Laboratory for Information and Decision Systems, Mass. Inst. of Tech nology, 1988.
[25] L. Page, S. Brin, R. Motwani, and T. Winograd, "The PageRank Citation Ranking: Bringing Order to the Web," Stanford Digital Library Technologies Project, 1998.
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool