© 1999, Cisco Systems, Inc. www.cisco.com 8-1 OSPF Overview RFC 2328, 2178, 1583.

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.
Designing OSPF Networks
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Multiarea OSPF Scaling Networks.
111 Open Shortest Path First OSPF  OSPF Overview  OSPF Operation By Grace Deng Oct
Objectives After completing this chapter you will be able to: Describe hierarchical routing in OSPF Describe the 3 protocols in OSPF, the Hello, Exchange.
OSPF (Open Shortest Path First)
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.
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 
Carl Bergenhem Multi Area OSPF Carl Bergenhem
M.Menelaou CCNA2 ROUTING. M.Menelaou ROUTING Routing is the process that a router uses to forward packets toward the destination network. A router makes.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 2 Module 6 Routing and Routing Protocols.
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
© 2006 Cisco Systems, Inc. All rights reserved. ICND v2.3—3-1 Determining IP Routes Enabling OSPF.
Instructor & Todd Lammle
CCNP1: Advanced Routing v3.0 CISCO NETWORKING ACADEMY PROGRAM Chapter 2 – Single Area OSPF OSPF Link State Routing Single Area and Multiarea 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.
Open standard protocol Successor of RIP Classless routing protocol Uses Shortest Path First (SPF) Algorithm Updates are sent through Multicast IP address.
© 2002, Cisco Systems, Inc. All rights reserved. 1 Determining IP Routes.
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.
1 © 2009 Cisco Systems, Inc. All rights reserved.Cisco Confidential Routing Protocols.
Instructor & Todd Lammle
Static versus Dynamic Routes Static Route Uses a protocol route that a network administrators enters into the router Static Route Uses a protocol route.
1 Cabrillo College Building Scalable Cisco Networks Ch. 5 OSPF - Multi-areas (Part I) Ch. 5 OSPF - Multi-areas (Part I) Rick Graziani, Instructor with.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 2 Single-Area OSPF.
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.
Routing and Routing Protocols
1 Intro to OSPF © 1998, Cisco Systems, Inc.. 2 © 2005 Cisco Systems, Inc. All rights reserved. Session Number Presentation_ID CISCO CONFIDENTIAL Introduction.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing Protocols.
© 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.
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.
Open Shortest Path First (OSPF) Uses Link State routing Each node acquires complete topology information using link state updates Link-state - what it.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing & Switching.
Open Shortest Path First (OSPF)
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)
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.
Link State Algorithm Alternative to distance-vector
Chapter 8: Single-Area OSPF
OSPF.
Dynamic Routing and OSPF
Chapter 8: Single-Area OSPF
Dynamic Routing Protocols part2
Cisco networking, CNET-448
Cisco networking, CNET-448
Chapter 9: Multiarea OSPF
Chapter 9: Multiarea OSPF
CCNP Network Route OSPF Part -II
Dynamic Routing Protocols part3 B
Presentation transcript:

© 1999, Cisco Systems, Inc OSPF Overview RFC 2328, 2178, 1583

Has fast convergence Supports VLSM Has no hop count limitation Processes updates efficiently Selects paths based on bandwidth What Is OSPF?

OSPF Terminology Links

OSPF Terminology Links Cost=10 Cost=1785 Cost=6

OSPF Terminology Area 1 Links Cost=10 Cost=1785 Cost=6 Area 0

OSPF Terminology Area 1 Links Cost=10 Cost=1785 Cost=6 Area 0 DR BDR

OSPF Terminology Adjacencies Database Lists Neighbors Area 1 Links Cost=10 Cost=1785 Cost=6 Area 0 DR BDR

OSPF Terminology Topology Database Lists All Routes Area 1 Links Cost=10 Cost=1785 Cost=6 Area 0 DR BDR Adjacencies Database Lists Neighbors

Area 1 Links Cost=10 Cost=1785 Cost=6 Area 0 OSPF Terminology DR BDR Routing Table Lists Best Routes Topology Database Lists All Routes Adjacencies Database Lists Neighbors

© 1999, Cisco Systems, Inc OSPF Operation within a Single Area

Establishing Adjacencies Hello A D E C B afadjfjorqpoeru Router ID Hello/Dead Intervals Neighbors Area-ID Router Priority DR IP Address BDR IP Address Authentication Password Stub Area Flag * * * *

Establishing Adjacencies (cont.) /24 E /24 E1 A B Down State

