Skip to main content
SpringerLink
Log in

Constructing edge-disjoint spanning trees in several cube-based networks with applications to edge fault-tolerant communication

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

Abstract

If a set of spanning trees of a graph do not share any edge with each other, they are called edge-disjoint spanning trees (for short EDSTs), which have widespread practical applications, such as fault-tolerant broadcasting, the distributed algorithms against Man-in-the-Middle attacks, the efficient collective communication algorithms, and so on. Crossed cubes, folded cubes, and folded crossed cubes, as three important variations of hypercubes, are optimized in terms of communication efficiency and fault tolerance of networks. In this paper, we propose a recursive algorithm to construct the maximum number of EDSTs in the three kinds of cube-based networks. Additionally, relying on the resulting EDSTs, the performance of one-to-one communication and one-to-all communication with edge failures are evaluated by simulation results in folded crossed cubes.

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
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

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. Chen G, Cheng B, Wang D (2021) Constructing completely independent spanning trees in data center network based on augmented cube. IEEE Trans Parallel Distrib Syst 32(3):665–673

    Article  Google Scholar 

  2. Andújar FJ, Coll S, Alonso M, Martínez J-M, López P, Sánchez JL, Alfaro FJ (2023) Energy efficient HPC network topologies with on/off links. Futur Gener Comput Syst 139:126–138

    Article  Google Scholar 

  3. Li J, Ling B (2018) Symmetric graphs and interconnection networks. Futur Gener Comput Syst 83:461–467

    Article  Google Scholar 

  4. Pan Z, Cheng B, Fan J, Wang Y, Li X (2023) A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks. Theor Comput Sci 942:33–46

    Article  MathSciNet  Google Scholar 

  5. Saad Y, Schultz MH (1988) Topological properties of hypercubes. IEEE Trans Comput 37(7):867–872

    Article  Google Scholar 

  6. Efe K (1991) A variation on the hypercube with lower diameter. IEEE Trans Comput 40(11):1312–1316

    Article  Google Scholar 

  7. Chang C-P, Sung T-Y, Hsu L-H (2000) Edge congestion and topological properties of crossed cubes. IEEE Trans Parallel Distrib Syst 11(1):64–80

    Article  Google Scholar 

  8. Hung R-W (2015) The property of edge-disjoint hamiltonian cycles in transposition networks and hypercube-like networks. Discret Appl Math 181:109–122

    Article  MathSciNet  Google Scholar 

  9. Cheng B, Fan J, Lyu Q, Zhou J, Liu Z (2018) Constructing independent spanning trees with height \(n\) on the \(n\)-dimensional crossed cube. Futur Gener Comput Syst 87:404–415

    Article  Google Scholar 

  10. Pan Z, Cheng D (2020) Structure connectivity and substructure connectivity of the crossed cube. Theor Comput Sci 824–825(5):67–80

    Article  MathSciNet  Google Scholar 

  11. Zhang Y-Q (2002) Folded-crossed hypercube: a complete interconnection network. J Syst Archit 47(11):917–922

    Article  Google Scholar 

  12. Guo L (2017) Reliability analysis of hypercube networks and folded hypercube networks. WSEAS Trans Math 16:331–338

    Google Scholar 

  13. Lin Y, Lin L, Huang Y, Wang J (2021) The \(t/s\)-diagnosability and \(t/s\)-diagnosis algorithm of folded hypercube under the PMC/MM* model. Theor Comput Sci 887:85–98

    Article  Google Scholar 

  14. Lai C-N (2021) Optimal node-disjoint paths in folded hypercubes. J Parallel Distribut Comput 147:100–107

    Article  Google Scholar 

  15. Pai K-J, Chang J-M, Yang J-S (2016) Vertex-transitivity on folded crossed cubes. Inform Process Lett 116(11):689–693

    Article  MathSciNet  Google Scholar 

  16. Cai X, Vumar E (2019) The super connectivity of folded crossed cubes. Inform Process Lett 142:52–56

    Article  MathSciNet  Google Scholar 

  17. Guo H, Sabir E, Mamut A (2022) The \(g\)-extra connectivity of folded crossed cubes. J Parallel Distribut Comput 166:139–146

    Article  Google Scholar 

  18. Ho C-T (1990) Full bandwidth communications for folded hypercubes. In: Proceedings of the 1990 International Conference on Parallel Processing, pp. 276–280

  19. Yang J-S, Chang J-M, Chan H (2009) Independent spanning trees on folded hypercubes. In: The 10th International Symposium on Pervasive Systems, Algorithms, and Networks, pp. 601–605

  20. Barden B, Ran LH, Davis J (1999) On edge-disjoint spanning trees in hypercubes. Inform Process Lett 70(1):13–16

    Article  MathSciNet  Google Scholar 

  21. Fragopoulou P, Akl SG (1996) Edge-disjoint spanning trees on the star network with applications to fault tolerance. IEEE Trans Comput 45(2):174–185

    Article  Google Scholar 

  22. Touzene A, Day K, Monien B (2005) Edge-disjoint spanning trees for the generalized butterfly networks and their applications. J Parallel Distribut Comput 65(11):1384–1396

    Article  Google Scholar 

  23. Yang J-S, Chan H-C, Chang J-M (2011) Broadcasting secure messages via optimal independent spanning trees in folded hypercubes. Discret Appl Math 159(12):1254–1263

    Article  MathSciNet  Google Scholar 

  24. Oliva G, Cioaba S, Hadjicostis CN (2018) Distributed calculation of edge-disjoint spanning trees for robustifying dstributed algorithms against Man-in-the-Middle attacks. IEEE Trans Control Netw Syst 5(4):1646–1656

    Article  MathSciNet  Google Scholar 

  25. Libeskind-Hadas R, Mazzoni D, Rajagopalan R (1998) Tree-based multicasting in wormhole-routed irregular topologies. In: Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, pp. 244–249

  26. Wang Y, Cheng B, Fan J, Qian Y, Jiang R (2021) An algorithm to construct completely independent spanning trees in line graphs. Comput J 65(12):2979–2990

    Article  MathSciNet  Google Scholar 

  27. Li X-Y, Lin W, Chang J-M, Jia X (2022) Transmission failure analysis of multi-protection routing in data center networks with heterogeneous edge-core servers. IEEE/ACM Trans Netw 30(4):1689–1702

    Article  Google Scholar 

  28. Wang Y, Cheng B, Qian Y, Wang D (2022) Constructing completely independent spanning trees in a family of line-graph-based data center networks. IEEE Trans Comput 71(5):1194–1203

    Article  Google Scholar 

  29. Ku S-C, Wang B-F, Hung T-K (2003) Constructing edge-disjoint spanning trees in product networks. IEEE Trans Parallel Distrib Syst 14(3):213–221

    Article  Google Scholar 

  30. Zhou J, Bu C, Lai H-J (2021) Edge-disjoint spanning trees and forests of graphs. Discret Appl Math 299:74–81

    Article  MathSciNet  Google Scholar 

  31. Ma X, Wu B, Jin X (2018) Edge-disjoint spanning trees and the number of maximum state circles of a graph. J Comb Optim 35(4):997–1008

    Article  MathSciNet  Google Scholar 

  32. Gu X, Lai H-J, Li P, Yao S (2016) Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs. J Graph Theory 81(1):16–29

    Article  MathSciNet  Google Scholar 

  33. 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 

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China(Nos. 62172291, 62272333) and A Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions (PAPD).

Author information

Authors and Affiliations

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

    Huanwen Zhang, Yan Wang, Jianxi Fan, Yuejuan Han & Baolei Cheng

Authors
  1. Huanwen Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jianxi Fan
    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. Baolei Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

H.Z. wrote the main manuscript text. Y. W., J.F., Y.H., and B.C. reviewed and revised the manuscript.

Corresponding author

Correspondence to Yan Wang.

Ethics declarations

Conflict of interest

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

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

Zhang, H., Wang, Y., Fan, J. et al. Constructing edge-disjoint spanning trees in several cube-based networks with applications to edge fault-tolerant communication. J Supercomput 80, 1907–1934 (2024). https://doi.org/10.1007/s11227-023-05546-z

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-023-05546-z

Keywords

Search

Navigation