Introducing The OSPF Routing Protocol

Slides:



Advertisements
Similar presentations
Lonnie Decker Multiarea OSPF for CCNA Department Chair, Networking/Information Assurance Davenport University, Michigan August 2013 Elaine Horn Cisco Academy.
Advertisements

© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 OSPF Routing Protocols and Concepts – Chapter 11.
1 ELEN 602 Lecture 20 More on Routing RIP, OSPF, BGP.
Objectives After completing this chapter you will be able to: Describe hierarchical routing in OSPF Describe the 3 protocols in OSPF, the Hello, Exchange.
Single Area OSPF Concepts Single Area OSPF Configuration
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.
OSPF Open Shortest Path First (OSPF) is a link-state routing protocol for Internet Protocol (IP) networks. It uses a link state routing algorithm and.
Lecture Week 10 Link-State Routing Protocols. Objectives Describe the basic features & concepts of link-state routing protocols. List the benefits and.
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.
Open Shortest Path First Pedro Tsao
Instructor & Todd Lammle
© 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.
Open standard protocol Successor of RIP Classless routing protocol Uses Shortest Path First (SPF) Algorithm Updates are sent through Multicast IP address.
Introduction to OSPF Nishal Goburdhan. Routing and Forwarding Routing is not the same as Forwarding Routing is the building of maps Each routing protocol.
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.
1 Module 4: Implementing OSPF. 2 Lessons OSPF OSPF Areas and Hierarchical Routing OSPF Operation OSPF Routing Tables Designing an OSPF Network.
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.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing Protocols.
OSPF Open Shortest Path First. Table of Content  IP Routes  OSPF History  OSPF Design  OSPF Link State  OSPF Routing Table  OSPF Data Packets.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing Protocols.
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—3-1 Implementing a Scalable Multiarea Network OSPF-Based Solution Planning Routing Implementations.
Unicast Routing in IPv6 Babu Ram Dawadi.
CCNP Routing Semester 5 Chapter 4 OSPF.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
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.
© 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)
IGP Troubleshooting 3.
Single Area OSPF Link State Routing Single Area OSPF Concepts
報告題目:OSPF 指導教授:陳明仕 報告者:黃元志 學號M
Link State Routing protocol
Instructor & Todd Lammle
Kevin Piper, David Perry, Tom Hoffman, Emely Pagan
OSPF (Open Shortest Path First)
Routing Protocols and Concepts
Link-State Routing Protocols
Dynamic Routing Protocols part2
Dynamic Routing: Dynamic routing is where we use a routing protocol; routing protocols are cool because they take care of our work. Routing protocols will.
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
Chapter 9: Multiarea OSPF
CCNA 3 v3 JEOPARDY Module 2 CCNA3 v3 Module 2 K. Martin.
OSPF.
Link-State Routing Protocols
Instructor & Todd Lammle
Chapter 8: Single-Area OSPF
Dynamic Routing Protocols part2
Cisco networking, CNET-448
Cisco networking, CNET-448
Chapter 9: Multiarea OSPF
Routing With a Link-State Protocol
Link-State Routing Protocols
Routing Protocols and Concepts – Chapter 11
Dynamic Routing: Dynamic routing is where we use a routing protocol; routing protocols are cool because they take care of our work. Routing protocols will.
Chapter 9: Multiarea OSPF
CCNP Network Route OSPF Part -II
Dynamic Routing Protocols part3 B
Chapter 10: OSPF Tuning and Troubleshooting
Presentation transcript:

Introducing The OSPF Routing Protocol

All about OSPF Link State Routing Protocol Uses the Dijkstra Algorithm Uses Cost Based on Areas Uses a Process ID Number Configurations include Single area and Multi-Area Uses Designated Routers and Backup Designated Routers

All about OSPF No limitation on routers Does not summarize automatically Uses Hello and Dead timers Must be the same with directly connected neighbors Creates the following tables Routing table Neighbor table Database table

All about OSPF Term Definition LSDB The data structure held by an OSPF router for the purpose of storing topology data SPF The name of the algorithm OSPF uses to analyze the LSDB LSU The name of the OSPF packet that holds the detailed topology information. LSA The name of class of OSPF data structures that hold topology information. Area Contiguous grouping of routers and router interfaces. ABR A router that has interfaces connected to at least two different OSPF areas. Backbone Router Any router that has a t least one interface connected to the backbone area. Internal Router A router that has interfaces connected to only one area, making the router completely internal to that one area. DR On a multi-access data links like LANs an OSPF router elected by the routers on that data link to perform special functions. BDR A router on a multi-access data link that monitors the DR and becomes prepared to take over for the DR, if it fails.

Requirements to create Neighbors Yes/No Interfaces primary IP addresses must be in same subnet Yes Must not be passive on the connected interface Must be in same area Hello and Dead timers must be the same Router ID must be unique Must pass neighbor authentication (Optional) K-values must match N/A

Becoming Neighbors Detail - Hello Sent from R1 to R2 (down state) - Hello Received on R2 (init state) - Hello Reply to R1 (2way state) - Routers begin to exchange LSDB/DBD (exstart state) - DBD's Acknowledged (loading state) -LSRequest -LSupdates (one router at a time) - Once both routers know about all the routes. (Full State) NOW OSPF CAN BEGIN SPF CALCULATIONS

Configuring OSPF IPv4 RX(config)#router OSPF 1 RX(config-network)#network 10.1.1.4 0.0.0.3 area 0 RX(config-network)#network 192.168.1.0 0.0.0.255 area 0

OSPF Authentication Types Description Type 0 No authentication Type 1 Plain text authentication Type 2 Hashing authentication

Authentication Configuration Plain text authentication R1 Int g0/1 ip ospf message-digest-key 1 md5 Spiderman Router ospf 1 area 0 authentication message-digest R2 Int g0/2 ip ospf authentication message-digest