๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Topological optimization of computer network expansion with reliability constraint

โœ Scribed by Fang-Ming Shao; Lian-Chang Zhao

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
447 KB
Volume
35
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper considers an optimization of a computer network expansion with a reliability constraint. Computer network expansion is achieved by adding a new node and communication links to a computer network such that reliability of the computer network is not less than a given level. In order to speed up the procedure of solution, an upper bound on system reliability in terms of node degrees is applied. The main problem is split into several small problems, the small problem is decomposed subpmblems and the subproblems are solved effectively by a new method, forest search algorithm.

๐Ÿ“œ SIMILAR VOLUMES

Managing the Topological Expansion of Co
Managing the Topological Expansion of Computer Networks in an Optimal Way
โœ Debashis Saha; Amitava Mukherjee ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 453 KB ๐Ÿ‘ 2 views

This article describes a subgradient-based near-optimal heuristic algorithm designed for minimizing the search of links that need to be added to an existing telecommunications network to enhance the survivability and routability of the network.

Topological optimization models for comm
Topological optimization models for communication network with multiple reliability goals
โœ Baoding Liu; K. Iwamura ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 563 KB

Network reliability models for determining optimal network topology have been presented and solved by many researchers. This paper presents some new types of topological optimization model for communication network with multiple reliability goals. A stochastic simulation-based ~enetic algorithm is a