Topological Optimization of a Communication Network Subject to a Reliability Constraint

Rong Hong Jan, Fung Jen Hwang, Sheng Tzong Cheng

Research output: Contribution to journalArticle

121 Citations (Scopus)

Abstract

This paper considers network topological optimization with a reliability constraint. The objective is to find the topological layout of links, at a minimal cost, under the constraint that the network reliability is not less than a given level of system reliability. A decomposition method, based on branch & bound, is used for solving the problem. In order to speed-up the procedure, an upper bound on system reliability in terms of node degrees is applied. A numerical example illustrates, and shows the effectiveness of the method. If a*, an important parameter, is close to the minimal number of links in a network which satisfy the reliability constraint, then a better starting solution can be obtained, and many searching steps can be saved. In our method, the lower bound a* is close to its actual value if the operational reliability of the link is close enough to 1. Also, if we can find the maximal increasing value of the reliability when a set of links is added to a specified topology, the efficiency of the branch & bound algorithm is improved.

Original languageEnglish
Pages (from-to)63-70
Number of pages8
JournalIEEE Transactions on Reliability
Volume42
Issue number1
DOIs
Publication statusPublished - 1993 Mar

Fingerprint

Telecommunication networks
Topology
Decomposition
Costs

All Science Journal Classification (ASJC) codes

  • Safety, Risk, Reliability and Quality
  • Electrical and Electronic Engineering

Cite this

@article{27a171ccb2ee4e5783197cee8d8eb8e4,
title = "Topological Optimization of a Communication Network Subject to a Reliability Constraint",
abstract = "This paper considers network topological optimization with a reliability constraint. The objective is to find the topological layout of links, at a minimal cost, under the constraint that the network reliability is not less than a given level of system reliability. A decomposition method, based on branch & bound, is used for solving the problem. In order to speed-up the procedure, an upper bound on system reliability in terms of node degrees is applied. A numerical example illustrates, and shows the effectiveness of the method. If a*, an important parameter, is close to the minimal number of links in a network which satisfy the reliability constraint, then a better starting solution can be obtained, and many searching steps can be saved. In our method, the lower bound a* is close to its actual value if the operational reliability of the link is close enough to 1. Also, if we can find the maximal increasing value of the reliability when a set of links is added to a specified topology, the efficiency of the branch & bound algorithm is improved.",
author = "Jan, {Rong Hong} and Hwang, {Fung Jen} and Cheng, {Sheng Tzong}",
year = "1993",
month = "3",
doi = "10.1109/24.210272",
language = "English",
volume = "42",
pages = "63--70",
journal = "IEEE Transactions on Reliability",
issn = "0018-9529",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

Topological Optimization of a Communication Network Subject to a Reliability Constraint. / Jan, Rong Hong; Hwang, Fung Jen; Cheng, Sheng Tzong.

In: IEEE Transactions on Reliability, Vol. 42, No. 1, 03.1993, p. 63-70.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Topological Optimization of a Communication Network Subject to a Reliability Constraint

AU - Jan, Rong Hong

AU - Hwang, Fung Jen

AU - Cheng, Sheng Tzong

PY - 1993/3

Y1 - 1993/3

N2 - This paper considers network topological optimization with a reliability constraint. The objective is to find the topological layout of links, at a minimal cost, under the constraint that the network reliability is not less than a given level of system reliability. A decomposition method, based on branch & bound, is used for solving the problem. In order to speed-up the procedure, an upper bound on system reliability in terms of node degrees is applied. A numerical example illustrates, and shows the effectiveness of the method. If a*, an important parameter, is close to the minimal number of links in a network which satisfy the reliability constraint, then a better starting solution can be obtained, and many searching steps can be saved. In our method, the lower bound a* is close to its actual value if the operational reliability of the link is close enough to 1. Also, if we can find the maximal increasing value of the reliability when a set of links is added to a specified topology, the efficiency of the branch & bound algorithm is improved.

AB - This paper considers network topological optimization with a reliability constraint. The objective is to find the topological layout of links, at a minimal cost, under the constraint that the network reliability is not less than a given level of system reliability. A decomposition method, based on branch & bound, is used for solving the problem. In order to speed-up the procedure, an upper bound on system reliability in terms of node degrees is applied. A numerical example illustrates, and shows the effectiveness of the method. If a*, an important parameter, is close to the minimal number of links in a network which satisfy the reliability constraint, then a better starting solution can be obtained, and many searching steps can be saved. In our method, the lower bound a* is close to its actual value if the operational reliability of the link is close enough to 1. Also, if we can find the maximal increasing value of the reliability when a set of links is added to a specified topology, the efficiency of the branch & bound algorithm is improved.

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

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

U2 - 10.1109/24.210272

DO - 10.1109/24.210272

M3 - Article

AN - SCOPUS:0027555824

VL - 42

SP - 63

EP - 70

JO - IEEE Transactions on Reliability

JF - IEEE Transactions on Reliability

SN - 0018-9529

IS - 1

ER -