Publication

Abstract : 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.