OSPF Last Update 2011.06.06 1.4.0 1Copyright 2008-2011 Kenneth M. Chipps Ph.D. www.chipps.com.

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.
Copyright Kenneth M. Chipps Ph.D. Cisco CCNA Exploration CCNA 2 Routing Protocols and Concepts Chapter 7 RIP Version 2 Last Update.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 OSPF Routing Protocols and Concepts – Chapter 11.
Copyright 2008 Kenneth M. Chipps Ph.D. Cisco CCNA Exploration CCNA 2 Routing Protocols and Concepts Chapter 4 Distance Vector Routing Protocols.
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
111 Open Shortest Path First OSPF  OSPF Overview  OSPF Operation By Grace Deng Oct
© 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.
Static Routing Last Update Copyright Kenneth M. Chipps Ph.D.
Objectives After completing this chapter you will be able to: Describe hierarchical routing in OSPF Describe the 3 protocols in OSPF, the Hello, Exchange.
CCNP Network Route OSPF Part -I OSPF: Open Shortest Path First Concept of OSPF: 1. It is a link state routing protocol. 2. There are basically only 2 ISIS.
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.
Collected By: Mehdi Daneshvar Supervisor: E.M.Kosari.
Open Shortest Path First Pedro Tsao
© 1999, Cisco Systems, Inc OSPF Overview RFC 2328, 2178, 1583.
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.
Open standard protocol Successor of RIP Classless routing protocol Uses Shortest Path First (SPF) Algorithm Updates are sent through Multicast IP address.
EIGRP Last Update Copyright Kenneth M. Chipps Ph.D.
Network Architecture and Design
Introduction to OSPF Nishal Goburdhan. Routing and Forwarding Routing is not the same as Forwarding Routing is the building of maps Each routing protocol.
Route Redistribution Last Update Copyright 2012 Kenneth M. Chipps Ph.D.
© 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.
1 Module 4: Implementing OSPF. 2 Lessons OSPF OSPF Areas and Hierarchical Routing OSPF Operation OSPF Routing Tables Designing an OSPF Network.
Cisco 3 - OSPF Perrine & Brierley Page 1 6/2/2016 Module 2 OSPF Overview Open Shortest Path First (OSPF) is a link-state routing protocol based on open.
1 of of 35 Single Area OSPF Concepts 3 of 35 OSPF Basics.
Cisco 3 - OSPF Perrine. J Page 16/4/2016 Module 2 What state are the routers in an OSPF network in after the DR and BDR are elected 1.Exstart 2.Full 3.Loading.
Networks and Protocols CE Week 8b. Link state Routing.
© 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.
Open Shortest Path First (OSPF)
© 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.
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—3-1 Implementing a Scalable Multiarea Network OSPF-Based Solution How OSPF Packet Processes.
Single Area OSPF Module 2, Review How routing information is maintained Link-state routers apply the Dijkstra shortest path first algorithm against.
Routing Protocol RIP-2. RIP-2 Basic Concepts Routers using RIP-2 advertise a small amount of simple information about each subnet to their neighbors.
Chapter 11 Chapter 8 Routing & Switching Open Shortest Path First OSPF Thanks to instructors at St. Clair College in Windsor, Ontario.
© 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.
Open Shortest Path First (OSPF) Uses Link State routing Each node acquires complete topology information using link state updates Link-state - what it.
1 CMPT 471 Networking II OSPF © Janice Regan,
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing & Switching.
Open Shortest Path First (OSPF)
OSPF (Open Shortest Path First)
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
Link State Algorithm Alternative to distance-vector
Chapter 8: Single-Area OSPF
CCNA 3 v3 JEOPARDY Module 2 CCNA3 v3 Module 2 K. Martin.
OSPF.
Chapter 8: Single-Area OSPF
Dynamic Routing Protocols part2
Cisco networking, CNET-448
Cisco networking, CNET-448
Routing Protocols and Concepts – Chapter 11
CCNP Network Route OSPF Part -II
Dynamic Routing Protocols part3 B
Chapter 10: OSPF Tuning and Troubleshooting
Presentation transcript:

OSPF Last Update Copyright Kenneth M. Chipps Ph.D.

2 Objectives Learn about OSPF

