April 22, 2014
Cisco Networks – EIGRP versus OSPF
Categories | EIGRP | OSPF |
Type | Advanced Distance Vector | Link – State |
Metric | Composite | Cost |
Administrative Distance | 120 | 110 |
Algorithm | SPF Algorithm fast convergence loop free hop based. Bellman – Ford | Dual algorithm could be in status, query out the whole network shortest path. |
Protocol | USP | IP |
Topology | Can build a hierarchical and scalable network. | Cannot build a hierarchical network with this protocol. |
The Enhanced Interior Gateway Routing Protocol (EIGRP) is an advanced distance – vector routing protocol that is used on a computer network to help automate ...view middle of the document...
Periodically checks if a route is available and propagates routing changes to neighboring routers if a changes have occurred. The last feature of EIGRP is backwards compatibility with the IGRP protocols.
OSPF-enabled routers use the Shortest Path First (SPF) algorithm to compute the shortest path between nodes on an internetwork. They create a map called the link state database that describes the topology or structure of the router’s specific network area. Network areas are groups of networks connected using OSPF-enabled routers that all have router interfaces for any of the networks included in the area. Areas typically have no more than about 30 or 40 routers and are connected to each other through a designated high-speed contiguous backbone area using area border routers (ABRs). OSPF areas simplify computation of link state information because the computational requirements of calculating link state information rise rapidly as the size and complexity of the network increase. With OSPF areas, each router need maintain only link state information about its own area and other areas connected to it, which improves the scalability of OSPF. The link state information stored in the database (routing table) of each router includes cost information in addition to hop information. Administrators can configure...