Chapter 11 Chapter 8 Routing & Switching Open Shortest Path First OSPF Thanks to instructors at St. Clair College in Windsor, Ontario.

Slides:



Advertisements
Similar presentations
CCNA3: Switching Basics and Intermediate Routing v3.0 CISCO NETWORKING ACADEMY PROGRAM Chapter 2 – Single Area OSPF Single Area OSPF Link State Routing.
Advertisements

Introduction to OSPF.
Lonnie Decker Multiarea OSPF for CCNA Department Chair, Networking/Information Assurance Davenport University, Michigan August 2013 Elaine Horn Cisco Academy.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 OSPF Routing Protocols and Concepts – Chapter 11.
Introduction to Dynamic Routing Protocols
Routing and Routing Protocols
© 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.
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—3-1 Implementing a Scalable Multiarea Network OSPF- Based Solution Improving Routing Performance.
1 CCNA 3 v3.1 Module 2. 2 CCNA 3 Module 2 Single Area OSPF.
Single Area OSPF Concepts Single Area OSPF Configuration
Single-Area OSPF Implementation
Chapter 12 Intro to Routing & Switching.  Upon completion of this chapter, you should be able to:  Read a routing table  Configure a static route 
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 5: Adjust and Troubleshoot Single- Area OSPF Scaling Networks.
Link-State Routing Protocols
Lecture Week 7 RIPv2 Routing Protocols and Concepts.
Collected By: Mehdi Daneshvar Supervisor: E.M.Kosari.
LAN Switching and WAN Networks Topic 6 - OSPF. What we have done so far! 18/09/2015Richard Hancock2  Looked at the basic switching concepts and configuration.
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—3-1 Determining IP Routes Enabling OSPF.
Instructor & Todd Lammle
OSPF (Single Area OSPF)
1 8-Oct-15 S Ward Abingdon and Witney College OSPF CCNA Exploration Semester 2 Chapter 11.
© Synergon Informatika Rt., 1999 Chapter 9 Configuring Open Shortest Path First.
© 2002, Cisco Systems, Inc. All rights reserved. 1 Determining IP Routes.
Introduction to OSPF Nishal Goburdhan. Routing and Forwarding Routing is not the same as Forwarding Routing is the building of maps Each routing protocol.
1 © 2009 Cisco Systems, Inc. All rights reserved.Cisco Confidential Routing Protocols.
Instructor & Todd Lammle
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 OSPF Routing Protocols and Concepts – Chapter 11.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 2 Single-Area OSPF.
CCNA3 ’s PAQ PAQ Pre-Assessment Quiz Produced by Mohamed BEN HASSINE CNA Instructor The American University of Paris.
CCNA 3 Week 2 Link State Protocols OSPF. Copyright © 2005 University of Bolton Distance Vector vs Link State Distance Vector –Copies Routing Table to.
Chapter 7 Enhanced IGRP (EIGRP) and Open Shortest Path First (OSPF)
1 of of 35 Single Area OSPF Concepts 3 of 35 OSPF Basics.
CCNA Guide to Cisco Networking Fundamentals Fourth Edition
Networks and Protocols CE Week 8b. Link state Routing.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
© 2003, Cisco Systems, Inc. All rights reserved..
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing Protocols.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 OSPF Routing Protocols and Concepts – Chapter 11 Sandra Coleman, CCNA,
OSPF-LAB W.Lilakiatsakun. Basic Configuration (1) Notice that the addressing scheme is discontiguous. Notice that the addressing scheme is discontiguous.
1 Version 3.1 Module 6 Routed & Routing Protocols.
CO5023 Single Area OSPF. Routing So far, we’ve looked at issues concerning the distribution and access layers. Routing is the process used to interconnect.
Open Shortest Path First OSPF
OSPF W.lilakiatsakun.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing Protocols.
CCNP Routing Semester 5 Chapter 4 OSPF.
1 24-Feb-16 S Ward Abingdon and Witney College OSPF CCNA Exploration Semester 2 Chapter 11.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 2 Single-Area OSPF.
Single Area OSPF Module 2, Review How routing information is maintained Link-state routers apply the Dijkstra shortest path first algorithm against.
111 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3: Switching Basics and Intermediate Routing v3.0.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Routing Protocols and Concepts OSPF Chapter 11 Modified by Pete Brierley.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing & Switching.
Instructor Materials Chapter 7: EIGRP Tuning and Troubleshooting
Open Shortest Path First (OSPF)
Single Area OSPF Link State Routing Single Area OSPF Concepts
Link State Routing protocol
Single-Area OSPF 1 Cisco Networking Academy program Routing Protocols
Instructor Materials Chapter 10: OSPF Tuning and Troubleshooting
Single-Area OSPF (Open Shortest Path First Protocol)
Single-Area OSPF (Open Shortest Path First Protocol)
Chapter 10: OSPF Tuning and Troubleshooting
CCNA 3 v3 JEOPARDY Module 2 CCNA3 v3 Module 2 K. Martin.
Chapter 2: Static Routing
Dynamic Routing and OSPF
Chapter 8: Single-Area OSPF
Chapter 7: EIGRP Tuning and Troubleshooting
Dynamic Routing Protocols part2
Routing With a Link-State Protocol
Routing Protocols and Concepts – Chapter 11
Dynamic Routing Protocols part3 B
Chapter 10: OSPF Tuning and Troubleshooting
Presentation transcript:

