71
Views
0
CrossRef citations to date
0
Altmetric
Information Engineering

Fault-tolerant unicast paths constructive algorithms in a family of recursive networks

ORCID Icon, , , , & ORCID Icon
Pages 265-272 | Received 06 Jul 2023, Accepted 12 Dec 2023, Published online: 07 Feb 2024

References

  • Al-Sadi, J., K. Day, and M. Ould-Khaoua. 2004. “A New Fault-Tolerant Routing Algorithm for K-Ary N-Cube Networks.” International Journal of High Speed Computing 12 (1): 29–54. https://doi.org/10.1142/S0129053304000220.
  • Baalaaji, A., and R. Bevi. 2021. “Design of a Novel Chaotic Neural Network Based Encryption System for Security Applications.” Journal of the Chinese Institute of Engineers 44 (5): 424–439. https://doi.org/10.1080/02533839.2021.1919558.
  • Chen, H., M. Chen, M. Habib, and C.-K. Lin. 2022. “Connectivity for Some Families of Composition Networks.” Theoretical Computer Science 922: 361–367. https://doi.org/10.1016/j.tcs.2022.04.036.
  • Chen, M.-S., and K. G. Shin. 1990. “Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers.” IEEE Transactions on Parallel and Distributed Systems 1 (2): 152–159. https://doi.org/10.1109/71.80143.
  • Chen, X.-B. 2015. “Paired 2-Disjoint Path Covers of Multidimensional Torus Networks with Faulty Edges.” Information Processing Letters 116 (2): 107–110. https://doi.org/10.1016/j.ipl.2015.10.001.
  • Chen, X.-B. 2016. “Paired 2-Disjoint Path Covers of Faulty K-Ary N-Cubes.” Theoretical Computer Science 609 (2): 494–499. https://doi.org/10.1016/j.tcs.2015.11.007.
  • Cheng, B., J. Fan, X. Jia, S. K. Zhang, and B. Chen. 2013. “Constructive Algorithm of Independent Spanning Trees on Mobius Cubes.” The Computer Journal 56 (11): 1347–1362. https://doi.org/10.1093/comjnl/bxs123.
  • Cheng, D. 2021. “The H-Restricted Connectivity of Balanced Hypercubes.” Discrete Applied Mathematics 305: 133–141. doi:https://doi.org/10.1016/j.dam.2021.08.036.
  • Duong, D. T., and K. Kaneko. 2014. “Fault-tolerant Routing Based on Approximate Directed Routable Probabilities for Hypercubes.” Future Generation Computer Systems 37: 88–96. doi:https://doi.org/10.1016/j.future.2013.12.003.
  • Fan, J., X. Jia, B. Cheng, and J. Yu. 2011. “An Efficient Fault-Tolerant Routing Algorithm in Bijective Connection Networks with Restricted Faulty Edges.” Theoretical Computer Science 412 (29): 3440–3450. https://doi.org/10.1016/j.tcs.2011.02.014.
  • Fan, W., F. Xiao, H. Cai, X. Chen, and S. Yu. 2023. “Disjoint Paths Construction and Fault-Tolerant Routing in BCube of Data Center Networks.” IEEE Transactions on Computers 72 (9): 2467–2481. 10.1109/TC.2023.3251849.
  • Gu, M.-M., and J.-M. Chang. 2023. “Neighbor Connectivity of Pancake Graphs and Burnt Pancake Graphs.” Discrete Appllied Mathematics 324: 46–57. 10.1016/j.dam.2022.09.013.
  • Gu, M.-M., K.-J. Pai, and J.-M. Chang. 2023. “Subversion Analyses of Hierarchical Networks Based on (Edge) Neighbor Connectivity.” Journal of Parallel and Distributed Computing 171:54–65. https://doi.org/10.1016/j.jpdc.2022.09.010.
  • Guo, C., H. Wu, K. Tan, L. Shi, Y. Zhang, and S. Lu. 2008. “DCell: A Scalable and Fault-Tolerant Network Structure for Data Centers.” Acm Sigcomm Computer Communication Review 38 (4): 75–86. https://doi.org/10.1145/1402946.1402968.
  • Hou, J., F. Liu, H. Lu, Z. Tan, X. Zhuang, and Z. Tian. 2022. “A Novel Flow-Vector Generation Approach for Malicious Traffic Detection.” Journal of Parallel and Distributed Computing 169: 72–86. https://doi.org/10.1016/j.jpdc.2022.06.004.
  • Lee, C.-W., and S.-Y. Hsieh. 2011. “Determining the Diagnosability of (1,2)-Matching Composition Networks and Its Applications.” IEEE Transactions on Dependable and Secure Computing 8 (3): 353–362. https://doi.org/10.1109/TDSC.2010.22.
  • Li, A.-J., K. Lim, and A. Fatty. 2020. “Stability Evaluations of Three-Layered Soil Slopes Based on Extreme Learning Neural Network.” Journal of the Chinese Institute of Engineers 43 (7): 628–637. https://doi.org/10.1080/02533839.2020.1719899.
  • Li, J., G. Wang, and L. Chen. 2017. “Paired 2-Disjoint Path Covers of Multi-Dimensional Torus Networks with 2n−3$2n - 3$faulty Edges.” Theoretical Computer Science 677: 1–11. https://doi.org/10.1016/j.tcs.2017.03.008.
  • Li, X.-Y., W. Lin, X. Liu, C.-K. Lin, K.-J. Pai, and J.-M. Chang. 2022. “Completely Independent Spanning Trees on BCCC Data Center Networks with an Application to Fault-Tolerant Routing.” IEEE Transactions on Parallel and Distributed Systems 33 (8): 1939–1952. https://doi.org/10.1109/TPDS.2021.3133595.
  • Li, X., S. Zhou, X. Guo, and T. Ma. 2021. “The H-Restricted Connectivity of the Generalized Hypercubes.” Theoretical Computer Science 850:135–147. https://doi.org/10.1016/j.tcs.2020.10.036.
  • Lin, L. M., Y. Huang, X. Wang, and L. Xu. 2020. “Restricted Connectivity and Good-Neighbor Diagnosability of Split-Star Networks.” Theoretical Computer Science 824: 81–91. https://doi.org/10.1016/j.tcs.2020.04.015.
  • Liu, X., S. Zhou, E. Cheng, and H. Zhang. 2023. “Reliability Analysis of the Generalized Balanced Hypercube.” Theoretical Computer Science 942: 297–311. https://doi.org/10.1016/j.tcs.2022.12.003.
  • Lu, H., C. Jin, X. Helu, X. Du, M. Guizani, and Z. Tian. 2022. “DeepAutoD: Research on Distributed Machine Learning Oriented Scalable Mobile Communication Security Unpacking System.” IEEE Transactions on Network Science and Engineering 9 (4): 2052–2065. https://doi.org/10.1109/TNSE.2021.3100750.
  • Lu, H., C. Jin, X. Helu, M. Zhang, Y. Sun, Y. Han, and Z. Tian. 2021. “Research on Intelligent Detection of Command Level Stack Pollution for Binary Program Analysis.” Mobile Networks & Applications 26 (4): 1723–1732. https://doi.org/10.1007/s11036-019-01507-0.
  • Lv, M., B. Cheng, J. Fan, X. Wang, J. Zhou, and J. Yu. 2021. “The Conditional Reliability Evaluation of Data Center Network BCDC.” The Computer Journal 64 (9): 1451–1464. https://doi.org/10.1093/comjnl/bxaa078.
  • Oh, A. D., and H.-A. Choi. 1993. “Generalized Measures of Fault Tolerance in N-Cube Networks.” IEEE Transactions on Parallel and Distribute Systems 4 (6): 702–703. https://doi.org/10.1109/71.242153.
  • Pai, K.-J., J.-S. Yang, G.-Y. Chen, and J.-M. Chang. 2022. “Configuring Protection Routing via Completely Independent Spanning Trees in Dense Gaussian On-Chip Networks.” IEEE Transactions on Network Science and Engineering 9 (2): 932–946. https://doi.org/10.1109/TNSE.2022.3140329.
  • Wan, M., and Z. Zhang. 2009. “A Kind of Conditional Vertex Connectivity of Star Graphs.” Applied Mathematics Letters 22 (2): 264–267. https://doi.org/10.1016/j.aml.2008.03.021.
  • Wang, X., J. Fan, X. Jia, and C.-K. Lin. 2016. “An Efficient Algorithm to Construct Disjoint Path Covers of DCell Networks.” Theoretical Computer Science 609: 197–210. https://doi.org/10.1016/j.tcs.2015.09.022.
  • Wang, X., F. N. He, and S. K. Zhang. 2018. “A Restricted Fault-Free Unicast Algorithm in Cross-Cubes.” Journal of Southwest Normal University (Natural Science Edition) 43 (9): 51–59. https://doi.org/10.13718/j.cnki.xsxb.2018.09.009.
  • Wang, Y., J. Fan, Y. Han, Y. Wang, and B. Cheng. 2023. “Reliability Evaluation of Complete Graph-Based Recursive Networks.” Theoretical Computer Science 966967: 114015. https://doi.org/10.1016/j.tcs.2023.114015.
  • Wang, Y., J. Meng, and J. Fan. 2023. “Reliabilities for Two Kinds of Graphs with Smaller Diameters.” Applied Mathematics and Computation 446: 127874. https://doi.org/10.1016/j.amc.2023.127874.
  • Yang, J.-S., X.-Y. Li, S.-L. Peng, and J.-M. Chang. 2022. “Parallel Construction of Multiple Independent Spanning Trees on Highly Scalable Datacenter Networks.” Applied Mathematics and Computation 413: 126617. 10.1016/j.amc.2021.126617.
  • Zhang, H., and J. Meng. 2021. “Reliability of DQcube Based on G-Extra Conditional Fault.” The Computer Journal 64 (9): 1393–1400. https://doi.org/10.1093/comjnl/bxaa058.
  • Zhao, S.-L., and R.-X. Hao. 2020. “The Fault Tolerance of (N,k)-Bubble-Sort Networks.” Discrete Applied Mathematics 285:204–211. https://doi.org/10.1016/j.dam.2020.05.016.
  • Zhuang, H., X.-Y. Li, J.-M. Chang, and D. Wang. 2023. “An Efficient Algorithm for Hamiltonian Path Embedding of K-Ary N-Cubes Under the Partitioned Edge Fault Model.” IEEE Transactions on Parallel and Distributed Systems 34 (6): 1–14. https://doi.org/10.1109/TPDS.2023.3264698.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.