Substar Reliability Analysis in Star Networks

  • Authors:

  • Xiaolong Wu;Shahram Latifi

  • Affiliations:

  • Department of Electrical and Computer Engineering, University of Nevada, Las Vegas, NV 89154, USA;Department of Electrical and Computer Engineering, University of Nevada, Las Vegas, NV 89154, USA

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

Quantified Score

Hi-index 0.07

Visualization

Abstract

In this paper, we derive an upper bound on the (n-1)-star reliability in an S"n using the probability fault model. Approximate (n-1)-star reliability results are also obtained using the fixed partitioning. The numerical results show that the (n-1)-star reliabilities under the probability fault model and the fixed partitioning are in good agreement especially for the low value of the node reliability. The numerical results are also shown to be consistent with and close to the simulation results. Conservative comparisons are made where possible between the reliability of similar size star graphs and hypercubes.