Chapter 11 Chapter 8 Routing & Switching Open Shortest Path First OSPF Thanks to instructors at St. Clair College in Windsor, Ontario

Chapter 11 Features of OSPF

Chapter 11 Introduction to OSPF OSPF is a classless, link-state routing protocol. OSPF is a classless, link-state routing protocol. Uses the concept of areas for scalability. Uses the concept of areas for scalability. Uses bandwidth to calculate the OSPF cost metric. Uses bandwidth to calculate the OSPF cost metric. Uses different types of packets to exchange information. Uses different types of packets to exchange information.

Chapter 11 Components of OSPF

Chapter 11 OSPF Packet Types

Chapter 11 Link-State Operation If a neighbor is present, the OSPF-enabled router attempts to establish a neighbor adjacency with that neighbor

Chapter 11 Link-State Operation (cont.)  LSAs contain the state and cost of each directly connected link.  Routers flood their LSAs to adjacent neighbors.  Adjacent neighbors receiving the LSA immediately flood the LSA to other directly connected neighbors, until all routers in the area have all LSAs.

Chapter 11 Link-State Operation  Build the topology table based on the received LSAs.  This database eventually holds all the information about the topology of the network.  Execute the SPF Algorithm.

Chapter 11 Link-State Operation (cont.) From the SPF tree, the best paths are inserted into the routing table. From the SPF tree, the best paths are inserted into the routing table.

Chapter 11 Databases/Tables Hello DBD SPF Hello DBD SPF

Chapter 11 Neighbour Establishment: Hello Protocol Sends Hello packets out all configured interfaces. Sends Hello packets out all configured interfaces. The information in the OSPF Hello includes the OSPF Router ID of the router sending the Hello packet. The information in the OSPF Hello includes the OSPF Router ID of the router sending the Hello packet.

Chapter 11 Hello Protocol: Neighbour Establishment Before two routers can form an OSPF neighbor adjacency, they must also agree on three values: Before two routers can form an OSPF neighbor adjacency, they must also agree on three values: Hello intervalHello interval Dead intervalDead interval Network typeNetwork type

Chapter 11 Point to point network Only two routers on network Only two routers on network They become fully adjacent with each other They become fully adjacent with each other

Chapter 11 Multiaccess networks More than 2 routers, e.g. Ethernet, Frame Relay. More than 2 routers, e.g. Ethernet, Frame Relay. These have a method of cutting down on adjacencies and the number of updates exchanged. These have a method of cutting down on adjacencies and the number of updates exchanged.

