Skip to main content
SpringerLink
Log in

Performance analysis of P2P networks with malicious nodes

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Peer-to-Peer (P2P) networks is a distributed structure, which is widely used in file sharing, distributed computing, deep search engines. Each node plays the dual role of client and server, which makes the P2P network further exacerbates the insecurity of P2P systems. For the behavior of nodes in P2P systems, requesting nodes are abstracted into customers and service nodes are abstracted into servers. An M/M/c queueing model is developed with dynamically changing servers in almost unobservable cases, strategies are introduced, including start-up period, working sleep of service nodes and negative customers, etc. Using the matrix-geometric solution and Gauss-Seidel iteration method, average waiting length, average sojourn time, total energy consumption and throughput are derived. Through numerical experiments, the process of P2P file sharing is simulated, the optimal value of social utility is obtained using Nash equilibrium and social optimal strategy, and a theoretical basis is provided for node scheduling in P2P systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Data availability

In this work, the queuing theory is applied into the P2P networks model, When a large number of nodes connect to the server route to request for the required data resources, the requesting nodes will form a queue in the system, in order to avoid congestion of request queue, a three-dimensional Markov chain with working sleep of service nodes and negative customers, etc. constructed. The social optimization and the arrival rate of request note through a reasonable charging scheme are obtained. The data used to support the findings of this study are included within the article.

References

  1. Qiu, D., Srikant, R.: Modeling and performance analysis of BitTorrent-like Peer-to-Peer networks. ACM 34, 167–178 (2004)

    Google Scholar 

  2. Yang, X., Veciana, G.: Performance of Peer-to-Peer networks: service capacity and role of resource sharing policies. Perform. Eval. 63(3), 175–194 (2006)

    Article  Google Scholar 

  3. Silva, S.E., Leão, R.M.M., Menasché, D.S., Towsley, D.: On the scalability of P2P swarming systems. Comput. Netw. 151, 93–113 (2019)

    Article  Google Scholar 

  4. Shi, X.N., Jiang, N.: A file sharing system based on hybrid hierarchical P2P network. China Comput. Commun. 32(21), 162–165 (2021). (in Chinese)

    Google Scholar 

  5. Bok, K., Kim, J., Yoo, J.: Cooperative caching for multimedia data in mobile P2P networks. Multimed. Tools Appl. 78(5), 5193–5216 (2017)

    Article  Google Scholar 

  6. Al-Janabi, S., Al-Shourbaji, I., Shojafar, M., Abdelhag, M.: Mobile cloud computing: challenges and future research directions. In: International Conference on Developments in eSystems Engineering, IEEE. 62–67 (2017)

  7. Al-Janabi, S., Hussein, N.Y.: The reality and future of the secure mobile cloud computing (SMCC): survey. In: Big Data and Networks Technologies. Springer, Cham (2020)

    Google Scholar 

  8. Al-Janabi, S., Patel, A., Fatlawi, H., Kalajdzic, K., Al Shourbaji, I. : Empirical rapid and accurate prediction model for data mining tasks in cloud computing environments. In: 2014 International Congress on Technology, Communication and Knowledge (ICTCK), Mashhad, Iran, pp. 1–8, (2014)

  9. Zheng, X.J., Li, T.: Pre-switching: research on P2P shared file backup technology. Softw. Guide 20(4), 205–210 (2021). (in Chinese)

    Google Scholar 

  10. Premakumari, T., Chandrasekaran, M.: Soft computing approach based malicious peers detection using geometric and trust features in P2P networks. Clust. Comput. 22(17), 2227–2232 (2018)

    Google Scholar 

  11. Al-Janabi, S., Mohammad, M., Al-Sultan, A.: A new method for prediction of air pollution based on intelligent computation. Soft Comput. 24(1), 661–680 (2019)

    Article  Google Scholar 

  12. Al-Janabi, S., Alkaim, A.F., Adel, Z.: An Innovative synthesis of deep learning techniques (DCapsNet & DCOM) for generation electrical renewable energy from wind energy. Soft Comput. 24(14), 10943–10962 (2020)

    Article  Google Scholar 

  13. Singh, S.K., Kumar, C., Nath, P.: Analysis and modelling the effects of mobility, churn rate, node’s life span, intermittent bandwidth and stabilization cost of finger table in structured mobile P2P networks. Wirel. Netw. 27, 1049–1062 (2021)

    Article  Google Scholar 

  14. Marozzo, F., Talia, D., Trunfio, P.: A sleep-and-wake technique for reducing energy consumption in BitTorrent networks. Concurr. Comput. Pract. Exp. (2020). https://doi.org/10.1002/cpe.5723

    Article  Google Scholar 

  15. Sun, S.Y., Yao, W.B., Li, X.Y.: SORD: a new strategy of online replica deduplication in Cloud-P2P. Clust. Comput. 22, 1–23 (2019)

    Article  Google Scholar 

  16. Heyman, D.P., Lakshman, T.V., Neidhardt, A.L.: A new method for analyzing feedback-based protocols with applications to engineering web traffic over the Internet. Comput. Commun. 26(8), 785–803 (2003)

    Article  Google Scholar 

  17. Singha, N., Singh, Y.N.: New incentive mechanism to enhance cooperation in wireless P2P networks. Peer-to-Peer Netw. Appl. 14(3), 1218–1228 (2021)

    Article  Google Scholar 

  18. Liu, J.P., Jin, S.F., Wang, B.S.: Study on optimization strategy for hybrid underlay/overlay spectrum sharing based on queuing model. J. Commun. 38(9), 55–64 (2017). (in Chinese)

    Google Scholar 

  19. Fu, L.W., Jin, S.F.: Nash equilibrium and social optimization in cloud service systems with diverse users. Clust. Comput. 24(3), 2039–2050 (2021)

    Article  MathSciNet  Google Scholar 

  20. Li, S.Y., Liu, H., Li, W.Z., Sun, W.: An optimization framework for migrating and deploying multiclass enterprise applications into the Cloud. IEEE Trans. Serv. Comput. (2021). https://doi.org/10.1109/TSC.2022.3174216

    Article  Google Scholar 

  21. Zhang, C.Z., Ma, Z.Y., Zhang, L.Y., Wang, S.Z.: Energy saving strategy and Nash equilibrium of hybrid P2P networks. J. Parallel Distrib. Comput. 157, 145–156 (2021)

    Article  Google Scholar 

  22. Ge, Z., Figueiredo, D.R., Jaiswal, S., Kurose, J., Towsley, D.: Modeling peer-peer file sharing systems. IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), San Francisco, USA (2003)

  23. Wang, J.T., Wang, Z.B., Liu, Y.N.: Reducing delay in retrial queues by simultaneously differentiating service and retrial rates. Oper. Res. 68(6), 1648–1667 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  24. Dudin, A.N., Dudina, S.A., Dudina, O.S., Samouylov, K.E.: Competitive queueing systems with comparative rating dependent arrivals. Oper. Res. Perspect. 7, 100139 (2020)

    MathSciNet  Google Scholar 

  25. Xu, Z.R., Zhu, Y.J., Luo, H.J.: Working vacation queue with closed-down, set-up period and negative customers. J. Jiangsu Univ. (Nat. Sci. Ed.) 33(2), 244–248 (2012). (in Chinese)

    MATH  Google Scholar 

  26. Panda, G., Goswami, V.: Equilibrium joining strategies of positive customers in a Markovian queue with negative arrivals and working vacations. Methodol. Comput. Appl. Probab. (2021). https://doi.org/10.1007/s11009-021-09864-8

    Article  MATH  Google Scholar 

  27. Ma, Z.Y., Cao, J., Yu, X.R., Guo, S.S.: Multiple vacation queuing system with impatient customers and work failure. J. Chongqing Normal Univ. (Nat. Sci. Ed.) 36(4), 7–13 (2019). (in Chinese)

    Google Scholar 

  28. Wang, J.T.: Fundamentals of Queuing Game Theory. Science Press, Beijing (2016). (in Chinese)

    Google Scholar 

  29. Si, Q.N., Ma, Z.Y., Liu, F.J., Wang, R.: Performance analysis of P2P network with dynamic changes of servers based on M/M/c queuing model. Wirel. Netw. 27(5), 3287–3297 (2021). https://doi.org/10.1007/s11276-021-02659-2

    Article  Google Scholar 

  30. Tian, N.S., Yue, D.Q.: The Quasi Birth and Death Process and Matrix-Geometric Solution. Science Press, Beijing (2002). (in Chinese)

    Google Scholar 

  31. Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Johns Hopkins University Press, Baltimore (1981)

    MATH  Google Scholar 

