1. © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10 Sandra Coleman, CCNA, CCAI

2. ITE PC v4.0 Chapter 1 2 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Objectives  Describe the basic features & concepts of link-state routing protocols.  List the benefits and requirements of link-state routing protocols.  Distance vector routing protocols are like using road signs to guide you on your way to a destination, only giving you information about distance and direction.  However, link-state routing protocols are like using a map. With a map, you can see all of the potential routes and determine your own preferred path.

3. ITE PC v4.0 Chapter 1 3 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing  Link state routing protocols (OSPF, IS-IS) - Also known as shortest path first (SPF) algorithms -These protocols built around Dijkstra’s SPF -More complex than distance vector

4. ITE PC v4.0 Chapter 1 4 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing Dikjstra’s algorithm also known as the shortest path first (SPF) algorithm

5. ITE PC v4.0 Chapter 1 5 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing  The shortest path to a destination is not necessarily the path with the least number of hops – it is the lowest cost!

6. ITE PC v4.0 Chapter 1 6 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing Process  How routers using Link State Routing Protocols reach convergence 1.Each router learns about its own directly connected networks (interfaces are UP) 2.Link state routers exchange hello packet to “meet” other directly connected link state routers. 3.Each router builds its own Link State Packet (LSP) which includes information about neighbors such as neighbor ID, link type, & bandwidth. 4.After the LSP is created the router floods it to all neighbors who then store the information and then forward it until all routers have the same information. 5.Once all the routers have received all the LSPs, the routers then construct a topological map of the network which is used to determine the best routes to a destination

7. ITE PC v4.0 Chapter 1 7 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing Process – Step 1  Directly Connected Networks  Link- an interface on a router (IP address, subnet mask, and must be UP)  Link state- This is the information about the state of the links

8. ITE PC v4.0 Chapter 1 8 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing Process – step 2 Sending Hello Packets to Neighbors  Link state routing protocols use a hello protocol  Purpose of a hello protocol: To discover neighbors (that use the same link state routing protocol) on its link

9. ITE PC v4.0 Chapter 1 9 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing Process – Step 2 Sending Hello Packets to Neighbors  Connected interfaces that are using the same link state routing protocols will exchange hello packets.  Once routers learn it has neighbors they form an adjacency -2 adjacent neighbors will exchange hello packets -These packets will serve as a keep alive function

10. ITE PC v4.0 Chapter 1 10 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing Process – Step 3 Building the Link State Packet  Each router builds its own Link State Packet (LSP) Contents of LSP: -State of each directly connected link -Includes information about neighbors such as neighbor ID, link type, & bandwidth (cost).

11. ITE PC v4.0 Chapter 1 11 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing Process – step 4 Flooding LSPs to Neighbors  Once LSP are created they are forwarded out to neighbors. After receiving the LSP, the neighbor immediately continues to forward it throughout routing area.

12. ITE PC v4.0 Chapter 1 12 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing Process – step 4  LSPs are sent out under the following conditions -Initial router start up or routing process -When there is a change in topology

13. ITE PC v4.0 Chapter 1 13 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing Process – step 5 Constructing a link state data base  Routers use a database to construct a topology map of the network using the SPF algorithm to compute the best path to each destination network.

14. ITE PC v4.0 Chapter 1 14 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing – SPF Tree

15. ITE PC v4.0 Chapter 1 15 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing Shortest Path First (SPF) Tree  Building a portion of the SPF tree – to do this, all link- state databases on every link-state router have to be identical! Process begins by examining R2’s LSP information -R1 ignores 1st LSP Reason: R1 already knows it’s connected to R2

16. ITE PC v4.0 Chapter 1 16 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing  Building a portion of the SPF tree -R1 uses 2nd LSP Reason: R1 can create a link from R2 to R5. This information is added to R1’s SPF tree

17. ITE PC v4.0 Chapter 1 17 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing  Building a portion of the SPF tree -R1 uses 3rd LSP  Reason: R1 learns that R2 is connected to 10.5.0.0/16.  This link is added to R1’s SPF tree.

18. ITE PC v4.0 Chapter 1 18 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing  Determining the shortest path The shortest path to a destination determined by adding the costs & finding the lowest cost

19. ITE PC v4.0 Chapter 1 19 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing  Once the SPF algorithm has determined the shortest path routes, these routes are placed in the routing table.

20. ITE PC v4.0 Chapter 1 20 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Advantages of a Link-State Routing Protocol Routing protocol Builds Topological map Router can independently determine the shortest path to every network. Convergence A periodic/ event driven routing updates Use of LSP Distance vector No SlowGenerally NoNo Link StateYes FastGenerally YesYes Why is convergence faster? Triggered updates, not periodic updates! Routing loops? No, because every router has a map of the entire network – synchronized and complete!

21. ITE PC v4.0 Chapter 1 21 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing Protocols Requirements for using a link state routing protocol  Memory requirements Typically link state routing protocols use more memory  Processing Requirements More CPU processing is required of link state routing protocols  Bandwidth Requirements Initial startup of link state routing protocols can consume lots of bandwidth, then less bandwidth is required to do updates.

22. ITE PC v4.0 Chapter 1 22 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Minimizing processing/memory usage…  Split routing topologies into smaller areas. This will be discussed in CCNP..not here.

23. ITE PC v4.0 Chapter 1 23 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Link-State Routing Protocols  2 link state routing protocols used for routing IP -Open Shortest Path First (OSPF) -Intermediate System-Intermediate System (IS-IS)

24. ITE PC v4.0 Chapter 1 24 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Summary  Link State Routing protocols are also known as Shortest Path First protocols  Summarizing the link state process -Routers 1ST learn of directly connected networks -Routers then say “hello” to neighbors -Routers then build link state packets -Routers then flood LSPs to all neighbors -Routers use LSP database to build a network topology map & calculate the best path to each destination

25. ITE PC v4.0 Chapter 1 25 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Summary  Link An interface on the router  Link State Information about an interface such as -IP address -Subnet mask -Type of network -Cost associated with link -Neighboring routers on the link

26. ITE PC v4.0 Chapter 1 26 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Summary  Link State Packets After initial flooding, additional LSP are sent out when a change in topology occurs  Examples of link state routing protocols -Open shortest path first -IS-IS

27. ITE PC v4.0 Chapter 1 27 © 2007 Cisco Systems, Inc. All rights reserved.Cisco Public Ch. 10 is finito! 1.Now – do the online quiz before leaving class until you get them all correct… show me. This is for your study guide grade! 2.Study guide – none 3.Labs – none 4.Online Test – take by midnight, Tuesday, April 9, 2013 5.Lecture – We will lecture next class! 6.Test – NOW!