Open AccessProceedings Article
A Fault-Tolerant Routing Algorithm for Star Graph Interconnection Network.
Sumit Sur,Pradip K. Srimani +1 more
- pp 267-270
TLDR
A performance comparison between the star and hypercube graph using the unsafety vectors routing algorithm under different working conditions reveals that the hypercube is of superior performance compared to the star graph in the presence of low fault rates, but its performance under high fault rates falls short of that of the stargraph.Abstract:
This paper presents a fault tolerant routing algorithm for the star graph. The suggested algorithm is based on the concept of unsafety vectors, originally proposed for hypercubes. In this algorithm, each node starts by computing a first level unsafety set, composed of the set of unreachable neighbors. It then performs some exchanges with its neighbors to determine the unsafety nodes. After that, all nodes have the addresses of all faulty nodes. Based on the information gathered in each node, faulttolerant routing between a source node and a destination node is realized. We conducted a performance comparison between the star and hypercube graph using the unsafety vectors routing algorithm under different working conditions. The results obtained through simulation experiments reveal that the hypercube is of superior performance compared to the star graph in the presence of low fault rates. But its performance under high fault rates falls short of that of the star graph.read more
Citations
More filters
Journal ArticleDOI
On Some Properties and Algorithms for the Star and Pancake Interconnection Networks
Q. Ke,Selim G. Akl,Henk Meijer +2 more
TL;DR: A number of results in connection with the star and pancake networks are presented and graph theoretic properties are examined and algorithms for solving several problems on them are derived.
Journal ArticleDOI
A routing and broadcasting scheme on faulty star graphs
TL;DR: 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 and provides a performance analysis for the case where an optimal path does not exist.
Journal ArticleDOI
Generalized measures for fault tolerance of star networks
TL;DR: The result gives an affirmative answer to the conjecture that, for any integers n and k with 0i¾?ki½?n-2, at least k+1!n-k-1 vertices or edges have to be removed from an n-dimensional star graph to make it disconnected with no vertices of degree less than k.
Journal ArticleDOI
A study of fault tolerance in star graph
TL;DR: The bounds on f(n,k), the number of faulty nodes to make every (n-k)-dimensional substar S"n"-"k in an n-dimensional star network S" n, have been derived.
Journal ArticleDOI
Robustness of star graph network under link failure
TL;DR: An upper bound is given for f(n,2) with complexity of O(n^3) which is an improvement over the straightforward upper bound of O (n^4) derived in this paper.
References
More filters
Proceedings Article
A Group Theoretic Model for Symmetric Interconnection Networks.
TL;DR: The Cayley graph model as discussed by the authors is a formal group-theoretic model for designing, analyzing, and improving such networks, which enables the authors to design networks based on representations of finite groups.
Journal ArticleDOI
A routing and broadcasting scheme on faulty star graphs
TL;DR: 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 and provides a performance analysis for the case where an optimal path does not exist.
Journal ArticleDOI
On Group Graphs and Their Fault Tolerance
Akers,Krishnamurthy +1 more
TL;DR: It is shown that while these graphs possess many properties desirable in all interconnection networks, their diversity allows the generation of inter connection networks which may be optimized with regard to a variety of specific parameters.
Journal ArticleDOI
Fault tolerant routing in the star and pancake interconnection networks
TL;DR: It is proved that if Sn is the n-star graph then for any minimal length routing ρ diameter D(R(Sn,ρ)/F) is at most 3, as long as |F|