On computer communication network reliability under program execution constraints

  • Authors:

  • A. Kumar;S. Rai;D. P. Agrawal

  • Affiliations:

  • Dept. of Electr. & Comput. Eng., North Carolina State Univ., Raleigh, NC;-;-

  • Venue:
  • IEEE Journal on Selected Areas in Communications
  • Year:
  • 2006

Quantified Score

Hi-index 0.07

Visualization

Abstract

The authors propose a technique to compute software system reliability (SSR). The method, called FARE (fast algorithm for reliability evaluation), does not require a priori knowledge of multiterminal connections (MCs) for computing the reliability expression. An effort is made to sole the problem of N-version programming by using the FARE approach. Owing to its short execution time and low memory requirement, FARE can be used to calculate the SSR of fairly large distributed systems