Skip to main content
SpringerLink
Log in

Connectivity and diagnosability of a class of recursive networks

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

With the expansion of network scale, it is essential to study network reliability through connectivity and diagnosability. For Hypercube, DCell, BCube, and other networks, their connection modes are specific and different, so it is necessary to use different methods to study the properties of networks. This paper proposes a class of topological structure—cycle composition networks (CCNs), which not only contains k-ary n-cube and BC graph, but also includes the data center network CamCube and many other unknown networks. We then study their diameters and path construction algorithm in them. Furthermore, we establish their classical connectivity and diagnosability under the PMC and the MM\(^{*}\) models, respectively. Finally, we give the 1-good-neighbor connectivity and diagnosability of the CCNs under the PMC model for \({\varvec{n \geqslant 3}}\) and \({\varvec{l = 2}}\).

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

All of the material is owned by the authors, and/or no permissions are required.

References

  1. Guo C, Lu G, Li D, Wu H, Zhang X, Shi Y, Tian C, Zhang Y, Lu S (2009) BCube: a high performance, server-centric network architecture for modular data centers. In: Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication, pp 63–74

  2. Li X, Fan J, Lin C-K, Jia X (2018) Diagnosability evaluation of the data center network DCell. Comput J 61(1):129–143

    Article  MathSciNet  Google Scholar 

  3. Zhang Z, Deng Y, Min G, Xie J, Yang L-T, Zhou Y (2018) HSDC: a highly scalable data center network architecture for greater incremental scalability. IEEE Trans Parallel Distrib Syst 30(5):1105–1119

    Article  Google Scholar 

  4. Wang X, Fan J, Lin C-K, Zhou J, Liu Z (2018) BCDC: a high-performance, server-centric data center network. J Comput Sci Technol 33:400–416

    Article  MathSciNet  Google Scholar 

  5. Greenberg A, Hamilton JR, Jain N, Kandula S, Kim C, Lahiri P, Maltz DA, Patel P, Sengupta S (2009) VL2: a scalable and flexible data center network. In: Proceedings of the ACM SIGCOMM 2009 Conference on Data Communication, pp 51–62

  6. Fan J, Lin X (2005) The \(t/k\)-diagnosability of the BC graphs. IEEE Trans Comput 54(2):176–184. https://doi.org/10.1109/TC.2005.33

    Article  Google Scholar 

  7. Libdeh HA, Costa P, Rowstron A, O’Shea G, Donnelly A (2010) Symbiotic routing in future data centers. ACM SIGCOMM Comput Commun Rev 40(4):51–62. https://doi.org/10.1145/1851275.1851191

    Article  Google Scholar 

  8. Zhang H, Hao R-X, Qin X-W, Lin C-K, Hsieh S-Y (2022) The high faulty tolerant capability of the alternating group graphs. IEEE Trans Parallel Distrib Syst 34(1):225–233

    Article  Google Scholar 

  9. Gu M, Hao R-X, Zhou S (2019) Fault diagnosability of data center networks. Theoret Comput Sci 776:138–147

    Article  MathSciNet  Google Scholar 

  10. Yuan J, Liu A, Ma X, Liu X, Qin X, Zhang J (2015) The \(g\)-good-neighbor conditional diagnosability of \(k\)-ary \(n\)-cubes under the PMC model and MM\(^{*}\) model. IEEE Trans Parallel Distrib Syst 26:1165–1177

    Article  Google Scholar 

  11. Harary F (1983) Conditional connectivity. Networks 13(3):347–357

    Article  MathSciNet  Google Scholar 

  12. Fàbrega J, Fiol MA (1994) Extraconnectivity of graphs with large girth. Discrete Math 127(1–3):163–170

    Article  MathSciNet  Google Scholar 

  13. Latifi S, Hegde M, Naraghi-Pour M (1994) Conditional connectivity measures for large multiprocessor systems. IEEE Trans Comput 43(2):218–222

    Article  Google Scholar 

  14. Zhu W-H, Hao R-X, Feng Y-Q, Lee J (2023) The 3-path-connectivity of the \(k\)-ary \(n\)-cube. Appl Math Comput 436:127499

    MathSciNet  Google Scholar 

  15. Guo L, Ekinci G-B (2021) Super connectivity of folded twisted crossed cubes. Discrete Appl Math 305:56–63

    Article  MathSciNet  Google Scholar 

  16. Guo L, Zhang M, Zhai S, Xu L (2021) Relation of extra edge connectivity and component edge connectivity for regular networks. Int J Found Comput Sci 32(2):137–149

    Article  MathSciNet  Google Scholar 

  17. Li X, Zhou S, Ren X, Guo X (2021) Structure and substructure connectivity of alternating group graphs. Appl Math Comput 391:125639

    MathSciNet  Google Scholar 

  18. Wang N, Meng J, Tian Y (2022) Reliability evaluation of modified bubble-sort graph networks based on structure fault pattern. Appl Math Comput 430:127257

    MathSciNet  Google Scholar 

  19. Zhang G, Wang D (2019) Structure connectivity and substructure connectivity of bubble-sort star graph networks. Appl Math Comput 363:124632

    MathSciNet  Google Scholar 

  20. Zhu W-H, Hao R-X, Li L (2022) The 3-path-connectivity of the hypercubes. Discrete Appl Math 322:203–209

    Article  MathSciNet  Google Scholar 

  21. Preparata FP, Metze G, Chien RT (1967) On the connection assignment problem of diagnosable systems. IEEE Trans Electron Comput 6:848–854

    Article  Google Scholar 

  22. Lin L, Huang Y, Lin Y, Hsieh S-Y, Xu L (2021) Ffnlfd: fault diagnosis of multiprocessor systems at local node with fault-free neighbors under PMC model and MM\(^{*}\) model. IEEE Trans Parallel Distrib Syst 33(7):1739–1751

    Google Scholar 

  23. Huang Y, Lin L, Lin Y, Xu L, Hsieh SY (2021) Fault diagnosability of networks with fault-free block at local vertex under MM\(^{*}\) model. IEEE Trans Reliab

  24. Zhang H, Zhou S, Cheng E (2023) Restricted connectivity of Cayley graph generated by transposition trees. Discrete Appl Math 327:87–95

    Article  MathSciNet  Google Scholar 

  25. Peng S-L, Lin C-K, Tan JJ-M, Hsu L-H (2012) The \(g\)-good-neighbor conditional diagnosability of hypercube under PMC model. Appl Math Comput 218(21):10406–10412

    MathSciNet  Google Scholar 

  26. Zhang S, Yang W (2016) The \(g\)-extra conditional diagnosability and sequential \(t/k\)-diagnosability of hypercubes. Int J Comput Math 93(3):482–497

    Article  MathSciNet  Google Scholar 

  27. Chang C-P, Lai P-L, Tan JJ-M, Hsu LH (2004) Diagnosability of \(t\)-connected networks and product networks under the comparison diagnosis model. IEEE Trans Comput 53(12):1582–1590

    Article  Google Scholar 

  28. Zhu Q, Thulasiraman K, Xu M, Radhakrishnan S (2020) Hybrid PMC (HPMC) fault model and diagnosability of interconnection networks. AKCE Int J Graphs Comb 17(3):755–760

    Article  MathSciNet  Google Scholar 

  29. Zhu Q, Thulasiraman K, Naik K, Radhakrishnan S, Xu M (2021) Symmetric PMC model of diagnosis, \(b\)-matchings in graphs and fault identification in \(t\)-diagnosable systems. Theoret Comput Sci 891:35–49

    Article  MathSciNet  Google Scholar 

  30. Dahbura AT, Masson GM (1984) An \({O}(n^{2.5})\) fault identification algorithm for diagnosable systems. IEEE Trans Comput 33(6):486–492

    Article  Google Scholar 

  31. Wang Y, Lin C-K, Li X, Zhou S (2020) Diagnosability for two families of composition networks. Theoret Comput Sci 824:46–56

    Article  MathSciNet  Google Scholar 

  32. Park J-H, Lim H-S (2023) Characterization of interval graphs that are paired 2-disjoint path coverable. J Supercomput 79(3):2783–2800. https://doi.org/10.1007/s11227-022-04768-x

    Article  Google Scholar 

  33. Wang X, Fan J, Jia X, Lin C-K (2016) An efficient algorithm to construct disjoint path covers of Dcell networks. Theoret Comput Sci 609(1):197–210. https://doi.org/10.1016/j.tcs.2015.09.022

    Article  MathSciNet  Google Scholar 

  34. Cheng B, Wang D, Fan J (2023) Independent spanning trees in networks—a survey. ACM Comput Surv

  35. Poulik S, Ghorai G (2022) Estimation of most effected cycles and busiest network route based on complexity function of graph in fuzzy environment. Artif Intell Rev 55(6):4557–4574. https://doi.org/10.1007/s10462-021-10111-2

    Article  Google Scholar 

  36. Binu M, Mathew S, Mordeson JN (2019) Connectivity index of a fuzzy graph and its application to human trafficking. Fuzzy Sets Syst 360:117–136. https://doi.org/10.1016/j.fss.2018.06.007

    Article  MathSciNet  Google Scholar 

  37. Poulik S, Ghorai G (2021) Determination of journeys order based on graph’s wiener absolute index with bipolar fuzzy information. Inform Sci 545:608–619. https://doi.org/10.1016/j.ins.2020.09.050

    Article  MathSciNet  Google Scholar 

  38. Poulik S, Ghorai G (2022) Applications of graph’s complete degree with bipolar fuzzy information. Complex Intell Syst 8(2):1115–1127. https://doi.org/10.1007/s40747-021-00580-x

    Article  Google Scholar 

