1 / 14

Link State Routing

Link State Routing. Introduction. Link-state routing protocols perform in a very different way from distance vector protocols Link-state routing algorithms maintain a complex database of topology information

joanne
Download Presentation

Link State Routing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Link State Routing

  2. Introduction • Link-state routing protocols perform in a very different way from distance vector protocols • Link-state routing algorithms maintain a complex database of topology information • distance vector algorithm has nonspecific information about distant networks and no knowledge of distant routers

  3. Link State Features • Uses hello information and LSAs it receives from other routers to build a database about the network • Uses shortest path first (SPF) algorithm to calculate the shortest route to each network • Stores route information in its routing table

  4. Advantages • use cost metrics to choose paths through the network - reflects the capacity of the links on those paths • use triggered, flooded updates - leads to fast convergence times • difficult for routing loops to occur • always use the latest set of information on which to base their routing • database sizes can be minimized with careful network design - leads to faster convergence • Easier for troubleshooting. • Classless interdomain routing (CIDR) and variable-length subnet masking (VLSM) are supported

  5. Disadvantages • require more memory and processing power than distance vector routers • require strict hierarchical network design to reduce the size of the topology tables • require an administrator with a good understanding of link-state routing • flood the network with LSAs during the initial discovery process, which decrease the capability of the network to transport data

  6. Advantages/Disadvantages

  7. distance vector vs link-state routing

  8. OSPF • link-state routing protocol based on open standards • preferred IGP protocol when compared with RIP • OSPF overcomes RIP limitations and of • limited to 15 hops • converges slowly, • sometimes chooses slow routes because it ignores critical factors such as bandwidth in route determination • robust and scalable routing protocol suitable for the networks of today

  9. Shortest Path Algorithm • used by OSPF to determine the best path to a destination • best path is the lowest cost path • All router link-state databases are identical.

  10. OSPF Network Types • Broadcast multi-access, such as Ethernet • Point-to-point networks • Nonbroadcast multi-access (NBMA), such as Frame Relay

  11. OSPF Hello Protocol • When router starts an OSPF routing process on an interface, it sends a hello packet • continues to send hellos at regular intervals • rules that govern the exchange of OSPF hello packets are called the Hello protocol.

  12. Common OSPF configuration issue • Hellos are not sent from both neighbors. • Hello and dead interval timers are not the same. • Interfaces are on different network types. • Authentication passwords or keys are different

  13. Verifying OSPF

  14. Troubleshooting OSPF

More Related