Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2016 | 26 | 3 | 707-719
Tytuł artykułu

A scheme of resource allocation and stability for peer-to-peer file-sharing networks

Treść / Zawartość
Warianty tytułu
Języki publikacji
Peer-to-peer (P2P) networks offer a cost-effective and easily deployable framework for sharing content. However, P2P file-sharing applications face a fundamental problem of unfairness. Pricing is regarded as an effective way to provide incentives to peers to cooperate. In this paper we propose a pricing scheme to achieve reasonable resource allocation in P2P file-sharing networks, and give an interpretation for the utility maximization problem and its sub-problems from an economic point of view. We also deduce the exact expression of optimal resource allocation for each peer, and confirm it with both simulation and optimization software. In order to realize the optimum in a decentralized architecture, we present a novel price-based algorithm and discuss its stability based on Lyapunov stability theory. Simulation results confirm that the proposed algorithm can attain an optimum within reasonable convergence times.
Opis fizyczny
  • School of Economics and Management, Yanshan University, Qinhuangdao 066004, China
  • School of Economics and Management, Yanshan University, Qinhuangdao 066004, China
  • School of Economics and Management, Yanshan University, Qinhuangdao 066004, China
  • Liren College, Yanshan University, Qinhuangdao 066004, China
  • School of Economics and Management, Yanshan University, Qinhuangdao 066004, China
  • Liren College, Yanshan University, Qinhuangdao 066004, China
  • Analoui, M. and Rezvani, M. (2011). Microeconomics-based resource allocation in overlay networks by using non-strategic behavior modeling, Communications in Nonlinear Science and Numerical Simulation 16(1): 493-508.
  • Bertsekas, D. (2003). Nonlinear Programming, Athena Scientific, Belmont, MA.
  • Boyce, W.E. and DiPrima, R.C. (2005). Elementary Differential Equations and Boundary Value Problems, John Wiley & Sons, Hoboken, NJ.
  • Chen, G., Hu, T., Jiang, D., Lu, P., Tan, K.-L., Vo, H. and Wu, S. (2014). Bestpeer++: A peer-to-peer based large-scale data processing platform, IEEE Transactions on Knowledge and Data Engineering 26(6): 1316-1331.
  • Chiang, M., Low, S., Calderbank, A. and Doyle, J. (2007). Layering as optimization decomposition: A mathematical theory of network architectures, Proceedings of the IEEE 95(1): 255-312.
  • Chmaj, G., Walkowiak, K., Tarnawski, M. and Kucharzak, M. (2012). Heuristic algorithms for optimization of task allocation and result distribution in peer-to-peer computing systems, International Journal of Applied Mathematics and Computer Science 22(3): 733-748, DOI: 10.2478/v10006-012-0055-0.
  • Eger, K. and Killat, U. (2007). Fair resource allocation in peer-to-peer networks (extended version), Computer Communications 30(16): 3046-3054.
  • Iosifidis, G. and Koutsopoulos, I. (2010). Double auction mechanisms for resource allocation in autonomous networks, IEEE Journal on Selected Areas in Communications 28(1): 95-102.
  • Kang, X. and Wu, Y. (2015). Incentive mechanism design for heterogeneous peer-to-peer networks: A Stackelberg game approach, IEEE Transactions on Mobile Computing 14(5): 1018-1030.
  • Koutsopoulos, I. and Iosifidis, G. (2010). A framework for distributed bandwidth allocation in peer-to-peer networks, Performance Evaluation 67(4): 285-298.
  • Kumar, C., Altinkemer, K. and De, P. (2011). A mechanism for pricing and resource allocation in peer-to-peer networks, Electronic Commerce Research and Applications 10(1): 26-37.
  • Li, S. and Sun, W. (2016). A mechanism for resource pricing and fairness in peer-to-peer networks, Electronic Commerce Research, DOI: 10.1007/s10660-016-9211-1.
  • Li, S., Sun, W. and Hua, C. (2014). Fair resource allocation and stability for communication networks with multipath routing, International Journal of Systems Science 45(11): 2342-2353.
  • Li, S., Sun, W. and Tian, N. (2015). Resource allocation for multi-class services in multipath networks, Performance Evaluation 92(1): 1-23.
  • Li, Y., Gruenbacher, D. and Scoglio, C. (2012). Evaluating stranger policies in P2P file-sharing systems with reciprocity mechanisms, Computer Networks 56(4): 1470-1485.
  • Li, Z. and Liao, Q. (2014). Network pricing: Can both ISP and P2P benefit?, International Journal of Network Management 24(6): 433-449.
  • Lin, F., Zhou, X., Lv, X. and Song, W. (2015). Novel pre-pushing scheme for peer-assisted streaming network based on multi-leader multi-follower Stackelberg model, Wireless Personal Communications 80(1): 289-301.
  • Lin, P., Chung, P.-C. and Fang, Y. (2014). P2P-ISN: A peer-to-peer architecture for heterogeneous social networks, IEEE Network 28(1): 56-64.
  • Meng, X. and Li, T. (2013). A dynamic load balancing scheme with incentive mechanism in heterogeneous structured P2P networks, Computers and Electrical Engineering 39(7): 2124-2134.
  • Nakano, T. and Okaie, Y. (2010). Cooperative resource pricing in service overlay networks for mobile agents, IEICE Transactions on Communications E93-B(7): 1927-1930.
  • Neely, M. and Golubchik, L. (2011). Utility optimization for dynamic peer-to-peer networks with tit-for-tat constraints, Proceedings of the IEEE International Conference on Computer Communications, INFOCOM'11, Shanghai, China, pp. 1458-1466.
  • Nishida, H. and Nguyen, T. (2010). A global contribution approach to maintain fairness in P2P networks, IEEE Transactions on Parallel and Distributed Systems 21(6): 812-826.
  • Okaie, Y. and Nakano, T. (2012). Network formation games in non-cooperative service overlay networks, Computer Systems Science and Engineering 27(1): 41-49.
  • Park, J. and Van Der Schaar, M. (2010). Pricing and incentives in peer-to-peer networks, Proceedings of the IEEE International Conference on Computer Communications, INFOCOM'10, San Diego, CA, USA, pp. 1-9.
  • Qureshi, B., Min, G. and Kouvatsos, D. (2012). A distributed reputation and trust management scheme for mobile peer-to-peer networks, Computer Communications 35(5): 608-618.
  • Rho, S., Chang, H., Kim, S. and Lee, Y. (2014). An efficient peer-to-peer and distributed scheduling for cloud and grid computing, Peer-to-Peer Networking and Applications 8(5): 863-871.
  • Satsiou, A. and Tassiulas, L. (2010). Reputation-based resource allocation in P2P systems of rational users, IEEE Transactions on Parallel and Distributed Systems 21(4): 466-479.
  • Shakkottai, S. and Srikant, R. (2007). Network optimization and control, Foundations and Trends in Networking 2(3): 271-379.
  • Song, F., Huang, D., Zhou, H., Zhang, H. and You, I. (2014). An optimization-based scheme for efficient virtual machine placement, International Journal of Parallel Programming 42(5): 853-872.
  • Song, F., Li, R. and Zhou, H. (2015a). Feasibility and issues for establishing network-based carpooling scheme, Pervasive and Mobile Computing 24(1): 4-15.
  • Song, F., Zhang, Y., An, Z., Zhou, H. and You, I. (2015b). The correlation study for parameters in four tuples, International Journal of Ad Hoc and Ubiquitous Computing 19(1): 38-49.
  • Tseng, Y.-M. and Chen, F.-G. (2011). A free-rider aware reputation system for peer-to-peer file-sharing networks, Expert Systems with Applications 38(3): 2432-2440.
  • Zghaibeh, M. and Harmantzis, F. (2008). A lottery-based pricing scheme for peer-to-peer networks, Telecommunication Systems 37(4): 217-230.
  • Zhang, K. and Antonopoulos, N. (2013). A novel bartering exchange ring based incentive mechanism for peer-to-peer systems, Future Generation Computer Systems 29(1): 361-369.
  • Zhang, Z., Chen, S., Mo, Z. and Yoon, M. (2012). An efficient incentive scheme with a distributed authority infrastructure in peer-to-peer networks, Journal of Parallel and Distributed Computing 72(12): 1741-1752.
  • Zuo, F. and Zhang, W. (2013). An auction based distribute mechanism for P2P adaptive bandwidth allocation, IEICE Transactions on Information and Systems (12): 2704-2712.
Typ dokumentu
Identyfikator YADDA
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.