Skip to main content
Springer Nature Link
Log in

Fault-tolerant routing algorithm based on disjoint paths in 3-ary n-cube networks with structure faults

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

Abstract

The 3-ary n-cube network is widely used in large-scale multi-processor parallel computers. It is an important issue to design high-performance communication technology with fault tolerance. In this paper, we study the fault-tolerant routing of 3-ary n-cube without desired intersection. Firstly, we propose a fully adaptive routing algorithm for 3-ary n-cube network based on the new virtual network partition technology. The virtual channel allocation of the algorithm is given and its deadlock free property is proved. Secondly, we propose a construction of disjoint paths in 3-ary n-cube networks under the fault model. Finally, we propose a novel fault-tolerant routing algorithm for 3-ary n-cube networks based on the disjoint path with structure faults. The simulation results show that the proposed fault-tolerant routing algorithm outperforms the previous fault-tolerant routing algorithm in many situations, which has a 19–21 percent increase in throughput and the injection rate.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

References

  1. Pai K-J, Chang J-M (2016) Constructing two completely independent spanning trees in hypercube-variant networks. Theor Comput Sci 652:28–37

    Article  MathSciNet  Google Scholar 

  2. Pai K.-J, Chang R.-S, Wu R.-Y, Chang J.-M (2019) Three completely independent spanning trees of crossed cubes with application to secure-protection routing. HPCC/SmartCity/DSS, pp 1358–1365

  3. Fan W, Fan J, Lin C-K, Wang G, Cheng B, Wang R (2019) An efficient algorithm for embedding exchanged hypercubes into grids. J Supercomput 75(2):783–807

    Article  Google Scholar 

  4. Wang X, Fan J, Jia X, Lin C-K (2016) An efficient algorithm to construct disjoint path covers of DCell networks. Theor Comput Sci 609:197–210

    Article  MathSciNet  Google Scholar 

  5. Hsieh S-Y, Kao C-Y (2013) The conditional diagnosability of \(k\)-ary \(n\)-cubes under the comparison diagnosis model. IEEE Trans Comput 62(4):839–843

    Article  MathSciNet  Google Scholar 

  6. Guo L (2018) Reliability analysis of twisted cubes. Theor Comput Sci 707:96–101

    Article  MathSciNet  Google Scholar 

  7. Lv M, Zhou S, Chen G, Chen L, Liu J, Chang C-C (2020) On reliability of multiprocessor system based on star graph. IEEE Trans Reliab 69(2):715–724

    Article  Google Scholar 

  8. Lv M, Zhou S, Sun X, Lian G, Liu J (2019) Reliability of \((n, k)\)-star network based on \(g\)-extra conditional fault. Theor Comput Sci 757:44–55

    Article  MathSciNet  Google Scholar 

  9. Wang D (2012) Hamiltonian embedding in crossed cubes with failed links. IEEE Trans Parallel Distrib Syst 23(11):2117–2124

    Article  Google Scholar 

  10. Wei W, Gu H, Wang K, Yu X, Liu X (2019) Improving cloud-based IoT services through virtual network embedding in elastic optical inter-DC networks. IEEE Internet Things J 6(1):986–996

    Article  Google Scholar 

  11. Lin C-K, Zhang L, Wang D, Fan J (2016) Structure connectivity and substructure connectivity of hypercubes. Theor Comput Sci 634:97–107

    Article  MathSciNet  Google Scholar 

  12. Fan W, Fan J, Lin C-K, Wang Y, Han Y, Wang R (2019) Optimally embedding 3-ary \(n\)-cubes into grids. J Comput Sci Technol 34(2):372–387

    Article  MathSciNet  Google Scholar 

  13. Gu M, Hao R (2014) 3-extra connectivity of 3-ary \(n\)-cube networks. Inf Process Lett 114(9):486–491

    Article  MathSciNet  Google Scholar 

  14. Hsieh S-Y, Lin T-J, Huang H-L (2007) Panconnectivity and edge-pancyclicity of 3-ary \(n\)-cubes. J Supercomput 42:225–233

    Article  Google Scholar 

  15. Lv YL, Lin C-K, Fan JX, Jia XH (2018) Hamiltonian cycle and path embeddings in 3-ary \(n\)-cubes based on \(K_{1,3}\)-structure faults. J Parallel Distrib Comput 120:148–158

    Article  Google Scholar 

  16. Yuan J, Liu A, Qin X, Zhang XJ, Li J (2016) \(g\)-Good-neighbour node conditional diagnosability measures for 3-ary \(n\)-cube networks. Theor Comput Sci 626:144–162

    Article  Google Scholar 

  17. Fan W, He J, Han Z, Li P, Wang R (2020) Reconfigurable fault-tolerance mapping of ternary \(n\)-cubes onto chips. Concurr Comput Pract Exp 32(11):1–12

    Article  Google Scholar 

  18. Guo L, Su G, Lin W et al (2018) Fault tolerance of locally twisted cubes. Appl Math Comput 334:401–406

    MathSciNet  MATH  Google Scholar 

  19. Otake K, Mouri K, Kaneko K (2018) Fault-tolerant routing methods in crossed cubes. In: Proceedings of the 10th International Conference on ACM Advances in Information Technology, vol 10, pp 1–10

  20. Aspnes J, Diamadi Z, Shah G (2003) Fault-tolerant routing in peer-to-peer systems, ACM PODC, pp 223–232

  21. Fan W, Fan J, Han Z, Li P, Zhang Y, Wang R (2020) Fault-tolerant Hamiltonian cycles and paths embedding into locally exchanged twisted cubes. Front Comput Sci. https://doi.org/10.1007/s11704-020-9387-3

    Article  Google Scholar 

  22. Ren P, Kinsy MA, Zheng N (2015) Fault-aware load-balancing routing for 2D-mesh and torus on-chip network topologies. IEEE Trans Comput 65(3):873–887

    Article  MathSciNet  Google Scholar 

  23. Zhao H, Wang Q, Xiong K, Pei S (2018) A path-counter method for fault-tolerant minimal routing algorithms in 2D mesh. J Circuits Syst Comput 27(4):1–11

    Article  Google Scholar 

  24. Zhao H, Bagberzadeh N, Wu J (2017) A general fault-tolerant minimal routing for mesh architectures. IEEE Trans Comput 66(7):1240–1246

    Article  MathSciNet  Google Scholar 

  25. Habibian H, Patooghy A (2017) Fault-tolerant routing methodology for hypercube and cube-connected cycles interconnection networks. J Supercomput 73(3):1–20

    Google Scholar 

  26. Dong Q, Yang X, Wang D (2010) Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links. Inf Sci 180(1):198–208

    Article  MathSciNet  Google Scholar 

  27. Li J, Wang S, Yang Y (2014) Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions. Appl Math Comput 243:339–348

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  29. Zhang G, Wang D (2019) Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks. IEEE Access 7:134496–134504

    Article  Google Scholar 

  30. Wang G, Fan J, Lv Y, Cheng B, Kan S (2019) The constructive algorithm of vertex-disjoint paths in the generalized hypercube under restricted connectivity. J Internet Technol 20(6):1995–2006

    Google Scholar 

  31. Wang G, Lin C-K, Fan J, Cheng B, Jia X (2020) A novel low cost interconnection architecture based on the generalized hypercube. IEEE Trans Parallel Distrib Syst 31(3):647–662

    Article  Google Scholar 

  32. Lai C-N (2012) Optimal construction of all shortest node-disjoint paths in hypercubes with applications. IEEE Trans Parallel Distrib Syst 23(99):1129–1134

    Article  Google Scholar 

  33. Wang X, Fan J, Lin C-K, Jia X (2016) Vertex-disjoint paths in DCell networks. J Parallel Distrib Comput 96:38–44

    Article  Google Scholar 

  34. Guo C, Lu G, Li D, Wu H, Zhang X, Shi Y, Tian C, Zhang Y, Lu S (Oct. 2009) BCube: a high performance, server-centric network architecture for modular data centers. In: Proceedings of SIGCOMM 2009, vol 39, no 4, pp 63–74

  35. Krishnan H, Preethi L (2018) Fault-tolerant routing with minimum delay for mesh architecture. In: Proceedings of the International IEEE CET Conference on Control, Communication, and Computing, pp 322–325

  36. Otake K, Mouri K, Kaneko K (2018) Fault-tolerant routing methods in crossed cubes. In: Proceedings of the 10th International Conference, no 10, pp 1–8

  37. Xiang D, Liu X (2015) Deadlock-free broadcast routing in dragonfly networks without virtual channels. IEEE Trans Parallel Distrib Syst 27(9):2520–2532

    Article  Google Scholar 

  38. Xiang D, Li B, Fu Y (2017) Fault-tolerant adaptive routing in dragonfly networks. IEEE Trans Dependable Secure Comput 16(2):259–271

    Article  Google Scholar 

  39. Yang YS, Deshpande H, Choi G, Gratz PV (2018) SDPR: improving latency and bandwidth in on-chip interconnect through simultaneous dual-path routing. IEEE Trans Comput Aided Des Integr Circuits Syst 37(3):545–558

    Article  Google Scholar 

  40. Hougardy S (2010) The Floyd–Warshall algorithm on graphs with negative cycles. Inf Process Lett 110(8–9):279–281

    Article  MathSciNet  Google Scholar 

  41. Ahuja R, Magnanti T, Orlin J (1993) Network flows-theory, algorithms and applications. J Oper Res Soc 45(11):791–796

    MATH  Google Scholar 

  42. Jeon SW, Jung K, Chang H (2014) Fully distributed algorithms for minimum delay routing under heavy traffic. IEEE Trans Mob Comput 13(5):1048–1060

    Article  Google Scholar 

  43. Francalanci C, Giacomazzi P (2010) A high-performance deadlock-free multicast routing algorithm for \(k\)-ary \(n\)-cubes. IEEE Trans Comput 59(2):174–187

    Article  MathSciNet  Google Scholar 

  44. Mcdonald N, Flores A, Davis A, Isaev M, Gibson D (2018) SuperSim: Extensible flit-Level simulation of large-scale interconnection networks. In: IEEE International Symposium on Performance Analysis of Systems and Software 2018, pp 87–98