Download references

Funding

This work was financially supported in part the National Natural Science Foundation of China under Grant Nos. 61973261, 61872311 and Natural Science Foundation of Hebei Province under Grant No. A2020203010 and Project of Hebei Key Laboratory of Software Engineering, No. 22567637H.

Author information

Authors and Affiliations

  1. School of Science, Yanshan University, Qinhuangdao, 066004, China

    Zhanyou Ma, Qiannan Si, Yilin Liu & Shunzhi Wang

Authors
  1. Zhanyou Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qiannan Si
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yilin Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shunzhi Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

During the writing and revision of the paper, every author had made important and irreplaceable contributions. First Author performed method guidance and process supervision. Second Author performed model building, programming and numerical experiments, etc. Third Author and Fourth Author performed literature search, graphic beautification and error checking, etc.

Corresponding author

Correspondence to Qiannan Si.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Ethical approval

All the authors listed have approved the manuscript that is enclosed, and no conflict of interest exits in the submission of this manuscript.

Informed consent

I would like to declare on behalf of my co-authors that the work described was original research that has not been published previously, and not under consideration for publication elsewhere, in whole or in part. I hope this paper is suitable for “Cluster Computing”

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ma, Z., Si, Q., Liu, Y. et al. Performance analysis of P2P networks with malicious nodes. Cluster Comput 25, 4325–4337 (2022). https://doi.org/10.1007/s10586-022-03683-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-022-03683-3

Keywords

Search

Navigation