History of OSPF OSPF was developed to replace RIP Unfortunately being a committee project it took quite a while to be developed Begun in 1987 OSPFv1 was not released until 1989 as RFC 1131 However, this version was experimental and never used Copyright Kenneth M. Chipps Ph.D. 3

History of OSPF Only in 1991 was the first useable version - OSPFv2 - released as RFC 1247 RFC 2328 from 1998 updated 1247 In 1999 OSPFv3 was published as RFC 2740 to support IP Version 6 Copyright Kenneth M. Chipps Ph.D. 4

Metric OSPF uses cost as the metric for determining the best route The best route will have the lowest cost Cost is an arbitrary value according to the RFCs Cisco uses the bandwidth of the interface This form of the cost is calculated using the formula 10 8 / bandwidth Copyright Kenneth M. Chipps Ph.D. 5

Metric It defaults to 100Mbps This can be modified using the auto-cost reference-bandwidth command Copyright Kenneth M. Chipps Ph.D. 6

Shortest Path Algorithm The algorithm that OSPF uses to create the routing table is the SPF algorithm Using this algorithm the preferred path is the shortest path The shortest path being the fastest connection This may or may not be the one with the fewest hops Copyright Kenneth M. Chipps Ph.D. 7

8 Steps in OSPF Operation There are five steps in basic OSPF operation –Establish router adjacencies –Elect a DR and BDR, if needed –Discover routes –Select the routes to use –Maintain the routing table

Multiaccess Networks Copyright Kenneth M. Chipps Ph.D. 9 In a multiaccess network such as Ethernet or Frame Relay a designated router is needed This election does not take place in a point to point network The DR and BDR are selected based on the highest OSPF interface priority

Multiaccess Networks Copyright Kenneth M. Chipps Ph.D The election occurs as soon as the first router has its interface enabled on a multiaccess network When a DR is elected it remains as the DR until one of the following occurs The DR fails The OSPF process on the DR fails The multiaccess interface on the DR fails

Multiaccess Networks Copyright Kenneth M. Chipps Ph.D The winner can be manipulated –To do this Boot up the DR first, followed by the BDR, and then boot all other routers Shut down the interface on all routers, followed by a no shutdown on the DR, then the BDR, and then all other routers –Use the ip ospf priority interface command –Router(config-if)#ip ospf priority { } –Priority number range 0 to 255 –0 means the router cannot become the DR or BDR –1 is the default priority value

Copyright Kenneth M. Chipps Ph.D OSPF Relationships There are seven states in the relationship between two OSPF conversant routers –Down –Init –Two Way –ExStart –Exchange –Loading –Full Adjacency

Copyright Kenneth M. Chipps Ph.D Down This is the initial interface state In this state, the lower-level protocols have indicated that the interface is unusable No protocol traffic at all will be sent or received on such a interface In this state, interface parameters should be set to their initial values

Copyright Kenneth M. Chipps Ph.D Down All interface timers should be disabled, and there should be no adjacencies associated with the interface

Copyright Kenneth M. Chipps Ph.D Init In this state, an Hello packet has recently been seen from the neighbor However, bidirectional communication has not yet been established with the neighbor The router itself did not appear in the neighbor's Hello packet All neighbors in this state or higher are listed in the Hello packets sent from the associated interface

Copyright Kenneth M. Chipps Ph.D Two Way In this state, communication between the two routers is bidirectional This has been assured by the operation of the Hello Protocol This is the most advanced state short of beginning adjacency establishment The Designated Router is selected from the set of neighbors in state 2-Way or greater

Copyright Kenneth M. Chipps Ph.D ExStart This is the first step in creating an adjacency between the two neighboring routers The goal of this step is to decide which router is the master, and to decide upon the initial DD sequence number Neighbor conversations in this state or greater are called adjacencies

Copyright Kenneth M. Chipps Ph.D Exchange In this state the router is describing its entire link state database by sending Database Description packets to the neighbor Each Database Description Packet has a DD sequence number, and is explicitly acknowledged Only one Database Description Packet is allowed outstanding at any one time

Copyright Kenneth M. Chipps Ph.D Exchange In this state, Link State Request Packets may also be sent asking for the neighbor's more recent LSAs All adjacencies in Exchange state or greater are used by the flooding procedure In fact, these adjacencies are fully capable of transmitting and receiving all types of OSPF routing protocol packets

Copyright Kenneth M. Chipps Ph.D Loading In this state, Link State Request packets are sent to the neighbor asking for the more recent LSAs that have been discovered, but not yet received in the Exchange state

