.png){kind=icon}
Return
Shortest node-to-node disjoint paths algorithm for symmetric networks
.png){kind=icon}
PRE
AI
DOI：10.1007/s10586-024-04582-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Disjoint paths are defined as paths between the source and destination nodes where the intermediate nodes in any two paths are disjoint. They are helpful in fault-tolerance routing and securing message distribution in the network. Several research papers were proposed to solve the problem of finding disjoint paths for a variety of interconnection networks such as Hypercube, Generalized Hypercube, Mesh, Torus, Gaussian, Eisenstein-Jacobi, and many other topologies. In this research, we have developed a general algorithm that constructs maximal node-to-node disjoint paths for symmetric networks where all paths are shortest. The algorithm presented in this paper outperforms other algorithms in finding not only the disjoint paths but shortest and maximal disjoint paths with a complexity of O(n2)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(n<^>{2})$$\end{document}. In addition, we have simulated the proposed algorithm on different networks. The solution of unsolved problem in Cube-Connected-Cycles is given in the simulation results.
Keywords:
Interconnection network
Symmetric network
Edge disjoint
Disjoint paths
Fault-tolerant
Routing
Node-to-node
Journal
C
IF:
4.1
Papers:
5.1K
Citations:
7.5K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSave
View more