Near-optimal message routing and broadcasting in faulty hypercubes
International Journal of Parallel Programming
Incomplete Star: An Incrementally Scalable Network Based on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Embedding an Arbitrary Binary Tree into the Star Graph
IEEE Transactions on Computers
Matrix Decomposition on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Optimal Parallel Routing in Star Networks
IEEE Transactions on Computers
Fault Tolerant Algorithms for Broadcasting on the Star Graph Network
IEEE Transactions on Computers
IEEE Transactions on Computers
Neighborhood Information Dissemination in the Star Graph
IEEE Transactions on Computers
Study of general incomplete star interconnection networks
Journal of Computer Science and Technology
Building a Multicasting Tree in a High-Speed Network
IEEE Concurrency
Toward Optimal Broadcast in a Star Graph Using Multiple Spanning Trees
IEEE Transactions on Computers
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
Strong Fault-Tolerance: Parallel Routing in Networks with Faults
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Reliable Communication in Faulty Star Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
On Strong Menger-Connectivity of Star Graphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Fault tolerance on star graphs
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Node-ranking schemes for the star networks
Journal of Parallel and Distributed Computing
A faster algorithm for solving linear algebraic equations on the star graph
Journal of Parallel and Distributed Computing
On strong Menger-connectivity of star graphs
Discrete Applied Mathematics
Conditional fault-tolerant hamiltonicity of star graphs
Parallel Computing
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
Theoretical Computer Science
Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
Information Sciences: an International Journal
Fault-free longest paths in star networks with conditional link faults
Theoretical Computer Science
Optimal fault-tolerant Hamiltonicity of star graphs with conditional edge faults
The Journal of Supercomputing
Properties of a hierarchical network based on the star graph
Information Sciences: an International Journal
Edge-bipancyclicity of star graphs with faulty elements
Theoretical Computer Science
Fault tolerant routing in star graphs using fault vector
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Adaptive fault tolerant routing in star graph
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
An efficient circuit–switched broadcasting in star graph
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Hi-index | 15.00 |
The authors present a routing algorithm that uses the depth first search approach combined with a backtracking technique to route messages on the star graph in the presence of faulty links. The algorithm is distributed and requires no global knowledge of faults. The only knowledge required at a node is the state of its incident links. The routed message carries information about the followed path and the visited nodes. The algorithm routes messages along the optimal, i.e., the shortest path if no faults are encountered or if the faults are such that an optimal path still exists. In the absence of an optimal path, the algorithm always finds a path between two nodes within a bounded number of hops if the two nodes are connected. Otherwise, it returns the message to the originating node. The authors provide a performance analysis for the case where an optimal path does not exist. They prove that for a maximum of n-2 faults on a graph with N=n! nodes, at most 2i+2 steps are added to the path, where i is O( square root n). Finally, they use the routing algorithm to present an efficient broadcast algorithm on the star graph in the presence of faults.