OSPF 1.

Slides:



Advertisements
Similar presentations
Introduction to IP Routing Geoff Huston
Advertisements

Chapter 1: Introduction to Scaling Networks
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Distance Vector Routing Protocols Routing Protocols and Concepts –
IP Multicast Information management 2 Groep T Leuven – Information department 2/14 Agenda •Why IP Multicast ? •Multicast fundamentals •Intradomain.
IPv6 Routing.
Advanced Features of OSPF Protocol
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
PSSA Preparation.
CCNA3: Switching Basics and Intermediate Routing v3.0 CISCO NETWORKING ACADEMY PROGRAM Chapter 2 – Single Area OSPF Single Area OSPF Link State Routing.
© 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.
Link State Routing Jean-Yves Le Boudec Fall
© 2007 Cisco Systems, Inc. All rights reserved.ICND2 v1.0—4-1 Single-Area OSPF Implementation Implementing OSPF.
© 2007 Cisco Systems, Inc. All rights reserved.ICND1 v1.0—-5-1 WAN Connections Enabling RIP.
Introduction to OSPF Mark Tinka. Routing and Forwarding  Routing is not the same as Forwarding  Routing is the building of maps Each routing protocol.
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.
Designing OSPF Networks
CCNA 2 v3.1 Module 6.
RD-CSY /09 Distance Vector 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.
1 Semester 2 Module 6 Routing and Routing Protocols YuDa college of business James Chen
Introduction to networking Dynamic routes. Objectives  Define dynamic routing and its properties  Describe the classes of routing protocols  Describe.
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.
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
1. 2 Anatomy of an IP Packet IP packets consist of the data from upper layers plus an IP header. The IP header consists of the following:
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
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.
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.
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.
1 of of 35 Single Area OSPF Concepts 3 of 35 OSPF Basics.
CCNA 2 Week 6 Routing Protocols. Copyright © 2005 University of Bolton Topics Static Routing Dynamic Routing Routing Protocols Overview.
© 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.
Copyright 2003 CCNA 3 Chapter 3 Single-Area OSPF By Your Name.
111 © 2003, Cisco Systems, Inc. All rights reserved. RECAP VLSM and CIDR.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing Protocols.
Open Shortest Path First (OSPF)
© 2002, 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 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.
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.
Chapter 11 Chapter 8 Routing & Switching Open Shortest Path First OSPF Thanks to instructors at St. Clair College in Windsor, Ontario.
+ Dynamic Routing Protocols 2 nd semester
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing & Switching.
Open Shortest Path First (OSPF)
CCNA 3 Chapter 3 Single-Area OSPF
Single Area OSPF Link State Routing Single Area OSPF Concepts
Link State Routing protocol
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.
CCNA 3 v3 JEOPARDY Module 2 CCNA3 v3 Module 2 K. Martin.
Link-State Routing Protocols
Dynamic Routing and OSPF
Chapter 8: Single-Area OSPF
Cisco networking, CNET-448
Routing With a Link-State Protocol
Link-State Routing Protocols
Routing Protocols and Concepts – Chapter 11
Dynamic Routing Protocols part3 B
Presentation transcript:

OSPF 1

Today's Talk Introduction Distance Vector Protocol Link State Protocol OSPF operation Neighbor & Adjacency OSPF in broadcast networks 2

Today’s Talk ... Exercise-1 Scalability Exercise-2 Redistribution simple OSPF network Scalability Exercise-2 multiple areas Redistribution Exercise-3 redistribution of routes 3 4

Introduction Open Shortest First Path protocol Preferred IGP The myth : OSPF is hard to use Evolved from IS-IS protocol Link state protocol 4

Distance Vector Protocols Listen to neighboring routers install routes in table, lowest distance wins Advertise all routes in table Very simple Very stupid 5

Distance Vector Protocols G E B H A 2 B 2 C 2 D 1 E sup F 1 G 1 H 1 I1 I F C A 1 B 1 C 1 G sup H 1 6

Link State Protocols information about adjacencies sent to all routers each router builds a topology database a "shortest path" algorithm is used to find best route converge as quickly as databases can be updated 7

