### 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 language | English |
---|---|

Pages (from-to) | 63-70 |

Number of pages | 8 |

Journal | IEEE Transactions on Reliability |

Volume | 42 |

Issue number | 1 |

DOIs | |

Publication status | Published - 1993 Mar |

### Fingerprint

### All Science Journal Classification (ASJC) codes

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

### Cite this

*IEEE Transactions on Reliability*,

*42*(1), 63-70. https://doi.org/10.1109/24.210272

}

*IEEE Transactions on Reliability*, vol. 42, no. 1, pp. 63-70. https://doi.org/10.1109/24.210272

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

Research output: Contribution to journal › Article

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 -