基于两阶段服务与重试空间的故障可修P2P网络系统分析
Analysis of Fault-Repairable P2P Network System Based on Two-Phase Service and Retry Space
摘要: 对于移动P2P网络这样高分布式异构的环境而言，为了较好地实现各终端系统协同合作和资源共享的目标，维护和提高网络的性能，构建一个性能良好的网络拓扑是研究的关键，本文针对这一特性，基于半分布式拓扑与完全分布式拓扑相结合的混合移动网络模型，建立了带有重试空间与工作故障的两阶段排队模型。利用拟生灭过程、矩阵几何解方法和Gauss-Seidel迭代法得到了网络模型稳态下的概率分布，给出了两阶段平均节点数等性能指标的表达式。利用编程软件进行数值试验，分析了参数对各指标的影响，通过构造系统单位时间平均费用函数与社会效用函数，求解最优参数，为移动P2P网络模型提供决策依据。
Abstract: For a highly distributed heterogeneous environment such as mobile P2P network, in order to better achieve the goal of cooperation and resource sharing of various terminal systems, maintain and improve the performance of the network, building a network topology with good performance is the key to research, in view of this feature, based on the hybrid mobile network model combining semi-distributed topology and fully distributed topology, a two-stage queuing model with retry space and working fault is established. The probability distribution under steady-state of the net-work model is obtained by using the mimic-life and extinction process, the matrix geometric solution method and the Gauss-Seidel iterative method, and the expression of performance indicators such as the average number of nodes in the two stages is given. The numerical experiment is carried out by programming software, the influence of parameters on each index is analyzed, and the optimal parameters are solved by constructing the average cost function per unit time and the social utility function of the system, which provides a decision-making basis for the mobile P2P net-work model.
文章引用：张羽康. 基于两阶段服务与重试空间的故障可修P2P网络系统分析[J]. 计算机科学与应用, 2023, 13(3): 319-333. https://doi.org/10.12677/CSA.2023.133031

参考文献

[1] Saied, A. and Kianoush, A. (2017) A Reliable Path between Target Users and Clients in Social Networks Using an In-verted Ant Colony Optimization Algorithm. Karbala International Journal of Modern Science, 3, 140-152. [Google Scholar] [CrossRef] 
[2] Arunachalam, A., Ravi, V., Krichen, M., et al. (2021) Mathe-matical Model Validation of Search Protocols in MP2P Networks. Computers, Materials, & Continua, 8, 1807-1829. [Google Scholar] [CrossRef] 
[3] Luis, G.E., Biersack, E.W., Ross, K.W., et al. (2008) Hierarchical Peer-to-Peer Systems. Performance Evaluation, 13, 643-657. [Google Scholar] [CrossRef] 
[4] Lv, Q., Cao, P., Cohen, E., et al. (2005) Analysis of Search and Replication in Unstructured Peer-to-Peer Networks. ACM SIGMETRICS Performance Evaluation Review, 33, 404-405. [Google Scholar] [CrossRef] 
[5] Wu, J.G., Shen, L. and Liu, L.F. (2020) LSH-Based Distributed Similarity Indexing with Load Balancing in High-Dimensional Space. The Journal of Supercomputing, 76, 636-665. [Google Scholar] [CrossRef] 
[6] Zhou, S. and Meng, X.F. (2020) A Location and Time-Aware Resource Searching Scheme in Mobile P2P Ad Hoc Networks. The Journal of Supercomputing, 76, 6809-6833. [Google Scholar] [CrossRef] 
[7] Meng, X.F. and Liu, D.X. (2018) GeTrust: A Guarantee-Based Trust Model in Chord-Based P2P Networks. IEEE Transactions on Dependable and Secure Computing, 15, 54-68. [Google Scholar] [CrossRef] 
[8] Wu, Y., et al. (2008) History and Recommendation-Based Trust Model in P2P Environment. Application Research of Computers, 25, 915-919.
[9] Lv, Q., Cao, P., Cohen, E., et al. (2002) Search and Replication in Unstructured Peer-to-Peer Networks. Journal of Information Processing, 30, 258-259. [Google Scholar] [CrossRef] 
[10] Mohamed, A.G. and Najem, M. (2018) Hybrid Trust Model for Worm Mitigation in P2P Networks. Journal of Information Security and Applications, 43, 21-36. [Google Scholar] [CrossRef] 
[11] Meng, X. (2018) SpeedTrust: A Super Peer-Guaranteed Trust Model in Hybrid P2P Networks. Journal of Supercomputing, 74, 2553-2580. [Google Scholar] [CrossRef] 
[12] Meng, X. (2018) SureTrust: A Super Peer-Aware Trust Model for 2-Level P2P Networks. Peer-to-Peer Networking and Applications, 11, 619-631. [Google Scholar] [CrossRef] 
[13] Murat, K., İbrahim, K. and Özgür, U. (2008) Counteracting Free Riding in Peer-to-Peer Networks. Computer Networks, 52, 675-694. [Google Scholar] [CrossRef] 
[14] Sanjeev, S., Chiranjeev, K. and Prem, N. (2018) Ranking Based System to Reduce Free Riding Behavior in P2P Systems. Advances in Information and Communication Networks, 886, 165-177. [Google Scholar] [CrossRef] 
[15] Bhardwaj, R., Dixit, V.S. and Upadhyay, A.K. (2009) On Mitigating Pollution and Free-Riding Attacks by Shamir’s Secret Sharing in Fully Connected P2P Systems. 2017 13th International Wireless Communications and Mobile Computing Conference, Valencia, 1-7.
[16] Abdulazeez, S. (2018) Dynamic Load Balancing for Massively Multiplayer Online Games. Doctoral Thesis, Liverpool John Moores University, Merseyside. [Google Scholar] [CrossRef] 
[17] Colin, H. (2017) Institutional Solutions to Free-Riding in Peer-to-Peer Networks: A Case Study of Online Pirate Communities. Computer Communications (Net-works), 1, 17-46.
[18] Duan, Z., Tian, C., Zhang, N., et al. (2021) A Novel Load Balancing Scheme for Mobile Edge Computing. Journal of Systems and Software, 186, 1-26. [Google Scholar] [CrossRef] 
[19] Dharmendra, K. and Mayank, P. (2022) An Optimal Load Balancing Strategy for P2P Network Using Chicken Swarm Optimization. Peer-to-Peer Networking and Applications, 15, 1-23. [Google Scholar] [CrossRef] 
[20] Sumino, H., Ishikawa, N. and Kato, T. (2006) Design and Im-plementation of P2P Protocol for Mobile Phones. 4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops, Pisa, 13-17 March 2006, 55-61. [Google Scholar] [CrossRef] 
[21] Tian, N.S. and Yue, D.Q. (2002) The Quasi-Birth-and-Death Process and Matrix-Geometric Solution. Science Press, Beijing. (In Chinese)
[22] Neuts, M.F. (1981) Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Johns Hopkins University Press, Baltimore.
[23] Neuts, M.F. (1981) Moment Formulas for the Markov Renewal Branching Process Advance Applied Probability. Advances in Applied Probability, 8, 690-711. [Google Scholar] [CrossRef] 
[24] Ramaswami, V. (1988) Nonlinear Matrix Equations in Applied Probability-Solution Techniques and Open Problems. SIAM Review, 30, 256-263. [Google Scholar] [CrossRef] 
[25] Isaacson, E. (1966) Analysis of Numerical Methods. John Wiley, Balti-more.
[26] Neuts, M.F. (1986) The Caudal Characteristic Curve of Queues. Advances in Applied Probability, 18, 221-254. [Google Scholar] [CrossRef]