Copyright Kenneth M. Chipps Ph.D Full Adjacency In this state, the neighboring routers are fully adjacent These adjacencies will now appear in router-LSAs and network-LSAs

Copyright Kenneth M. Chipps Ph.D OSPF Packet Types To exchange information OSPF uses five packets types –Type 1 - Hello –Type 2 – Database Description Packet - DBD –Type 3 – Link State Request –Type 4 – Link State Update - LSU –Type 5 – Link State Acknowledgement - LSACK

Copyright Kenneth M. Chipps Ph.D Hello Establishes and maintains adjacency information with neighbors

Copyright Kenneth M. Chipps Ph.D Database Description Packet Describes the contents of an OSPF router’s link state database

Copyright Kenneth M. Chipps Ph.D Link State Request Requests specific pieces of a router’s link state database

Copyright Kenneth M. Chipps Ph.D Link State Update Transports link state advertisements

Copyright Kenneth M. Chipps Ph.D Link State Acknowledgment Acknowledges receipt of a neighbor’s LSA

Copyright Kenneth M. Chipps Ph.D OSPF Network Types OSPF can operate in three type of networks –Broadcast Multiaccess –NBMA – Nonbroadcast multiaccess –Point to Point

Copyright Kenneth M. Chipps Ph.D Broadcast Multiaccess Ethernet or Token Ring segment would be a multiaccess link

Copyright Kenneth M. Chipps Ph.D NBMA A Frame Relay or X.25 cloud would be classified as non-broadcast multiaccess

Copyright Kenneth M. Chipps Ph.D Point to Point A serial link connecting two routers together would be a point-to-point link

Copyright Kenneth M. Chipps Ph.D OSPF Hello Protocol What a router is running the OSPF routing process on an interface it sends Hello packets at regular intervals addressed to the multicast address These are sent every 10 seconds for Broadcast Multiaccess and Point to Point networks Every 30 seconds for NBMA – Nonbroadcast multiaccess networks

OSPF Capture File Let’s look at some of the OSPF activities just described in some frames from an OSPF network Download this file –HDLC with OSPF.cap Double-click on it to open it in Wireshark Go to frame 2 Expand all of the OSPF layer Copyright Kenneth M. Chipps Ph.D. 33

OSPF Capture File Copyright Kenneth M. Chipps Ph.D. 34

OSPF Capture File Copyright Kenneth M. Chipps Ph.D. 35

OSPF Capture File This is a Hello packet from As layer 3 shows it is being sent to the OSPF multicast address of OSPF version 2 is being used Hellos are sent every 10 seconds There is no Designated Router Copyright Kenneth M. Chipps Ph.D. 36

OSPF Capture File In frame 9 we see the other side of the link wake-up as it sends a Hello packet as well Copyright Kenneth M. Chipps Ph.D. 37

OSPF Capture File Copyright Kenneth M. Chipps Ph.D. 38

OSPF Capture File In frames 11 to 23 the OSPF routes start exchanging information Frame 11 is a Database Description packet from In frame 13 the other side provides their information Both sides have the same view of the network so they will use the information Copyright Kenneth M. Chipps Ph.D. 39

OSPF Capture File Copyright Kenneth M. Chipps Ph.D. 40

OSPF Capture File Copyright Kenneth M. Chipps Ph.D. 41

OSPF Capture File Copyright Kenneth M. Chipps Ph.D. 42

OSPF Capture File In this Database Description packet this router says it is in area 0 The mtu is 1500 bytes Copyright Kenneth M. Chipps Ph.D. 43

OSPF Capture File Copyright Kenneth M. Chipps Ph.D. 44

OSPF Capture File Copyright Kenneth M. Chipps Ph.D. 45

OSPF Capture File Frame 18 is a Link State Request from Followed by a LSR from the other side in Frame 19 Copyright Kenneth M. Chipps Ph.D. 46

OSPF Capture File Copyright Kenneth M. Chipps Ph.D. 47

OSPF Capture File Copyright Kenneth M. Chipps Ph.D. 48

OSPF Capture File In frame 21 the router sends a Link State Update saying hey wait a minute I just discovered another network hooked to me In this case the network This is reported to be a stub network Copyright Kenneth M. Chipps Ph.D. 49