Download references

Acknowledgements

This work was partially supported by the National Natural Science Foundation of China (Nos. 62172291, 62272333, U1905211) and Jiangsu Province Department of Education Future Network Research Fund Project(FNSRFP-2021-YB-39).

Funding

Financial support was provided by the National Natural Science Foundation of China and Jiangsu Province Department of Education Future Network Research Fund Project.

Author information

Author notes

  1. Baolei Cheng, Yan Wang, Yuejuan Han, Jia Yu and Jianxi Fan have contributed equally to this work.

Authors and Affiliations

  1. School of Computer Science and Technology, Soochow University, Suzhou, 215006, Jiangsu, China

    Yaqian Tang, Baolei Cheng, Yan Wang, Yuejuan Han & Jianxi Fan

  2. School of Computer Science and Technology, Qingdao University, Qingdao, 266000, Shandong, China

    Jia Yu

Authors
  1. Yaqian Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Baolei Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yuejuan Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jia Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Jianxi Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

All the authors contributed to the study conception and design. Material preparation, data collection and analysis were performed by all the authors. The first draft of the manuscript was written by YT and all the authors commented on previous versions of the manuscript. All the authors read and approved the final manuscript.

Corresponding author

Correspondence to Jianxi Fan.

Ethics declarations

Conflict of interest

The authors declare that they have no competing interests as defined by Springer, or other interests that might be perceived to influence the results and discussion reported in this paper.

Ethical approval

The submitted work is original and is not published elsewhere in any form or language. the results/data/figures in this manuscript have not been published elsewhere, nor are they under consideration by another publisher.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tang, Y., Cheng, B., Wang, Y. et al. Connectivity and diagnosability of a class of recursive networks. J Supercomput 80, 3817–3848 (2024). https://doi.org/10.1007/s11227-023-05589-2

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-023-05589-2

Keywords

Search

Navigation