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.

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
© 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 CCNA 3 v3.1 Module 2. 2 CCNA 3 Module 2 Single Area OSPF.
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—3-1 Implementing a Scalable Multiarea Network OSPF- Based Solution Lab 3-2 Debrief.
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
Fundamentals of Networking Discovery 2, Chapter 6 Routing.
Enhanced IGRP (EIGRP) EIGRP Characteristics. EIGRP Configuration. Verifying EIGRP.
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 
6: Routing Working at a Small to Medium Business.
M. Menelaou CCNA2 DYNAMIC ROUTING. M. Menelaou DYNAMIC ROUTING Dynamic routing protocols can help simplify the life of a network administrator 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.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 2 Module 6 Routing and Routing Protocols.
Collected By: Mehdi Daneshvar Supervisor: E.M.Kosari.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 7: Enhanced Interior Gateway Protocol (EIGRP) Scaling Networks.
Routing -2 Dynamic Routing
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.
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.
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.
CCNA Guide to Cisco Networking Fundamentals Fourth Edition
Switching and Routing Technique W.lilakiatsakun. Assessment Final 40 % Final 40 % Midterm 30% Midterm 30% LAB + Assignment 30% LAB + Assignment 30%
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.
Saeed Darvish Pazoki – MCSE, CCNA Abstracted From: Cisco Press – ICND 2 – 10 EIGRP 1.
6: Routing Working at a Small to Medium Business.
Routing and Routing Protocols
© 2003, Cisco Systems, Inc. All rights reserved..
1 OSPF in Multiple Areas. 2 2 Scalability Problems in Large OSPF Areas Scalability problems in large OSPF areas include Large routing tables Large routing.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing Protocols.
Open Shortest Path First (OSPF)
1 7-Jan-16 S Ward Abingdon and Witney College Dynamic Routing CCNA Exploration Semester 2 Chapter 3.
© 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.
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.
© 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.
Cisco 3 - Switch Perrine. J Page 17/3/2016 Chapter 3 Which of the following are found in the EIGRP neighbor table? (Choose two.) 1.routes installed by.
© 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
Link State Routing protocol
Routing Loops.
Kevin Piper, David Perry, Tom Hoffman, Emely Pagan
Introducing The OSPF Routing Protocol
Single-Area OSPF 1 Cisco Networking Academy program Routing Protocols
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)
© 2002, Cisco Systems, Inc. All rights reserved.
CCNA 3 v3 JEOPARDY Module 2 CCNA3 v3 Module 2 K. Martin.
OSPF.
Dynamic Routing and OSPF
Chapter 8: Single-Area OSPF
Cisco networking, CNET-448
Routing With a Link-State Protocol
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.
Presentation transcript:

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 from the Cisco IOS CLI  Looked at VLANs and seen how to configure basic VLANs on switches  Looked at VLAN trunking and seen how to setup trunks between switches and routers  Looked at switch port security features  Looked at the Virtual Trunking Protocol ***

Objectives 18/09/2015Richard Hancock3  Be able to describe OSPF characteristics Be able to describe OSPF characteristics  Be able to define what an area is Be able to define what an area is  Be able to describe what the OSPF metric is and how it is used Be able to describe what the OSPF metric is and how it is used  Be able to describe how a router using OSPF is uniquely identified Be able to describe how a router using OSPF is uniquely identified  Be able to describe how a router using OSPF form adjacencies with out routers also using OSPF Be able to describe how a router using OSPF form adjacencies with out routers also using OSPF ***

OSPF characteristics 18/09/2015Richard Hancock4  Developed in reference to the limitation of RIP in large enterprise networks  Based on open standards  Runs on most routers  Uses the SPF algorithm to provide a loop-free topology  Fast convergence with triggered and incremental updates via LSA’s (it’s a link state protocol)  Classless protocol allowing for VLSM and route summarisation  However, requires more memory, extra CPU processing power, careful design, complex to troubleshoot and configure (multi-area designs)

OSPF areas 18/09/2015Richard Hancock5  OSPF uses Autonomous Systems and areas  Areas basically control when and how much routing information is shared across a network  Area 0 is the backbone  Areas 1-65,535 are “areas off the backbone” ***

OSPF areas 18/09/2015Richard Hancock6  Route summarisation would mean that Area 1, 2 and 3 do not need to know all the subnets in each others area, only their own areas

Metric 18/09/2015Richard Hancock7  OSPF uses cost  Cost is the inverse of the bandwidth of a link  The faster the speed of the link, the lower the cost  Preferred path is the one with the lowest cost  OSPF supports load-balancing  Six equal-cost paths to a single destination  On synchronous serial links the bandwidth defaults to 1544Kbps despite the clock rate settings  Bandwidth needs configuring specifically so that load-balancing works properly  This is important is there are multiple synchronous serial paths to a destination and the paths have different clock rates

Router identities 18/09/2015Richard Hancock8  Each router in an OSPF network requires a unique ID  The ID is included in OSPF messages  The ID is based on:  The highest IP address on any loopback interfaces, OR  The highest IP address on it’s active interfaces  If there are no active interfaces or loopback interfaces then the OSPF process will not start  Loopback interfaces are recommended because they are always up ***

Finding neighbours 18/09/2015Richard Hancock9  OSPF uses LSA’s to learn about neighbours  OSPF generates hello LSA’s every 10 seconds  If a router does not receive a hello LSA within 40 seconds from a neighbour it declares that neighbour dead  OSPF routers build an adjacency that makes them neighbours  To do this the following must match on both routers:  The area number and its type  The hello and dead interval timers  The OSPF password, if configured  The area stub tag  OSPF routers go through three states to form an adjacency:  Down state – no exchanges  Init state – destination router receives a hello and adds it to it’s neighbour list  Two-way state – new and destination routers exchange hello packets

Designated and backup routers 18/09/2015Richard Hancock10  OSPF also uses a client/server design when establishing adjacencies  Each segment will have a designated router (DR) and a backup designated router (BDR)  New routers form adjacencies with the DR and BDR  A router talks to the DR using  DR and BDR talk to routers using  The router with the highest router ID (IP address) becomes the DR  BDR is based upon the next highest router ID (IP address)  If the DR fails the BDR takes over and another router becomes the BDR

Summary 18/09/2015Richard Hancock11  OSPF is an open routing protocol and very popular  It works on most routers  It uses areas to control how much routing information is passed around a network  It uses cost (an inverse of bandwidth) as it’s metric  It uniquely identifies a router using either the highest IP address on a loopback interface or the highest IP address on an active interface  Using a loopback address for identity purposes is recommended

Tutorial 18/09/2015Richard Hancock12  Click on the icon below to run the tutorial and work through it until completion

So, what do you know now? 18/09/2015Richard Hancock13  How does a router in an OSPF network become a designated router?  What happens if a designated router fails  How often are OSPF LSA hello messages sent?  What happens if a neighbour doesn't receive a hello LSA packet from it’s neighbour after 40 seconds?  What must be configured to prevent errors with the load balancing feature of OSPF? ***

How all this relates to the assignment 18/09/2015Richard Hancock14  You will need to know how to configure OSPF for the case study and the skills test  You need to be able to perform these configuration on physical Cisco kit ***

Questions... 18/09/2015Richard Hancock15 ...are there any?

18/09/2015Richard Hancock16 End!