 | Copyright © 2009, Juniper Networks, Inc. All rights reserved. Trademark Notice. | |
Each IGP routing protocol maintains a database of the routing information it has learned from other routers running the same protocol and uses this information as defined and required by the protocol. IS-IS and OSPF use the routing information they received to maintain link-state databases, which they use to determine which adjacent neighbors are operational and to construct network topology maps.
IS-IS and OSPF use the Dijkstra algorithm, and RIP and RIPng use the Bellman-Ford algorithm to determine the best route or routes (if there are multiple equal-cost routes) to reach each destination and install these routes into the JUNOS software routing table.
| Copyright © 2009, Juniper Networks, Inc. All rights reserved. Trademark Notice. | |