Robustness of star graph network under link failure
The star graph is an attractive underlying topology for distributed systems. Robustness of the star graph under link failure model is addressed. Specifically, the minimum number of faulty links, f(n, k), that make every (n − k)-dimensional substar Sn−k faulty in an n-dimensional star network Sn, is studied. It is shown that f(n,1)=n+2. Furthermore, an upper bound is given for f(n, 2) with complexity of O(n3) which is an improvement over the straightforward upper bound of O(n4) derived in this paper.
Cayley graphs; Computer network resources; Fault-tolerant computing; Graph theory; Routing (Computer network management)
Computer Engineering | Digital Communications and Networking | Electrical and Computer Engineering | Engineering | Signal Processing | Systems and Communications
Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.
Robustness of star graph network under link failure.
Information Sciences, 178(3),