Journal
INFORMATION SCIENCES
Volume 178, Issue 3, Pages 802-806Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2007.09.013
Keywords
distributed systems; interconnection networks; link failure; permutation; reliability; star graph
Categories
Ask authors/readers for more resources
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 S-n, 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(n(3)) which is an improvement over the straightforward upper bound of O(n(4)) derived in this paper. (c) 2007 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available