Establishing Adjacencies (cont.) /24 E /24 E1 Router B Adjacencies Database /24, int E1 I am router ID and I see no one. A B Down State Init State

Establishing Adjacencies (cont.) /24 E0 I am router ID , and I see /24 E1 Router B Adjacencies Database /24, int E1 I am router ID and I see no one. A B Down State Init State

Establishing Adjacencies (cont.) /24 E0 I am router ID , and I see Router A Adjacencies Database /24, int E /24 E1 Router B Adjacencies Database /24, int E1 I am router ID and I see no one. A B Down State Init State Two-Way State

Hellos elect DR and BDR Each router forms adjacency with DR and BDR Electing the DR and BDR DRBDR

Hello packets exchanged via IP multicast Router with highest OSPF priority elected P=1P=0P=1 Electing the DR and BDR (cont.) P=3P=2 Hello DR BDR

Discovering Routes E DR E No, I will start exchange because I have a higher router ID. I will start exchange because I have router ID Hello afadjfjorqpoeru Hello afadjfjorqpoeru Exstart State

Discovering Routes E DR E No, I will start exchange because I have a higher router ID. I will start exchange because I have router ID Here is a summary of my link-state database. Hello afadjfjorqpoeru Hello afadjfjorqpoeru DBD afadjfjorqpoeru Exstart State Exchange State Here is a summary of my link-state database. DBD afadjfjorqpoeru

Discovering Routes (cont.) E E Thanks for the information! LSAck afadjfjorqpoeru LSAck afadjfjorqpoeru DR

Discovering Routes (cont.) E E I need the complete entry for network /24. Here is the entry for network /24. Thanks for the information! LSR afadjfjorqpoeru LSAck afadjfjorqpoeru LSU afadjfjorqpoeru Loading State. Thanks for the information! LSAck afadjfjorqpoeru LSAck afadjfjorqpoeru DR

Discovering Routes (cont.) E E I need the complete entry for network /24. Here is the entry for network /24. Thanks for the information! LSR afadjfjorqpoeru LSAck afadjfjorqpoeru LSU afadjfjorqpoeru Full State Loading State. Thanks for the information! LSAck afadjfjorqpoeru LSAck afadjfjorqpoeru DR

Choosing Routes Routing Table Net Cost Out Interface TR TR E0 Cost=10 Cost=6 Cost=1 A B C This is the best route to C / / / /24

Maintaining Routing Information New Router xx Link-State Change LSU 1 DR A B New router tells all OSPF DRs on

Maintaining Routing Information New Router xx Link-State Change LSU 1 2 DR A B New router tells all OSPF DRs on DR tells others on

New router tells all OSPF DRs on DR tells others on New Router xx Link-State Change LSU Maintaining Routing Information DR A B

New router tells all OSPF DRs on DR tells others on Maintaining Routing Information New Router xx Link-State Change LSU I need to update my routing table. DR A B 4

Maintaining Routing Information (cont.) Is entry in link-state database? No Run SPF to calculate new routing table Add to database Flood LSA End LSA LSU A

Maintaining Routing Information (cont.) Is entry in link-state database? Yes No Run SPF to calculate new routing table Add to database Flood LSA Is seq. # the same? No Send LSU with newer information to source End LSA LSU Is seq. # newer? No

Maintaining Routing Information (cont.) Is entry in link-state database? Yes No Run SPF to calculate new routing table Add to database Flood LSA Is seq. # the same? Yes No Send LSU with newer information to source End LSA LSU Is seq. # newer? No Ignore LSA

Maintaining Routing Information (cont.) Is entry in link-state database? Yes No Run SPF to calculate new routing table Add to database Flood LSA Is seq. # the same? Yes No Yes Send LSU with newer information to source End LSA LSU Is seq. # newer? No A Ignore LSA Send LSAck to DR Go to A

Configuring OSPF on Internal Routers Can assign network or interface address. Broadcast NetworkPoint-to-Point Network E E0 S S1 A BC interface Ethernet0 ip address ! router ospf 1 network area 0 interface Ethernet0 ip address ! interface Serial0 ip address router ospf 50 network area 0 network area 0

Assigns a cost to an outgoing interface May be required for interoperability Use default cost between Cisco devices Cisco Non-Cisco Traffic Router(config-if)# ip ospf cost cost Configuring Optional Commands (cont.)

© 1999, Cisco Systems, Inc Creating Multiple OSPF Areas

Issues with Maintaining a Large OSPF Network OSPF My routing table is too big, I am running low on memory. The SPF is running too often for me to route. I am only receiving LSAs, no data.

