Loop-free Internet routing using hierarchical routing trees
- 22 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 101-108
- https://doi.org/10.1109/infcom.1997.635119
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A more efficient path-finding algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Area-based, loop-free internet routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A path-finding algorithm for loop-free routingIEEE/ACM Transactions on Networking, 1997
- RIP Version 2 - Carrying Additional InformationPublished by RFC Editor ,1994
- Another adaptive distributed shortest path algorithmIEEE Transactions on Communications, 1991
- A new responsive distributed shortest-path rounting algorithmPublished by Association for Computing Machinery (ACM) ,1989
- A loop-free extended Bellman-Ford routing protocol without bouncing effectPublished by Association for Computing Machinery (ACM) ,1989
- Routing of multipoint connectionsIEEE Journal on Selected Areas in Communications, 1988
- Reducing Routing Overhead in a Growing DDNPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Establishing virtual circuits in large computer networksComputer Networks and ISDN Systems, 1986