A loop-free extended Bellman-Ford routing protocol without bouncing effect
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A new responsive distributed shortest-path rounting algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A path-finding algorithm for loop-free routing
IEEE/ACM Transactions on Networking (TON)
Design considerations for large computer communication networks.
Design considerations for large computer communication networks.
A path-finding algorithm for loop-free routing
IEEE/ACM Transactions on Networking (TON)
Transmission-efficient routing in wireless networks using link-state information
Mobile Networks and Applications
Reliability constrained routing in QoS networks
IEEE/ACM Transactions on Networking (TON)
Study of MANET routing protocols by GloMoSim simulator
International Journal of Network Management
A framework for evaluating the performance of cluster algorithms for hierarchical networks
IEEE/ACM Transactions on Networking (TON)
Two-layer hierarchical wavelength routing for islands of transparency optical networks
Computer Communications
New theoretical studies and optimal cluster-population determination for hierarchical networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Extending address space of IP networks with hierarchical addressing
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
| Hi-index | 0.00 |
We present a new hierarchical routing algorithm that combines the loop-free path-finding algorithm (LPA) with the area-based hierarchical routing scheme first proposed by McQuillan for distance-vector algorithms. The new algorithm, which we call the Hierarchical Information Path-based Routing (HIPR) algorithm, accommodates an arbitrary number of aggregation levels and can be viewed as a distributed version of Dijkstra's algorithm running over a hierarchical graph. HIPR is verified to be loop-free and correct. Simulations are used to show that HIPR is much more efficient than OSPF in terms of speed, communication and processing overhead required to converge to correct routing tables. HIPR constitutes the basis for future Internet routing protocols that are as simple as RIPv2, but with no looping and better performance than protocols based on link-states.