A loop-free path-finding algorithm: specification, verification and complexity
- 19 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1197-1205
- https://doi.org/10.1109/infcom.1995.515998
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- LIBRA: a distributed routing algorithm for large internetsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Loop-free routing using diffusing computationsIEEE/ACM Transactions on Networking, 1993
- Distributed routing with labeled distancesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- OSPF Version 2Published by RFC Editor ,1991
- Another adaptive distributed shortest path algorithmIEEE Transactions on Communications, 1991
- A loop-free extended Bellman-Ford routing protocol without bouncing effectACM SIGCOMM Computer Communication Review, 1989
- Routing Information ProtocolPublished by RFC Editor ,1988
- A Failsafe Distributed Routing ProtocolIEEE Transactions on Communications, 1979