Routing management in very large-scale networks
Future Generation Computer Systems
The landmark hierarchy: a new hierarchy for routing in very large networks
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Hierarchical Interconnection Networks for Multicomputer Systems
IEEE Transactions on Computers
Research note: Capacity assignment in computer communication networks with unreliable links
Computer Communications
Research note: Design of hierarchical communication networks under node/link failure constraints
Computer Communications
Distributed dynamic routing schemes
IEEE Communications Magazine
Markov decision algorithms for dynamic routing [telephone networks]
IEEE Communications Magazine
Dynamic routing schemes for international networks
IEEE Communications Magazine
Performance evaluation of routing algorithms under various network configuration parameters
International Journal of Network Management
Research: An efficient link enhancement strategy for computer networks using genetic algorithm
Computer Communications
| Hi-index | 0.24 |
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.