Publication

Abstract : The computational analysis of an optimal hierarchical routing to choose the best communication path in a large network is demonstrated in this paper. A scheme is also provided for selecting the optimal route in a hierarchical computer communication network. The problem of optimal routing in a hierarchical network is formulated as a non-linear combinatorial problem solved using the Lagrangean relaxation and subgradient optimization techniques. A simulation study on application of the technique to a number of networks is presented. The results provide validation of the technique as well as its usefulness in network design.