Link State Protocols D A 1 2 G E B 3 H I F C router 1 A, B, C, G, H D, E, F, G, I A - 1 - G - 2 - D 8

OSPF Operation Every OSPF router sends out 'hello' packets Hello packets used to determine if neighbor is up Hello packets are small easy to process packets Hello packets are sent periodically (usually short interval) 9

The Hello Packet Router priority Hello interval Router dead interval Network mask List of neighbors FDDI Dual Ring Hello Hello 10 39 32

OSPF Operation Once an adjacency is established, trade information with your neighbor Topology information is packaged in a "link state announcement" Announcements are sent ONCE, and only updated if there's a change (or every 45mins...) 11

OSPF Operation Change occurs Broadcast change Run SPF algorithm Install output into forwarding table 12

Neighbor Bi-directional OSPF communication Result of OSPF hello packets Need not exchange routing information 13

Adjacency Between OSPF neighbors Exchange routing information Point-to-point or Broadcast media Point-to-point - neighbors are adjacent Broadcast media - not all neighbors are adjacent 14

Broadcast Media - problems N neighbors - order of N square adjacency Not optimal Wasted bandwidth Does not scale 15

Broadcast Media Select a neighbor - Designated Router(DR) All routers become adjacent to DR Exchange routing information with the DR DR updates all the neighbors Scales Backup Designated Router 16

Neighboring States 2-way Router sees itself in other Hello packets DR selected from neighbors in state 2-way or greater 2-way DR BDR 17 42 35

Neighboring States Full Routers are fully adjacent Databases synchronized Relationship to DR and BDR Full DR BDR 18 43 36

LSAs Propagate Along Adjacencies DR BDR LSAs acknowledged along adjacencies 19 45 38

General cisco Concepts: Ability to run multiple routing protocols in the same router Same prefix could be learnt via more than one routing protocol Adminstrative distance is used to discriminate between multiple source Connected, Static and other dynamic protocols 20

Exercise - 1: cisco configuration console ‘?’ for help command completion ‘show’ commands ‘show configuration’ ‘configuration’ command 21

Exercise - 1: cisco configuration ‘configure terminal’ Different modes Example ‘interface ethernet 1’ ‘ip address x.x.x.x m.m.m.m’ ‘exit’ to exit a mode ‘show ip route’ ‘show ip route x.x.x.x’ 22

Exercise - 1 Simple OSPF network ‘show ip route’ ‘show ip ospf neighbor’ ‘show ip ospf int’ ‘show ip protocol’ ‘show ip ospf database’ many debug commands ‘debug ip ospf ?’ 23

Exercise - 1 Simple OSPF network ‘network x.x.x.x m.m.m.m area <area-id> ‘m.m.m.m’ wildcard mask ‘0’ do not care bit ‘1’ check bit ‘0.0.0.0’ mask for exact match ‘network 203.167.177.10 0.0.0.0 area 0’ ‘network 203.167.177.0 0.0.0.255 area 0’ 24

Exercise - 1 Specify the network running ospf Simple OSPF network Need to create OSPF routing process router configuration command ‘router ospf <process number> Specify the network running ospf Should also specify the area 25

Exercise1 Verification: show ip ospf show ip ospf neighbor show ip route show ip route ospf show ip ospf interface show ip ospf database 26

Scaling OSPF Each link transition causes a broadcast and SPF run OSPF can group routers to appear as one single router OSPF areas 27

OSPF areas (before) 28

OSPF areas (after) 29

Scaling OSPF Rule of thumb: no more than 150 routers/area Reality: no more than 500 routers/area Backbone "area" is an area Always ‘area 0’ Proper use of areas reduce bandwidth & CPU utilization 30

Scaling OSPF Route could be summarized are area boundary Instability is limited within each area Divide and conquer 31

Exercise - 2: OSPF with area Use ‘network ... area <area-id> command Each interface only in 1 area Multiple areas per router If more than on area, the router should be in area 0 ‘area 0’ used for inter-area traffic 32

Redistribution injecting route from other protocol Often useful during transition Need to be careful about feedback Need to set metric 33