Chapter 11 Hello Protocol: Hello Interval Hello interval indicates how often an OSPF router transmits its Hello packets. Hello interval indicates how often an OSPF router transmits its Hello packets. Every 10 seconds on multi-access and point-to-point segments.Every 10 seconds on multi-access and point-to-point segments. Every 30 seconds on non-broadcast multi-access (NBMA) segments (Frame Relay, X.25, ATM).Every 30 seconds on non-broadcast multi-access (NBMA) segments (Frame Relay, X.25, ATM). Sends Hello pkts using in IPv4 and FF02::5 in IPv6 (all OSPF routers) Sends Hello pkts using in IPv4 and FF02::5 in IPv6 (all OSPF routers)

Chapter 11 Hello Protocol: Dead Interval The OSPF Dead interval is the period, expressed in seconds, that the router will wait to receive a Hello packet before declaring the neighbor “down.” The OSPF 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. Cisco uses a default of four times the Hello interval. 40 seconds for multi-access and point-to-point links.40 seconds for multi-access and point-to-point links. 120 seconds for NBMA networks.120 seconds for NBMA networks.

Chapter 11 Administrative Distance Administrative Distance (AD) is the trustworthiness (or preference) of the route source. Administrative Distance (AD) is the trustworthiness (or preference) of the route source.

Chapter 11 Authentication Like other routing protocols, OSPF can be configured for authentication. Like other routing protocols, OSPF can be configured for authentication. Authentication ensures that routers will only accept routing information from other routers that have been configured with the same password or authentication information. Authentication ensures that routers will only accept routing information from other routers that have been configured with the same password or authentication information.

Chapter 11 OSPF Basic OSPF Configuration

Chapter 11 The router ospf Command Like EIGRP, OSPF requires a Process ID. Like EIGRP, OSPF requires a Process ID. Between 1 and 65,535 and chosen by the network administrator.Between 1 and 65,535 and chosen by the network administrator. Unlike EIGRP, the process ID is only locally significant. Unlike EIGRP, the process ID is only locally significant. Does not have to match on all OSPF routers.Does not have to match on all OSPF routers. For consistency, we will enable OSPF on all three routers using the same Process ID of 1. For consistency, we will enable OSPF on all three routers using the same Process ID of 1.

Chapter 11 The network Command The network command used with OSPF has the same function as when used with other IGP routing protocols: The network command used with OSPF has the same function as when used with other IGP routing protocols: Any interfaces on a router that match the network address in the network command will be enabled to send and receive OSPF packets.Any interfaces on a router that match the network address in the network command will be enabled to send and receive OSPF packets. This network (or subnet) will be included in OSPF routing updates.This network (or subnet) will be included in OSPF routing updates.

Chapter 11 The network Command OSPF requires the wildcard mask. OSPF requires the wildcard mask. The network address, along with the wildcard mask, is used to specify the interface or range of interfaces that will be enabled for OSPF using this network command.The network address, along with the wildcard mask, is used to specify the interface or range of interfaces that will be enabled for OSPF using this network command.

Chapter 11 The network Command The area area-id refers to the OSPF area. The area area-id refers to the OSPF area. An OSPF area is a group of routers that share link-state information.An OSPF area is a group of routers that share link-state information. All OSPF routers in the same area must have the same link-state information in their link-state databases.All OSPF routers in the same area must have the same link-state information in their link-state databases.

Chapter 11 Single-area and Multiarea OSPF

Chapter 11 Single-area and Multiarea OSPF (cont.)

Chapter 11 The network Command network commands for all three routers, enabling OSPF on all interfaces. network commands for all three routers, enabling OSPF on all interfaces. At this point, all routers should be able to ping all networks. At this point, all routers should be able to ping all networks.

Chapter 11 OSPF Router ID The OSPF Router ID plays an important role in OSPF. The OSPF Router ID plays an important role in OSPF. It is used to uniquely identify each router in the OSPF routing domain.It is used to uniquely identify each router in the OSPF routing domain.

Chapter 11 OSPF Router IDs

Chapter 11 OSPF Router ID: Loopback Address The advantage of using a loopback interface is that, unlike physical interfaces, it cannot fail. The advantage of using a loopback interface is that, unlike physical interfaces, it cannot fail. “Virtual” interface with a /32 subnet mask.“Virtual” interface with a /32 subnet mask. Automatically “up” and “up”.Automatically “up” and “up”. Very useful in setting Router IDs as they never go down.Very useful in setting Router IDs as they never go down. Also useful to configure virtual networks that you can ping and route as if they were attached networks.Also useful to configure virtual networks that you can ping and route as if they were attached networks.

