Topology distribution cost vs. efficient routing in large networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
On sparse spanners of weighted graphs
Discrete & Computational Geometry
Routing in communications networks
Routing in communications networks
Routing through networks with hierarchical topology aggregation
Journal of High Speed Networks
QoS routing in networks with inaccurate information: theory and algorithms
IEEE/ACM Transactions on Networking (TON)
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Crankback Prediction in Hierarchical ATM Networks
Journal of Network and Systems Management
Hi-index | 0.24 |
Networks deploying hierarchical routing are recursively partitioned into sub-networks that do not reveal full details of their internal structure outside their domains. Instead, an aggregated view of certain parameters that are associated with traversal within such sub-networks between their border nodes is advertised. The ATM PNNI standard and the Internet Nimrod architecture both adopt this approach for routing. This paper studies the effectiveness of ATM hierarchical routing protocols on networks with different hierarchical structures by simulation. Our study shows that, in general, the hierarchical source routing performs well, compared to the global routing strategy which imposes no hierarchy, while utilizing less storage and communication overheads. For certain networks and topologies, the hierarchical routing performs better than the global routing. Different hierarchies imposed on the same topologies have significantly different performance on the throughput and routing delay. This suggests the necessity of studying the hierarchy design for communication networks using hierarchical routing.