期刊
INFORMATION SCIENCES
卷 178, 期 3, 页码 802-806出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2007.09.013
关键词
distributed systems; interconnection networks; link failure; permutation; reliability; star graph
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据