ON COMPUTER-COMMUNICATION NETWORK RELIABILITY UNDER PROGRAM EXECUTION CONSTRAINTS

被引：38

作者：

KUMAR, A ^{[1
]}

RAI, S ^{[1
]}

AGRAWAL, DP ^{[1
]}

机构：

[1] UNIV ROORKEE,ROORKEE 247667,UTTAR PRADESH,INDIA

来源：

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS | 1988年 / 6卷 / 08期

关键词：

COMPUTER NETWORKS -- Reliability - COMPUTER SOFTWARE -- Reliability - DATA PROCESSING -- Financial Applications;

D O I：

10.1109/49.7873

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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 solve 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.

引用

页码：1393 / 1400

页数：8

共 15 条

[1] RELIABILITY EVALUATION IN COMPUTER-COMMUNICATION NETWORKS [J].

AGGARWAL, KK ;

RAI, S .

IEEE TRANSACTIONS ON RELIABILITY, 1981, 30 (01) :32-35

[2]

Agrawal D., 1986, ADV COMPUTER ARCHITE

[3]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[4]

FAIRLY R, 1979, SOFTWARE ENG CONCEPT

[5]

GRNAROV A, 1981, 1981 P INT C PAR PRO, P79

[6]

KOPETZ H, 1979, SOFTWARE RELIABILITY

[7]

KUMAR A, 1988, INFOCOM

[8]

MERWIN RW, 1980, MAY P NAT COMP C, P139

[9]

PRASANNA VK, 1986, IEEE T SOFTWARE ENG, V12, P42

[10]

RAI S, UNPUB IEEE T SOFTW E

← 1 2 →