1 / 40

Networks and Protocols CE00997-3

Networks and Protocols CE00997-3. Week 8b. Link state Routing. Distance Vector Verses Link State Routing Protocols. Distance Vector. Link State. Has a common view of the entire network topology Calculates shortest path to other routes Event-triggered updates – faster convergence

kris
Download Presentation

Networks and Protocols CE00997-3

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. Networks and Protocols CE00997-3 Week 8b

  2. Link state Routing

  3. Distance Vector Verses Link State Routing Protocols. Distance Vector Link State • Has a common view of the entire network topology • Calculates shortest path to other routes • Event-triggered updates – faster convergence • Passes link-state routing updates to other routers. • Views network topology from neighbour’s perspective • Adds distance vectors from router to router • Frequent, periodic updates – slow convergence. • Passes entire routing table to neighbour’s

  4. Link State Protocols. Link-state routing has the following advantages over distance vector protocols: • Quick convergence • Periodic updates • Incremental updates • Network knowledge • Link-state protocols work best in situations where: • The network design is hierarchical, usually occurring in large networks. • The administrators have a good knowledge of the implemented link-state routing protocol. • Fast convergence of the network is crucial.

  5. A link-state routing protocol maintains full knowledge of distant routers and how they interconnect. Link-state routing uses: Link-state advertisements (LSAs), Topological database, SPF protocol, SPF tree, A routing table of paths and ports to each network Link State Protocols. LSA Topological Database Topological Database SPF Protocol SPF Protocol SPF Tree Routing Table Routing Table

  6. Link State Protocols. • Link-state routing protocols are also known as shortest path first protocols and built around Edsger Dijkstra's shortest path first (SPF) algorithm.

  7. Advantages of Link State Protocols. Link-state routing has the following advantages over distance vector protocols: • Each router builds its own topological map of the network to determine the shortest path. • Immediate flooding of LSPs achieves faster convergence. • LSPs are sent only when there is a change in the topology and contain only information regarding the change. • Hierarchical design used when implementing multiple areas.

  8. OSPF Router Types

  9. OSPF Message Format • The OSPF packet header and packet type-specific data are encapsulated in an IP packet. In the IP packet header, the protocol field is set to 89 to indicate OSPF, and the destination address is set to one of two multicast addresses: 224.0.0.5 or 224.0.0.6. • If the OSPF packet is encapsulated in an Ethernet frame, the destination MAC address is also a multicast address: 01-00-5E-00-00-05 or 01-00-5E-00-00-06.

  10. OSPF Packet Types There are five different types of OSPF Link-State Packets (LSPs). Each packet serves a specific purpose in the OSPF routing process:

  11. OSPF Message Format – Hello Packet 0 8 16 24 31 Version Type = 1 Packet Length Router ID OSPF Packet Header Area ID Checksum Au Type Authentication Authentication Network Mask Bandwidth Hello Interval Option Router Priority OSPF Hello Packet Router Dead Interval Designated Router (DR) Backup Designated Router (BDR) List of Neighbours

  12. Hello Protocol • In most cases, OSPF Hello packets are sent as multicast to an address reserved for SPF Routers at 224.0.0.5. Using a multicast address allows a device to ignore the packet if its interface is not enabled to accept OSPF packets, saving CPU processing time on non-OSPF devices. • The Dead interval is the period, expressed in seconds, that the router will wait to receive a Hello packet before declaring the neighbor "down." Cisco uses a default of four times the Hello interval. For multiaccess and point-to-point segments, this period is 40 seconds. For NBMA networks, the Dead interval is 120 seconds. • If the Dead interval expires before the routers receive a Hello packet, OSPF will remove that neighbor from its link-state database. The router floods the link-state information about the "down" neighbor out all OSPF enabled interfaces.

  13. R2 R3 R1 Hello Protocol Hello – I am Router ID 10.2.2.2 OSPF Hello packets are sent every 10 seconds on multi-access networks and point-to-point serial links Fa0/0 S0/0/0 S0/0/1 DCE S0/0/0 DCE S0/0/1 Fa0/0 Fa0/0 S0/0/1 S0/0/0 DCE • The following interface values must match in order for OSPF to form an adjacency: • Hello Interval • Dead Interval • Network Type Hello – I am Router ID 10.3.3.3 Hello – I am Router ID 10.2.2.2

  14. Link-State Protocol Requirements • Memory Requirements - typically require more memory, more CPU processing, and at times more bandwidth than distance vector routing protocols. The memory requirements are due to the use of link-state databases and the creation of the SPF tree. • Processing Requirements - require more CPU processing than distance vector routing protocols. The SPF algorithm requires more CPU time than distance vector algorithms such as Bellman-Ford because link-state protocols build a complete map of the topology. • Bandwidth Requirements - flooding of link-state packets can adversely affect the available bandwidth on a network. This should only occur during initial startup of routers, but can also be an issue on unstable networks.

  15. Link State-Protocol Comparison • OSPF - designed by the IETF (Internet Engineering Task Force) OSPF Working Group, which still exists today. The development of OSPF began in 1987 and there are two current versions in use: • OSPFv2: OSPF for IPv4 networks (RFC 1247 and RFC 2328)OSPFv3: • OSPF for IPv6 networks (RFC 2740) • IS-IS - designed by ISO and is described in ISO 10589. The first incarnation of this routing protocol was developed at DEC (Digital Equipment Corporation) and is known as DECnet Phase V. Radia Perlman was the chief designer of the IS-IS routing protocol. • IS-IS was originally designed for the OSI protocol suite and not the TCP/IP protocol suite. Later, Integrated IS-IS, or Dual IS-IS, included support for IP networks. Although IS-IS has been known as the routing protocol used mainly by ISPs and carriers, more enterprise networks are beginning to use IS-IS.

  16. OSPF “Areas” • Hierarchical routing enables division of autonomous systems into smaller internetworks that are called areas. • With this technique, routing still occurs between the areas (called inter-area routing), but many of the smaller internal routing operations, such as recalculating the database – re-running the SPF algorithm, are restricted within an area.

  17. Dijkstra's SPF algorithm R2 to R3 Path Cost = 20 + 5 = 25 R5 to R3 Path Cost = 10 + 20 + 5 = 35

  18. Link State Routing Process 1. Each router learns about its own links, its own directly connected networks – detects interfaces in the ‘up’ state. 2. Each router is responsible for meeting its neighbors on directly connected networks - exchanges Hello packets with other link-state routers on directly connected networks. 3. Each router builds a Link-State Packet (LSP) containing the state of each directly connected link. 4. Each router floods the LSP to all neighbors, who then store all LSPs received in a database. Neighbors then flood the LSPs to their neighbors until all routers in the area have received the LSPs. 5. Each router uses the database to construct a complete map of the topology and computes the best path to each destination network - the router now has a complete map of all destinations in the topology and the routes to reach them.

  19. 1. Learn Directly Connected Networks 10.5.0.0/16 (2) R2 10.2.0.0/16 (20) 10.9.0.0/16 (10) 10.6.0.0/16 (2) 10.1.0.0/16 (2) 10.11.0.0/16 (2) R1 R3 R5 10.3.0.0/16 (5) 10.7.0.0/16 (10) 10.4.0.0/16 (20) 10.10.0.0/16 (10) R4 10.8.0.0/16 (2)

  20. 1. Learn Directly Connected Networks • Link 2: • Network – 10.2.0.0/16 • IP Address – 10.2.0.1 • Type – Serial • Cost – 20 • Neighbours – R2 • Link 3: • Network – 10.3.0.0/16 • IP Address – 10.3.0.1 • Type – Serial • Cost – 5 • Neighbours – R3 10.2.0.0/16 (20) S0/0/0 .1 S0/0/1 .1 10.1.0.0/16 (2) 10.3.0.0/16 (5) Fa0/0 .1 S0/1/0 .1 • Link 1: • Network – 10.1.0.0/16 • IP Address – 10.1.0.1 • Type – Ethernet • Cost – 2 • Neighbours – None • Link 4: • Network – 10.4.0.0/16 • IP Address – 10.4.0.1 • Type – Serial • Cost – 20 • Neighbours – R4 10.4.0.0/16 (20)

  21. 2. Sending Hello Packets R1 sends Hello packets out its links (interfaces) to discover if there are any neighbors. Hello 10.2.0.0/16 (20) R2 Hello Hello S0/00 .1 S0/0/1 .1 R3 R1 10.3.0.0/16 (5) Fa0/0 .1 S0/1/0 .1 10.4.0.0/16 (20) R4 Hello

  22. 2. Sending Hello Packets Hello • R2, R3, and R4 reply to the Hello packet with their own Hello packets because these routers are configured with the same link-state routing protocol. R2 10.2.0.0/16 (20) Hello S0/00 .1 S0/0/1 .1 R3 R1 10.3.0.0/16 (5) Fa0/0 .1 S0/1/0 .1 • There are no neighbors out the FastEthernet 0/0 interface. • R1 does not receive a Hello on this interface, so doesn’t continue with the link-state routing process steps for the Fa0/0 link. 10.4.0.0/16 (20) R4 Hello

  23. 3. Build Link State Packet (LSP) 10.5.0.0/16 (2) R1 LSP 1. R1; Ethernet network 10.1.0.0/16; Cost 2 2. R1 -> R2; Serial point-to-point network; 10.2.0.0/16; Cost 20 3. R1 -> R3; Serial point-to-point network; 10.3.0.0/16; Cost 5 4. R1 -> R4; Serial point-to-point network; 10.4.0.0/16; Cost 20 R2 10.2.0.0/16 (20) 10.9.0.0/16 (10) 10.6.0.0/16 (2) 10.3.0.0/16 (5) R1 R3 R5 10.1.0.0/16 (2) 10.11.0.0/16 (2) 10.7.0.0/16 (10) 10.4.0.0/16 (20) 10.10.0.0/16 (10) R4 10.8.0.0/16 (2)

  24. 4. Flood LSP to Neighbours 10.5.0.0/16 (2) R1 LSP 1. R1; Ethernet network 10.1.0.0/16; Cost 2 2. R1 -> R2; Serial point-to-point network; 10.2.0.0/16; Cost 20 3. R1 -> R3; Serial point-to-point network; 10.3.0.0/16; Cost 5 4. R1 -> R4; Serial point-to-point network; 10.4.0.0/16; Cost 20 R1 LSP R2 10.2.0.0/16 (20) 10.9.0.0/16 (10) R1 LSP R1 LSP 10.6.0.0/16 (2) 10.1.0.0/16 (2) 10.3.0.0/16 (5) R1 R3 R5 10.11.0.0/16 (2) • Each router floods its link-state information to all other link-state routers in the routing area. • Whenever a router receives an LSP from a neighboring router, it immediately sends that LSP out all other interfaces except the interface that received the LSP. 10.7.0.0/16 (10) 10.4.0.0/16 (20) 10.10.0.0/16 (10) R4 R1 LSP 10.8.0.0/16 (2)

  25. 4. Flood LSP to Neighbours LSPs do not need to be sent periodically. An LSP only needs to be sent: 1. During initial startup of the router or of the routing protocol process on that router 2. Whenever there is a change in the topology, including a link going down or coming up, or a neighbor adjacency being established or broken

  26. 5a. Build Link-State Database • As a result of the flooding process, router R1 has learned the link-state information for each router in its routing area. • Note that R1 also includes its own link-state information in the link-state database.

  27. 5b. Build SPF Tree 10.5.0.0/16 (2) • Each router uses the database to construct a complete map of the topology and computes the best path to each destination network. R2 10.2.0.0/16 (20) 10.9.0.0/16 (10) 10.6.0.0/16 (2) R1 R3 R5 10.3.0.0/16 (5) 10.1.0.0/16 (2) 10.11.0.0/16 (2) 10.7.0.0/16 (10) 10.4.0.0/16 (20) 10.10.0.0/16 (10) R1 SPF Tree R4 10.8.0.0/16 (2)

  28. Creating a Routing Table R2 10.2.0.0/16 (20) S0/00 .1 S0/0/1 .1 R3 R1 10.3.0.0/16 (5) Fa0/0 .1 S0/1/0 .1 10.1.0.0/16 (2) 10.4.0.0/16 (20) R4 • Using the shortest path information determined by the SPF algorithm, these paths can now be added to the routing table

  29. OSPF Metric • The Cisco IOS uses the cumulative bandwidths of the outgoing interfaces from the router to the destination network as the cost value. At each router, the cost for an interface is calculated as follows: • 1 x 108 / bandwidth in bps • Note that in routing metrics, the lowest cost route is the preferred route

  30. R2 R3 R1 OSPF Metric 10.10.10.0/24 Cost = 1 Lo0 10.2.2.2 Fa0/0 .1 S0/0/0 S0/0/1 DCE 192.168.10.0/30 192.168.10.8/30 .2 .9 S0/0/0 DCE Fa0/0 S0/0/1 Fa0/0 Cost = 64 .17 .33 .10 .1 S0/0/1 172.16.1.16/28 172.16.1.32/29 S0/0/0 DCE .5 .6 192.168.10.4/30 Lo0 10.3.3.3 Lo0 10.1.1.1 • The cost of an OSPF route is the accumulated value from one router to the destination network.

  31. R2 R3 R1 OSPF Metric - Bandwidth 10.10.10.0/24 Lo0 10.2.2.2 Fa0/0 .1 S0/0/0 S0/0/1 DCE 192.168.10.0/30 192.168.10.8/30 64kbps 128kbps .2 .9 S0/0/0 DCE Fa0/0 S0/0/1 Fa0/0 .17 .33 .10 .1 S0/0/1 172.16.1.16/28 172.16.1.32/29 S0/0/0 DCE .5 .6 192.168.10.4/30 Lo0 10.3.3.3 Lo0 10.1.1.1 256kbps

  32. R2 R3 R1 Broadcast Multi-access Multi-access Networks 10.10.10.0/24 Lo0 10.2.2.2 Fa0/0 .1 S0/0/0 S0/0/1 DCE Broadcast Multi-access Broadcast Multi-access .2 .9 S0/0/0 DCE Fa0/0 S0/0/1 Fa0/0 .17 .33 .10 .1 S0/0/1 172.16.1.16/28 172.16.1.32/29 S0/0/0 DCE .5 .6 Lo0 10.3.3.3 Lo0 10.1.1.1 • OSPF defines five network types: • Point-to-point (no DR/BDR) • Broadcast Multi-access (Needs DR/BDR) • Non-broadcast Multi-access (Needs DR/BDR) • Point-to-multipoint (no DR/BDR) • Virtual links

  33. DR and BDR on Multi-Access Networks • On multi-access, broadcast links (Ethernet), a DR and BDR (if there is more than one router) need to be elected. • DR- Designated Router • BDR – Backup Designated Router • DR’s serve as collection points for Link State Advertisements (LSAs) on multi-access networks • A BDR back ups the DR. • If the IP network is multi-access, the OSPF routers will elect one DR and one BDR

  34. Electing the DR and BDR • On multi-access, broadcast links (Ethernet), a DR and BDR (if there is more than one router) need to be elected. • DR- Designated Router • BDR – Backup Designated Router • DR’s serve as collection points for Link State Advertisements (LSAs) on multi-access networks • A BDR back ups the DR. • If the IP network is multi-access, the OSPF routers will elect one DR and one BDR

  35. R2 R3 R4 R5 R1 Multi-access Networks Instead of flooding LSAs to all routers in the network, DROthers only send their LSAs to the DR and BDR using the multicast address 224.0.0.6 R5 - LSA 224.0.0.6 R5 - LSA 224.0.0.6 DR BDR R5 - LSA 224.0.0.5 DRother R5 - LSA 224.0.0.5 The DR is responsible for forwarding the LSAs from R1 to all other routers. The DR uses the multicast address 224.0.0.5 DRother R5 - LSA 224.0.0.5 DRother

  36. R2 R3 R1 ISP OSPF Default Route 10.10.10.0/24 Lo0 10.2.2.2 Fa0/0 .1 S0/0/0 S0/0/1 DCE 192.168.10.8/30 192.168.10.0/30 .2 .9 S0/0/0 DCE Lo0 172.30.1.1/30 S0/0/1 Fa0/0 .33 .10 .1 S0/0/1 172.16.1.32/29 S0/0/0 DCE .5 .6 192.168.10.4/30 Lo0 10.3.3.3 • OSPF requires the use of the default-information originate command to advertise the 0.0.0.0/0 static default route to the other routers in the area.

  37. R2 R3 R1 R1 OSPF Default Route 10.10.10.0/24 Lo0 10.2.2.2 Fa0/0 .1 S0/0/0 S0/0/1 DCE 192.168.10.8/30 192.168.10.0/30 .2 .9 S0/0/0 DCE Lo0 172.30.1.1/30 S0/0/1 Fa0/0 .33 .10 .1 S0/0/1 172.16.1.32/29 S0/0/0 DCE .5 .6 192.168.10.4/30 Lo0 10.3.3.3 • E2 route is always the external cost, irrespective of the interior cost to reach that route

  38. R2 R3 R1 OSPF Reference Bandwidth 10.10.10.0/24 Lo0 10.2.2.2 Fa0/0 .1 S0/0/0 S0/0/1 DCE 192.168.10.8/30 192.168.10.0/30 .2 .9 S0/0/0 DCE Fa0/0 S0/0/1 Fa0/0 .17 .33 .10 .1 S0/0/1 172.16.1.16/28 172.16.1.32/29 S0/0/0 DCE .5 .6 192.168.10.4/30 Lo0 10.3.3.3 Lo0 10.1.1.1 • Using a reference bandwidth of 100,000,000 results in interfaces with bandwidth values of 100 Mbps and higher having the same OSPF cost of 1 – auto-cost reference-bandwidth used to set higher reference.

  39. Link State Updates (LSU) • Link-state updates (LSUs) are the packets used for OSPF routing updates, and can contain 10 different types of Link-State Advertisements (LSAs):

  40. OSPF Administrative Distance • Administrative Distance (AD) is the trustworthiness (or preference) of the route source. OSPF has a default administrative distance of 110. • When it’s AD is compared to other interior gateway protocols (IGPs), OSPF is preferred over IS-IS and RIP.

More Related