Hierarchical Interconnection Networks for Multicomputer Systems
IEEE Transactions on Computers
Topological design of a distributed computer communication network in a noisy environment
Computer Communications
Fiberoptic circuit network design under reliability constraints
IEEE Journal on Selected Areas in Communications
Computer-aided design procedures for survivable fiber optic networks
IEEE Journal on Selected Areas in Communications
A Simple Heuristic for Assignment of Cells to Switches in a PCS Network
Wireless Personal Communications: An International Journal
Agglomerative hierarchical approach for location area planning in a PCSN
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Research: An efficient link enhancement strategy for computer networks using genetic algorithm
Computer Communications
On the multidensity gateway location problem for a multilevel high speed internetwork
Computer Communications
| Hi-index | 0.24 |
The problem of selecting link capacities for different link failure probabilities in a hierarchical network is considered. Given a finite set of nodes, links and link failure probabilities, the goal is to obtain the set of link capacities in order to minimize the total design cost. A mathematical model for this problem has been formulated. The set of feasible solutions for this non-linear combinatorial optimization problem has been obtained using Lagrangean relaxation and sub-gradient optimization techniques. The applicability of the proposed formulation has been demonstrated by designing a two-level hierarchical computer communication network, and the corresponding computational results have also been reported. It has been found that the hierarchical design improves the cost efficiency upon the nonhierarchical design by an appreciable factor.