Chapter 11 OSPF Router ID: Loopback Address

Chapter 11 OSPF Router ID Verifying Router IDs – Loopback Interfaces: Verifying Router IDs – Loopback Interfaces:

Chapter 11 OSPF Router ID: Highest Active IP Address Because we have not configured Router IDs or loopback interfaces on our three routers, the Router ID for each router is determined by the third criterion in the preceding list. Because we have not configured Router IDs or loopback interfaces on our three routers, the Router ID for each router is determined by the third criterion in the preceding list. The highest active IP address on any of the router’s physical interfaces.The highest active IP address on any of the router’s physical interfaces

Chapter 11 OSPF Router ID: Highest Active IP Address Verifying the Router ID: Verifying the Router ID:

Chapter 11 OSPF Router ID Modifying the Router ID: Modifying the Router ID: Modifying a router ID with a new loopback or physical interface IP address may require reloading the router.Modifying a router ID with a new loopback or physical interface IP address may require reloading the router.

Chapter 11 OSPF Router ID Duplicate Router IDs: Duplicate Router IDs: When two routers have the same router ID in an OSPF domain, routing might not function properly.When two routers have the same router ID in an OSPF domain, routing might not function properly. If the router ID is the same on two neighboring routers, the neighbor establishment might not occur.If the router ID is the same on two neighboring routers, the neighbor establishment might not occur. When duplicate OSPF router IDs occur, Cisco IOS software displays the following message.When duplicate OSPF router IDs occur, Cisco IOS software displays the following message.

Chapter 11 Verifying OSPF The show ip ospf neighbor command: The show ip ospf neighbor command: The Router ID of the neighbouring router. FULL state means that the routers are fully adjacent and have identical link-state databases. The amount of time remaining that the router will wait to receive an OSPF Hello packet. The neighbor's IP Address and Interface used to form the adjacency.

Chapter 11 OSPF Operational States

Chapter 11 Establish Neighbor Adjacencies

Chapter 11 Establish Neighbor Adjacencies (cont.)

Chapter 11 Verifying OSPF Two routers may not form an OSPF adjacency if any one of the following conditions is present: Two routers may not form an OSPF adjacency if any one of the following conditions is present: The subnet masks do not match, causing the routers to be on separate networks.The subnet masks do not match, causing the routers to be on separate networks. OSPF Hello or Dead timers do not match.OSPF Hello or Dead timers do not match. OSPF network types do not match.OSPF network types do not match. There is a missing or incorrect OSPF network command.There is a missing or incorrect OSPF network command. Other powerful troubleshooting tools: Other powerful troubleshooting tools:

Chapter 11 Examining The Routing Table The quickest way to verify OSPF convergence is to look at the routing table for each router. The quickest way to verify OSPF convergence is to look at the routing table for each router. Loopback interfaces are included. Loopback interfaces are included. Unlike RIPv2 and EIGRP, OSPF does not automatically summarize at major network boundaries. Unlike RIPv2 and EIGRP, OSPF does not automatically summarize at major network boundaries.

Chapter 11 Verify OSPF Protocol Settings

Chapter 11 Verify OSPF Process Information

Chapter 11 Verify OSPF Interface Settings

Chapter 11 OSPF Metric = Cost Cost = reference bandwidth / interface bandwidth (default reference bandwidth is 10^8) Cost = 100,000,000 bps / interface bandwidth in bps Cost = 100,000,000 bps / interface bandwidth in bps

Chapter 11 OSPF Accumulates Costs Accumulated Cost = 65

Chapter 11 Default Bandwidth on Serial Interfaces On Cisco routers, the bandwidth value on many serial interfaces defaults to T1 (1.544 Mbps) and some may default to 128 Kbps. On Cisco routers, the bandwidth value on many serial interfaces defaults to T1 (1.544 Mbps) and some may default to 128 Kbps. Never assume that OSPF is using any particular bandwidth value to calculate cost. Never assume that OSPF is using any particular bandwidth value to calculate cost. Always check the default value with the show interface command. Always check the default value with the show interface command.