OSPF Capture File Copyright Kenneth M. Chipps Ph.D. 50

OSPF Capture File In frame 23 we see all of the networks being reported by Copyright Kenneth M. Chipps Ph.D. 51

OSPF Capture File Copyright Kenneth M. Chipps Ph.D. 52

OSPF Capture File In frame 26 and 27 we see a Link State Acknowledgement from each side Copyright Kenneth M. Chipps Ph.D. 53

OSPF Capture File Copyright Kenneth M. Chipps Ph.D. 54

OSPF Capture File Copyright Kenneth M. Chipps Ph.D. 55

Copyright Kenneth M. Chipps Ph.D OSPF Loopback When the OSPF process starts on a router the IOS uses the local IP address as its OSPF router ID If a loopback address is configured, it is used regardless of its value A loopback address ensures stability as the loopback interface is not affected by links going up and down

Copyright Kenneth M. Chipps Ph.D OSPF Loopback Set the loopback address before enabling OSPF on an interface To avoid routing problems use a 32 bit subnet mask for the loopback address

Copyright Kenneth M. Chipps Ph.D Loopback Addressing It is considered best practice, in configuring Cisco routers, to define one loopback interface, and designate it as the source interface for most traffic generated by the router itself

Copyright Kenneth M. Chipps Ph.D Loopback Addressing Adopting this practice yields several benefits for the overall stability and security management of a network, because the address of the loopback interface is fixed

Copyright Kenneth M. Chipps Ph.D Loopback Addressing When a router is configured to use the loopback interface for services, it is possible to configure the security of other devices in the network more tightly When a service is configured to use the loopback interface as its source, we say that the service is bound to that interface

Copyright Kenneth M. Chipps Ph.D Loopback Addressing It means that IP packets generated by the router will have the loopback interface’s address as their source address Also, the loopback interface’s address does not appear in any route-based network maps; hiding administrative aspects of your network from potential attackers is usually good practice

Copyright Kenneth M. Chipps Ph.D Loopback Addressing To create a loopback interface, simply assign it an IP address For a border router, the loopback’s address usually should be in the range of the internal or DMZ network, not the external network

Copyright Kenneth M. Chipps Ph.D Loopback Addressing Note that the loopback address cannot be the same as the address of any other interface, nor can it be part of the same network as any other interface

Copyright Kenneth M. Chipps Ph.D Loopback Addressing For example –Central# config t –Central(config)# interface loopback0 –Central(config-if)# description Main Loopback Interface –Central(config-if)# ip address

Copyright Kenneth M. Chipps Ph.D Loopback Addressing In general, router network services that can be bound to the loopback interface should be

Copyright Kenneth M. Chipps Ph.D OSPF Authentication Routers trust the routing information they receive from other routers To ensure this is from a router that should be trusted, authentication can be set

Copyright Kenneth M. Chipps Ph.D OSPF Authentication

Copyright Kenneth M. Chipps Ph.D Configuring OSPF Timers To speed link state failure notifications the OSPF timers can be adjusted

Copyright Kenneth M. Chipps Ph.D Configuring OSPF Timers

Configuration is Simple Copyright Kenneth M. Chipps Ph.D In the vast majority of networks there is nothing needed other than enabling OSPF or any other routing protocol It just works This is true up to 30 routers or so talking to each other Above that some tuning will be required

Copyright Kenneth M. Chipps Ph.D Configuring OSPF router ospf 1 –The process id from 1 to is a locally significant number that does not have to be the same on all routers –It just links to a OSPF database held by the router network area 0 network area 0

Router ID The router id is an IP address used to identify a router Three criteria are applied to derive this –The IP address configured with the OSPF router-id command This takes precedence over loopback and physical interface addresses Copyright Kenneth M. Chipps Ph.D. 72

Router ID –If the router-id command is not used, then the router chooses highest IP address of any loopback interface –If no loopback interfaces are configured then the highest IP address on any active interface is used Copyright Kenneth M. Chipps Ph.D. 73

Copyright Kenneth M. Chipps Ph.D Verifying OSPF Configuration show ip protocol show ip route show ip ospf interface shop ip ospf show ip ospf neighbor detail show ip ospf database

Lab Start Packet Tracer Do activity pka Copyright Kenneth M. Chipps Ph.D. 75

Lab Lab 11-1 Copyright Kenneth M. Chipps Ph.D. 76