Establishing virtual circuits in large computer networks
Computer Networks and ISDN Systems
A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
Optimization of hierarchical routing protocols
Performance Evaluation - Special issue: ATM networks: Performance modelling and analysis
OSPF: Anatomy of an Internet Routing Protocol
OSPF: Anatomy of an Internet Routing Protocol
BGP4: Inter-Domain Routing in the Internet
BGP4: Inter-Domain Routing in the Internet
IEEE Internet Computing
Issues in routing for large and dynamic networks
Issues in routing for large and dynamic networks
Precomputation schemes for QoS routing
IEEE/ACM Transactions on Networking (TON)
Performance analysis for hierarchical multirate loss networks
IEEE/ACM Transactions on Networking (TON)
Hierarchical topological network design
IEEE/ACM Transactions on Networking (TON)
Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
| Hi-index | 0.00 |
In hierarchical routing schemes, nodes are grouped into clusters at multiple levels, and a given node sees only a summarized view of the entire network. Hierarchical routing introduces error, which is the difference between the hierarchical path length and the optimal path length using flat routing. Since in practice the routing table size at each node is limited, we formulate the constrained optimization problems of finding a hierarchy structure that minimizes either the worst case or average case routing error. We prove results characterizing solutions of these problems, and present dynamic programming solution algorithms and computational results.