COMPUTATIONAL ANALYSIS OF AN OPTIMAL ROUTING STRATEGY IN A HIERARCHICAL COMPUTER-COMMUNICATION NETWORK

The computational analysis of an optimal hierarchical routing to choos e the best communication path in a large network is demonstrated in th is 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 combi natorial problem solved using the Lagrangean relaxation and subgradien t optimization techniques. A simulation study on application of the te chnique to a number of networks is presented. The results provide vali dation of the technique as well as its usefulness in network design.