Chapter 11 Default Bandwidth on Serial Interfaces Changing the bandwidth value does not affect the speed of the link. Changing the bandwidth value does not affect the speed of the link. It is this value that is used in calculating the metric.It is this value that is used in calculating the metric. It is important that the bandwidth value reflect the actual speed of the link so that the routing table has accurate best path information.It is important that the bandwidth value reflect the actual speed of the link so that the routing table has accurate best path information.

Chapter 11 Default Bandwidth on Serial Interfaces Both WAN links have defaulted to 1544 Kbit and have a cost of 128.

Chapter 11 Default Bandwidth on Serial Interfaces R1 believes it has two equal cost paths to network /30. Interface S0/0/1 is actually the better path.

Chapter 11 Default Bandwidth on Serial Interfaces The calculated OSPF cost of an interface can be verified with the show ip ospf interface command. The calculated OSPF cost of an interface can be verified with the show ip ospf interface command. As we have seen, this is NOT the cost of a 64 Kbps link.As we have seen, this is NOT the cost of a 64 Kbps link.

Chapter 11 Modifying the Cost of a Link

Chapter 11 Modifying the Cost of a Link The faster 256 Kbps link becomes the preferred route.

Chapter 11 Modifying the Cost of a Link An alternative method to using the bandwidth command is to use the ip ospf cost command, which allows you to directly specify the cost of an interface. An alternative method to using the bandwidth command is to use the ip ospf cost command, which allows you to directly specify the cost of an interface. Cost = 1562

Chapter 11 OSPF OSPF and Multi-access Networks

Chapter 11 Challenges in Multi-access Networks Multi-access Broadcast network because a single device is capable of sending a single frame that has all devices on the network as its destination. Multi-access Broadcast network because a single device is capable of sending a single frame that has all devices on the network as its destination. As opposed to the point-to-point links we have been using. As opposed to the point-to-point links we have been using.

Chapter 11 Multiple Adjacencies Link-state routers flood their link-state packets when OSPF is initialized or when there is a change in the topology. Link-state routers flood their link-state packets when OSPF is initialized or when there is a change in the topology. This would lead to an excessive number of LSAs. This would lead to an excessive number of LSAs.

Chapter 11 Solution: Designated Router The solution to managing the number of adjacencies and the flooding of LSAs on a multi-access network is the Designated Router (DR). The solution to managing the number of adjacencies and the flooding of LSAs on a multi-access network is the Designated Router (DR). On multi-access networks, OSPF elects a DR to be the collection and distribution point for LSAs sent and received. On multi-access networks, OSPF elects a DR to be the collection and distribution point for LSAs sent and received. A Backup Designated Router (BDR) is also elected in case the DR fails. A Backup Designated Router (BDR) is also elected in case the DR fails. All other routers become DROthers. All other routers become DROthers.

Chapter 11 Solution: Designated Router DROthers only form full adjacencies with the DR and BDR in the network. DROthers only form full adjacencies with the DR and BDR in the network. Instead of flooding LSAs to all routers in the network, DROthers only send their LSAs to the DR and BDR using the multicast address Instead of flooding LSAs to all routers in the network, DROthers only send their LSAs to the DR and BDR using the multicast address

Chapter 11 Solution: Designated Router Only the DR and BDR are listening for LSA’s on multicast address Only the DR and BDR are listening for LSA’s on multicast address When R1 sends it’s LSAs, both receive them. When R1 sends it’s LSAs, both receive them

Chapter 11 Solution: Designated Router The DR then forwards the LSAs from R1 to all other routers using the multicast address The DR then forwards the LSAs from R1 to all other routers using the multicast address Result: Only one router flooding all LSAs. Result: Only one router flooding all LSAs

Chapter 11 DR/BDR Election Process DR/BDR elections do not occur in point-to-point networks.

Chapter 11 DR/BDR Election Process In this new topology, we have three routers sharing a common Ethernet multiaccess network, /24. In this new topology, we have three routers sharing a common Ethernet multiaccess network, /24. Each router is configured with an IP address on the Fast Ethernet interface and a loopback address for the router ID. Each router is configured with an IP address on the Fast Ethernet interface and a loopback address for the router ID.

