### Abstract

A useful measure of reliability in distributed systems is the terminal reliability between a pair of nodes. This is the probability that at least one communication path exists between these nodes. An interesting optimization problem is to maximize the terminal reliability between a pair of computing elements under a given budget constraint. Three iterative algorithms for terminal reliability maximization are presented. The first two algorithms require the computation of terminal reliability expressions and are therefore efficient for only small networks. The third algorithm, which is developed for large distributed systems, does not require this computation; it maximizes approximate objective functions and gives accurate results. Several examples illustrate the approximate optimization algorithm, and the error involved is estimated.

Original language | English (US) |
---|---|

Pages (from-to) | 1184-1193 |

Number of pages | 10 |

Journal | IEEE Transactions on Software Engineering |

Volume | SE-11 |

Issue number | 10 |

State | Published - Nov 1985 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Computer Graphics and Computer-Aided Design
- Software
- Electrical and Electronic Engineering

### Cite this

*IEEE Transactions on Software Engineering*,

*SE-11*(10), 1184-1193.

**RELIABILITY OPTIMIZATION IN THE DESIGN OF DISTRIBUTED SYSTEMS.** / Raghavendra, C. S.; Hariri, Salim A.

Research output: Contribution to journal › Article

*IEEE Transactions on Software Engineering*, vol. SE-11, no. 10, pp. 1184-1193.

}

TY - JOUR

T1 - RELIABILITY OPTIMIZATION IN THE DESIGN OF DISTRIBUTED SYSTEMS.

AU - Raghavendra, C. S.

AU - Hariri, Salim A

PY - 1985/11

Y1 - 1985/11

N2 - A useful measure of reliability in distributed systems is the terminal reliability between a pair of nodes. This is the probability that at least one communication path exists between these nodes. An interesting optimization problem is to maximize the terminal reliability between a pair of computing elements under a given budget constraint. Three iterative algorithms for terminal reliability maximization are presented. The first two algorithms require the computation of terminal reliability expressions and are therefore efficient for only small networks. The third algorithm, which is developed for large distributed systems, does not require this computation; it maximizes approximate objective functions and gives accurate results. Several examples illustrate the approximate optimization algorithm, and the error involved is estimated.

AB - A useful measure of reliability in distributed systems is the terminal reliability between a pair of nodes. This is the probability that at least one communication path exists between these nodes. An interesting optimization problem is to maximize the terminal reliability between a pair of computing elements under a given budget constraint. Three iterative algorithms for terminal reliability maximization are presented. The first two algorithms require the computation of terminal reliability expressions and are therefore efficient for only small networks. The third algorithm, which is developed for large distributed systems, does not require this computation; it maximizes approximate objective functions and gives accurate results. Several examples illustrate the approximate optimization algorithm, and the error involved is estimated.

UR - http://www.scopus.com/inward/record.url?scp=0022148219&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022148219&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0022148219

VL - SE-11

SP - 1184

EP - 1193

JO - IEEE Transactions on Software Engineering

JF - IEEE Transactions on Software Engineering

SN - 0098-5589

IS - 10

ER -