DocumentCode
1549828
Title
On computer communication network reliability under program execution constraints
Author
Kumar, Anup ; Rai, Suresh ; Agrawal, Dharma P.
Author_Institution
Dept. of Electr. & Comput. Eng., North Carolina State Univ., Raleigh, NC, USA
Volume
6
Issue
8
fYear
1988
fDate
10/1/1988 12:00:00 AM
Firstpage
1393
Lastpage
1400
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
Keywords
computer networks; reliability; software reliability; FARE; N-version programming; computer communication network; distributed systems; fast algorithm for reliability evaluation; program execution constraints; reliability; software system reliability; Banking; Computer network reliability; Computer networks; Hardware; Laboratories; Robustness; Software quality; Software systems; System software; Telecommunication network reliability;
fLanguage
English
Journal_Title
Selected Areas in Communications, IEEE Journal on
Publisher
ieee
ISSN
0733-8716
Type
jour
DOI
10.1109/49.7873
Filename
7873
Link To Document