Topological optimization problem of communication networks subject to a reliability constraint

Author

Jan, Rong-Hong ; Hwang, Fung-Jen

Author_Institution

Dept. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan

fYear

1990

fDate

3-7 Jun 1990

Firstpage

487

Abstract

The objective is to find the topological layout of links at a minimal cost under the constraint that the overall reliability of the constructed network is not less than a given level of system reliability. A decomposition method which is based on a branch-and-bound approach is proposed for solving it. A method is presented to determine a lower bound on the minimum number of links in a network which may satisfy the reliability constraint. The solution method is illustrated with a numerical example, and computational experiments are also given

Keywords

optimisation; reliability theory; telecommunications computing; branch-and-bound approach; communication networks; computational experiments; decomposition method; reliability constraint; topological optimisation problem; Communication networks; Computer network reliability; Computer networks; Constraint optimization; Costs; Design optimization; Large-scale systems; Network topology; Spine; Telecommunication network reliability;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '90, Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. The Multiple Facets of Integration. Proceedings, IEEE

Conference_Location

San Francisco, CA

Print_ISBN

0-8186-2049-8

Type

conf

DOI

10.1109/INFCOM.1990.91286

Filename

91286