By Topic

Topological optimization problem of communication networks subject to a reliability constraint

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rong-Hong Jan ; Dept. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Fung-Jen Hwang

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

Published in:

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

Date of Conference:

3-7 Jun 1990