Robustness of star graph network under link failure |
| |
Authors: | Shahram Latifi Ebrahim Saberinia |
| |
Affiliation: | ECE Department, UNLV, Las Vegas, NV 89154-4026, United States |
| |
Abstract: | 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. |
| |
Keywords: | Distributed systems Interconnection networks Link failure Permutation Reliability Star graph |
本文献已被 ScienceDirect 等数据库收录! |
|