Title | ||
---|---|---|
A Fault-Free Unicast Algorithm In The Generalized Hypercube With Restricted Faulty Vertices |
Abstract | ||
---|---|---|
The generalized hypercube is a highly-connective network proposed by Bhuyan and Agrawal. In this paper, we study the restricted connectivity and fault-free unicast algorithm in the generalized hypercube. Firstly, we prove that the restricted connectivity of a r-dimensional generalized hypercube G(m(r),m(r-1),...,m(1)) is 2 kappa(G) - n, where kappa (G) denotes the connectivity of G(m(r),m(r-1),...,m(1)) and n = max {m(1),m(2),...,m(r)}, under the condition that each vertex has at least one fault-free neighbor. It is almost twice the traditional connectivity of G(m(r),m(r-1),...,m(1)). Furthermore, we present an O(kappa(G)(3)) fault-free unicast algorithm in the generalized hypercube. |
Year | DOI | Venue |
---|---|---|
2017 | 10.1142/S012905411750031 | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE |
Keywords | Field | DocType |
Connectivity, set of restricted faulty vertices, fault-free path, generalized hypercubes, interconnection networks | Discrete mathematics,Combinatorics,Vertex (geometry),Fault free,Algorithm,Unicast,Mathematics,Hypercube | Journal |
Volume | Issue | ISSN |
28 | 7 | 0129-0541 |
Citations | PageRank | References |
0 | 0.34 | 19 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Lili Guo | 1 | 11 | 7.94 |
Xi Wang | 2 | 85 | 6.56 |
Cheng-kuan Lin | 3 | 476 | 46.58 |
Jing-Ya Zhou | 4 | 64 | 16.35 |
Jianxi Fan | 5 | 718 | 60.15 |