Robustness of star graph network under link failure

  • Authors:

  • Shahram Latifi;Ebrahim Saberinia;Xialong Wu

  • Affiliations:

  • ECE Department, UNLV, Las Vegas, NV 89154-4026, United States;ECE Department, UNLV, Las Vegas, NV 89154-4026, United States;ECE Department, UNLV, Las Vegas, NV 89154-4026, United States

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2008

Quantified Score

Hi-index 0.07

Visualization

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 S"n"-"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.