基于节点优先级服务的混合P2P网络性能分析
Performance Analysis of Hybrid P2P Networks Based on Node Priority Service
摘要: 本文为了抑制P2P网络中的“搭便车”现象，提高对等网络的服务质量，请求节点被分为高优先级请求节点和低优先级请求节点。提出了一种具有负顾客和异步休假策略的抢占优先M/M/c排队模型，通过拟生灭过程和矩阵几何解的方法求解系统的稳态分布。通过数值实验，分析系统性能指标随系统参数变化的趋势。最后构造两类请求节点的个人效益函数，结果表明高优先级请求节点的个人效益高于低优先级请求节点个人效益。
Abstract: In order to suppress the “free riding” phenomenon in P2P networks and improve the service quality of P2P networks, the requesting nodes are divided into high priority requesting nodes and low priority requesting nodes. A preemptive priority M/M/c queuing model with negative customers and asynchronous vacation strategy is proposed. The steady-state distribution of the system is solved by quasi birth-and-death process and matrix-geometric solution. Through numerical ex-periments, the change trend of system performance index with system parameters is analyzed. Finally, the personal expected return function of two types of request nodes is constructed. The results show that the personal expected income of high priority requesting nodes is higher than that of low priority requesting nodes.
文章引用：刘琳, 任子清. 基于节点优先级服务的混合P2P网络性能分析[J]. 应用数学进展, 2022, 11(3): 1150-1160. https://doi.org/10.12677/AAM.2022.113124

参考文献

[1] Oluwatope, A.O., Ojoolayiwola, O.E., Sossou, E.H., et al. (2020) Ayo Game Approach to Mitigate Free Riding in Peer-to-Peer Networks. Journal of King Saud University-Computer and Information Sciences. [Google Scholar] [CrossRef] 
[2] Handurukande, S.B., Kermarrec, A.M., Le Fessant, F., et al. (2006) Peer Sharing Behaviour in the eDonkey Network, and Implications for the Design of Server-less File Sharing Systems. AcmSigops Operating Systems Review, 40, 359-371. [Google Scholar] [CrossRef] 
[3] Adar, E. and Huberman, B.A. (2001) Free Riding on Gnutella. First Monday, 5, No. 10. [Google Scholar] [CrossRef] 
[4] Asvanund, A., Clay, K., Krishnan, R., et al. (2004) An Empirical Analysis of Network Externalities in Peer-to-Peer Music-Sharing Networks. Information Systems Research. [Google Scholar] [CrossRef] 
[5] Yahaya, M.O. (2015) Mitigating Free Riding in Peer-To-Peer Networks: Game Theory Approach. Nigerian Journal of Technology, 34, 375. [Google Scholar] [CrossRef] 
[6] Shahriar, I., Qiu, D. and Jaumard, B. (2017) Modeling of Free Riders in P2P Live Streaming Systems. International Conference on Computing, Networking and Communications (ICNC), Sili-con Valley, CA, 26-29 January 2017, 729-734. [Google Scholar] [CrossRef] 
[7] Shin, K., Joe-Wong, C., Ha, S., et al. (2017) T-Chain: A General Incentive Scheme for Cooperative Computing. Transactions on Networking, 25, 163-174. [Google Scholar] [CrossRef] 
[8] Oualha, N. and Roudier, Y. (2008) Validating P2P Storage Audits with Evolutionary Game Theory. Lecture Notes in Computer Science, 5343, 47-58. [Google Scholar] [CrossRef] 
[9] Alotibi, B., Alarifi, N., Abdulghani, M., et al. (2019) Over-coming Free Riding Behavior in Peer-to-Peer Networks Using Points System Approach. Procedia Computer Science, 151, 1060-1065. [Google Scholar] [CrossRef] 
[10] 田乃硕, 岳德权. 拟生灭过程与矩阵几何解[M]. 北京: 科学出版社, 2002: 39-77.
[11] Neuts, M.F. (1981) Matrix-Geometric Solutions in Stochastic Models. Johns Hopkins Uni-versity Press, Baltimore, 36-66.

为你推荐