A useful measure of reliability in a distributed processing system (DPS) is the terminal reliability between a pair of nodes, which is the probability that at least one communication path exists between these two nodes. An interesting optimization problem is that of maximizing the terminal reliability between a pair of nodes under a given budget for improving individual components' reliabilities. Three iterative algorithms for such maximization are presented. The first two algorithms require the computation of a terminal reliability expression and are therefore efficient for only small networks. The third algorithm, which is developed for larger DPSs, does not require the evaluation of the terminal reliability expression; this algorithm maximizes an approximate objective function and gives fairly accurate results. Several examples illustrate this approximate maximization algorithm, and the error involved is estimated.
|Original language||English (US)|
|Title of host publication||Unknown Host Publication Title|
|Number of pages||9|
|State||Published - Dec 1 1984|
ASJC Scopus subject areas
- Hardware and Architecture
- Computer Networks and Communications