Area 0 Area 1Area 2 Autonomous System Consists of areas and autonomous systems Minimizes routing update traffic The Solution: OSPF Hierarchical Routing

OSPF Multiarea Components Area 0 I am a backbone. Area 2 I am a stub. Area 1 I am standard. AreasRoutersLSAs Internal ABR ASBR Backbone Type 1 afadjfjorqpoeru Type 2 afadjfjorqpoeru Type 3/4 afadjfjorqpoeru Type 5 afadjfjorqpoeru

Types of OSPF Routers Internal Routers Area 1Area 2 ASBR and Backbone Router Backbone/ Internal Routers ABR and Backbone Router Backbone Area 0 External AS ABR and Backbone Router Internal Routers

Flooding LSUs to Multiple Areas (cont.) Routing Table Interarea routes Intra-area routes External (non-OSPF routes) Area 1 Area 0 Area 1RIP

OSPF Area Configuration Example Area 0 Stub Area S0 E0 External AS R4 R3 R3# interface Ethernet 0 ip address interface Serial 0 ip address router ospf 100 network area 0 network area 2 R4# interface Serial 0 ip address router ospf 15 network area 2

Link-State Network Discovery Routers calculate the shortest path to destinations in parallel ABC X Y ZW Routing Table W W 0 0 X X 0 0 X X 0 0 Y Y 0 0 Y Y 0 0 Z Z 0 0 E0 S1S0 S1 E1 E0 S1 S0 S1E1

Link-State Network Discovery Routers calculate the shortest path to destinations in parallel SPF ABC X Y Z Topological Database SPF Topological Database SPF Topological Database W Routing Table W W 0 0 X X 0 0 X X 0 0 Y Y 0 0 Y Y 0 0 Z Z 0 0 E0 S1S0 S1 E1 E0 S1 S0 S1E1

Link-State Network Discovery Routers calculate the shortest path to destinations in parallel SPF SPF Tree ABC X Y Z Topological Database A Routing Table A Routing Table SPF Topological Database B Routing Table B Routing Table SPF Topological Database C Routing Table C Routing Table W Routing Table W W 0 0 X X 0 0 X X 0 0 Y Y 0 0 Y Y 0 0 Z Z 0 0 E0 S1S0 S1 E1 E0 S1 S0 S1E1

Link-State Topology Changes Update processes proceed using the same link-state update Process to update this routing table Process to update this routing table Process to update this routing table Process to update this routing table Topologychangeinlink-stateupdate Process to update this routing table Process to update this routing table

Link-State Concerns Processing and memory required for link-state routing SPF SPF Tree Topological Database A Routing Table A Routing Table

Link-State Concerns Processing and memory required for link-state routing Bandwidth consumed for initial link-state “flood” SPF SPF Tree Topological Database A Routing Table A Routing Table

Problem: Link-State Updates Unsynchronized updates, inconsistent path decisions D B A C Network 1, Unreachable Network 1 goes down then comes up X, ok Slow path update

Problem: Link-State Updates Unsynchronized updates, inconsistent path decisions D B A C Network 1, Unreachable Network 1, Back Up Now Network 1, Unreachable Network 1 goes down then comes up X, ok Fast path updates arrive first Slow path update arrives lastSlow path update Which SPF tree to use for routing?

Problem: Link-State Updates Unsynchronized updates, inconsistent path decisions D B A C Network 1, Unreachable Network 1, Back Up Now Network 1, Unreachable Network 1 goes down then comes up X, ok Fast path updates arrive first Slow path update arrives lastSlow path update Which SPF tree to use for routing?

Link-State Update Problems Synchronizing large networks—which network topology updates are correct?

Link-State Update Problems Synchronizing large networks—which network topology updates are correct? Router startup—order of start alters the topology learned

Link-State Update Problems Synchronizing large networks—which network topology updates are correct? Router startup—order of start alters the topology learned Partitioned regions—slow updating part separated from fast updating part

Reduce the need for resources –“Dampen” update frequency –Target link-state updates to multicast –Use link-state area hierarchy for topology –Exchange route summaries at area borders Solution: Link-State Mechanisms

Reduce the need for resources –“Dampen” update frequency –Target link-state updates to multicast –Use link-state area hierarchy for topology –Exchange route summaries at area borders Coordinate link-state updates –Use time stamps –Update numbering and counters –Manage partitioning using an area hierarchy Solution: Link-State Mechanisms