Hierarchical routing using link vectors
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (0743166X) , 702-710
- https://doi.org/10.1109/infcom.1998.665092
Abstract
An area-based link-vector algorithm (ALVA) is introduced for the distributed maintenance of routing information in very large internetworks. According to ALVA, destinations in an internetwork are aggregated in areas in multiple levels of hierarchy. Routers maintain a database that contains a subset of the topology at each level of the hierarchy. This subset corresponds to those links used in preferred paths to reach destinations (nodes inside the same immediate area or remote areas). The ALVA is the first hierarchical routing algorithm based on link-state information that does not require complete topology information at each level in the hierarchy. The correctness of the ALVA is verified. Simulation results are presented showing that the ALVA outperforms the OSPF in terms of communication and storage overhead.Keywords
This publication has 10 references indexed in Scilit:
- How to model an internetworkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An analysis of Internet inter-domain topology and route stabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Loop-free Internet routing using hierarchical routing treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A path-finding algorithm for loop-free routingIEEE/ACM Transactions on Networking, 1997
- The viewserver hierarchy for interdomain routing: protocols and evaluationIEEE Journal on Selected Areas in Communications, 1995
- Distributed, scalable routing based on vectors of link statesIEEE Journal on Selected Areas in Communications, 1995
- A protocol for route establishment and packet forwarding across multidomain internetsIEEE/ACM Transactions on Networking, 1993
- An adaptive hierarchical routing protocolIEEE Transactions on Computers, 1989
- The landmark hierarchy: a new hierarchy for routing in very large networksACM SIGCOMM Computer Communication Review, 1988
- Hierarchical routing for large networks Performance evaluation and optimizationComputer Networks (1976), 1977