RELIABILITY OPTIMIZATION IN THE DESIGN OF DISTRIBUTED SYSTEMS.

C. S. Raghavendra, Salim A Hariri

Research output: Contribution to journalArticle

17 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)1184-1193
Number of pages10
JournalIEEE Transactions on Software Engineering
VolumeSE-11
Issue number10
StatePublished - Nov 1985
Externally publishedYes

Fingerprint

Communication

ASJC Scopus subject areas

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

Cite this

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

In: IEEE Transactions on Software Engineering, Vol. SE-11, No. 10, 11.1985, p. 1184-1193.

Research output: Contribution to journalArticle

@article{bbefabdec77b4b918488b97fdd804bba,
title = "RELIABILITY OPTIMIZATION IN THE DESIGN OF DISTRIBUTED SYSTEMS.",
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.",
author = "Raghavendra, {C. S.} and Hariri, {Salim A}",
year = "1985",
month = "11",
language = "English (US)",
volume = "SE-11",
pages = "1184--1193",
journal = "IEEE Transactions on Software Engineering",
issn = "0098-5589",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

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 -