Download references

Acknowledgements

We would like to express our sincerest appreciation to Prof. Jianxi Fan for his constructive suggestions. This work is supported by Natural Science Foundation of Jiangsu Province (No. BK20200753), National Natural Science Foundation of China (Grant Nos. 61902195, 61702351), Natural Science Fund for Colleges and Universities in Jiangsu Province (General Program, Grant No. 19KJB520045), and NUPTSF (Grant Nos. NY219151, NY219131).

Author information

Authors and Affiliations

  1. College of Computer, Nanjing University of Posts and Telecommunications, Nanjing, 210023, China

    Yujie Zhang, Weibei Fan & Ruchuan Wang

  2. Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks, Nanjing, 210003, China

    Yujie Zhang, Weibei Fan, Zhijie Han & Ruchuan Wang

  3. System Engineering Institute, Macau University of Science and Technology, Macao, 999087, China

    Yunfei Song

Authors
  1. Yujie Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Weibei Fan
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Zhijie Han
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Yunfei Song
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Ruchuan Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Weibei Fan.

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

Zhang, Y., Fan, W., Han, Z. et al. Fault-tolerant routing algorithm based on disjoint paths in 3-ary n-cube networks with structure faults. J Supercomput 77, 13090–13114 (2021). https://doi.org/10.1007/s11227-021-03799-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-021-03799-0

Keywords