Abstract
In folded cube computer network, we developed a new algorithm for fault-tolerant routing which is based on detour and backtracking techniques. Its performance is analyzed in detail in the presence of an arbitrary number of components being damaged and derived some exact expressions for the probability of routing messages via optimal paths from the source to obstructed node. The probability of routing messages via an optimal path between any two nodes is a special case of our results, and can be obtained by replacing the obstructed node with the destination node. It is also showed that in the presence of component failures this algorithm can route messages via an optimal path to its destination with a very high probability. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Hongmei, L. (2007). A performance guaranteed new algorithm for fault-tolerant routing in folded cubes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4613 LNCS, pp. 236–243). Springer Verlag. https://doi.org/10.1007/978-3-540-73814-5_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