Chapter 11 DR/BDR Election Process How do the DR and BDR get elected? The following criteria are applied: 1. 1.DR: Router with the highest OSPF interface priority BDR: Router with the second highest OSPF interface priority If OSPF interface priorities are equal, the highest router ID is used to break the tie.

Chapter 11 DR/BDR Election Process Assuming that the router priority is the default, what is the result of the election? Assuming that the router priority is the default, what is the result of the election? DR BDR

Chapter 11 DR/BDR Election Process The show ip ospf neighbor command displays the neighbour adjacencies of each router. The show ip ospf neighbor command displays the neighbour adjacencies of each router. Notice that the interface priority has not been changed so the Router ID (loopback address) will be used. Notice that the interface priority has not been changed so the Router ID (loopback address) will be used.

Chapter 11 DR/BDR Election Process DROthers only form full adjacencies with the DR and BDR but will still form a neighbor adjacency with any DROthers that join the network. DROthers only form full adjacencies with the DR and BDR but will still form a neighbor adjacency with any DROthers that join the network. This means that they will still receive Hello packets so that they are aware of all routers in the network. This means that they will still receive Hello packets so that they are aware of all routers in the network.

Chapter 11 DR/BDR Election Process Interface Priority: Interface Priority: Like other elections, this one can be rigged. Like other elections, this one can be rigged. The router’s priority field (0-255) can be set to either ensure that it becomes the DR or prevent it from being the DR. The router’s priority field (0-255) can be set to either ensure that it becomes the DR or prevent it from being the DR. Rtr(config-if)# ip ospf priority Rtr(config-if)# ip ospf priority Higher priority becomes DR/BDRHigher priority becomes DR/BDR Default = 1Default = 1 0 = Ineligible to become DR/BDR0 = Ineligible to become DR/BDR

Chapter 11 DR/BDR Election Process Pri = 200 Pri = 100 Pri = 1

Chapter 11 DR/BDR Election Process Pri = 200 Pri = 100 Pri = 1 DR BDR

Chapter 11 OSPF More OSPF Configuration

Chapter 11 Redistributing an OSPF Default Route Let’s return to the earlier topology, which now includes a new link to an ISP. Let’s return to the earlier topology, which now includes a new link to an ISP.

Chapter 11 Redistributing an OSPF Default Route The router connected to the Internet is used to propagate a default route to other routers in the OSPF routing domain. The router connected to the Internet is used to propagate a default route to other routers in the OSPF routing domain. This router is sometimes called the edge, entrance, or gateway router. This router is sometimes called the edge, entrance, or gateway router.

Chapter 11 Redistributing an OSPF Default Route Like RIP, OSPF requires the use of the default-information originate command to advertise the /0 static default route to the other routers in the area. Like RIP, OSPF requires the use of the default-information originate command to advertise the /0 static default route to the other routers in the area. If the default-information originate command is not used, the default “quad zero” route will not be propagated to other routers in the OSPF area. If the default-information originate command is not used, the default “quad zero” route will not be propagated to other routers in the OSPF area.

Chapter 11 Redistributing an OSPF Default Route

Chapter 11 Redistributing an OSPF Default Route E2 denotes an OSPF External type 2 route.

Chapter 11 Adjusting the Reference Bandwidth  Use the command - auto-cost reference-bandwidth  Use the command - auto-cost reference-bandwidth  Must be configured on every router in the OSPF domain  Notice that the value is expressed in Mb/s:  Gigabit Ethernet - auto-cost reference-bandwidth 1000  10 Gigabit Ethernet - auto-cost reference-bandwidth 10000

Chapter 11 Modifying OSPF Intervals It might be desirable to change the OSPF timers so that routers will detect network failures in less time. It might be desirable to change the OSPF timers so that routers will detect network failures in less time. Also keep in mind that OSPF requires that the Hello and Dead intervals match between two routers for them to become adjacent. Also keep in mind that OSPF requires that the Hello and Dead intervals match between two routers for them to become adjacent.