Back close

Computational analysis of an optimal routing strategy in a hierarchical computer communication network

Publication Type : Journal Article

Publisher : Computer Communications

Source : Computer Communications”, vol. 18, no 7, ’95, p507-11, UK

Url : https://www.sciencedirect.com/science/article/abs/pii/014036649594377N

Campus : Amritapuri

School : School of Computing

Year : 1995

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.

Cite this Research Publication : A. Mukherjee and D. Saha, “Computational analysis of an optimal routing strategy in a hierarchical computer communication network, Computer Communications”, vol. 18, no 7, ’95, p507-11, UK

Admissions Apply Now