CCNP Routing Semester 5 Chapter 4 OSPF.

Slides:



Advertisements
Similar presentations
Introduction to OSPF.
Advertisements

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
1 ELEN 602 Lecture 20 More on Routing RIP, OSPF, BGP.
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
1 CCNA 3 v3.1 Module 2. 2 CCNA 3 Module 2 Single Area OSPF.
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
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.
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.
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 
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 5: Adjust and Troubleshoot Single- Area OSPF Scaling Networks.
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
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.
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
OSPF Last Update Copyright Kenneth M. Chipps Ph.D.
CCNP1: Advanced Routing v3.0 CISCO NETWORKING ACADEMY PROGRAM Chapter 2 – Single Area OSPF OSPF Link State Routing Single Area and Multiarea OSPF.
© 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.
Introduction to OSPF Nishal Goburdhan. Routing and Forwarding Routing is not the same as Forwarding Routing is the building of maps Each routing protocol.
© 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.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing Protocols.
Open Shortest Path First (OSPF)
© 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.
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.
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 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
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)
Link State Routing protocol
OSPF (Open Shortest Path First)
Introducing The OSPF Routing Protocol
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.
Instructor Materials 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.
Dynamic Routing and OSPF
Chapter 8: Single-Area OSPF
Dynamic Routing Protocols part2
Cisco networking, CNET-448
Routing With a Link-State Protocol
Routing Protocols and Concepts – Chapter 11
CCNP Network Route OSPF Part -II
Dynamic Routing Protocols part3 B
Presentation transcript:

CCNP Routing Semester 5 Chapter 4 OSPF

Using OSPF in a Single Area OSPF is more complex than RIP. To harness its power, it is important to spend time in the analysis and design of the network. Sometimes, it is necessary to redesign the addressing scheme to support the hierarchical structure that OSPF requires.

Hello Packet Fields Field Router ID Hello/Dead Intervals Neighbor Area ID Function Identifies the router within the AS Hello maintains presence of router in its neighbor databases; works like a keepalive Another router with whom updates will be exchanged to synchronize database Hello packet must come from a router within same area to be valid

Hello Packet Fields Field Function Used to manually select DR and BDR Router Priority DR IP Address BDR IP Authentication Password Stub Area Flag Function Used to manually select DR and BDR Used to allow the router to create unicast traffic to DR Allows router to create unicast traffic to the BDR Used for security Identifies which type of LSA will be transmitted and accepted

OSPF Packets Hello Protocol Database Descriptor Used to find neighbors and to determine designated router and backup designated router – continued propagation of Hello protocol maintains the transmitting router in the topology database of those that hear the message Used to send summary info to neighbors to synchronize topology databases

OSPF Packets Link State Request Link State Update Acknowledge Works as a request for more detailed info which is sent when router receives a database descriptor that contains new info Works as LSA packet issues in response to request for database info in LSA request packet Acknowledges link-state update

OSPF Databases Adjacency Database Link-State (topological database) Forwarding (routing table) List of all neighbor routers to which a router has established bidirectional communication. Unique for each router List of info about all other routers in the network. This database shows the network topology. All routers within an area have identical link-state databases List of routes generated when an algorithm is run on the link-state database. Each router’s routing table is unique and holds info on how / where to send packets

Types of OSPF Networks Type Broadcast Multiaccess Nonbroadcast Point-to-Point Point-to-Multipoint Determining Characteristic Ethernet, Token Ring, or FDDI Frame Relay, X.25, SMDS PPP, HDLC Configured by an administrator DR Election? Yes No

Designated Router (DR) For every multiaccess IP network, one router will be elected the DR. This DR has two main functions: first, to become adjacent to all other routers on the network, and second, to act as a “spokesperson” for the network. As spokesperson, the DR sends other IP networks network LSAs that list all local routers. Because the DR becomes adjacent to all other routers on the IP network, it is the focal point for collecting routing information (LSAs).

Backup Designated Router (BDR) The DR could represent a single point of failure, so a second router is elected as the BDR to provide fault tolerance. Thus, the BDR must also become adjacent to all routers on the network and must serve as a second focal point for LSAs. But, unlike the DR, the BDR is not responsible for updating the other routers or sending network LSAs. Instead, the BDR keeps a timer on the DR’s update activity to ensure that it is operational. If the BDR does not detect activity from the DR before the timer expires, the BDR takes over the role of DR and a new BDR is elected.

Steps in the Operation of OSPF OSPF routers progress through five distinct steps of operation: Establish router adjacencies Elect a DR and BDR (if necessary) Discover routes Select the appropriate routers to use Maintain routing information

Message-Digest Authentication Router(config)#ip ospf message-digest-key key-id md5 [encryption-type] password key_id An identifier in the range 1 to 255, which allows for multiple keys. The key ID configuration on each router must match to authentication md5 A required value that specifies the MD5 algorithm will be used encryption-type Optional value that specifies the type of encryption to use (0 to 7). Type 7 indicates Cisco proprietary encryption. Type 0 is the default password An alphanumeric password to be used as the message-digest key

Learning a New Route (2500 Series) Router takes first entry from update – first network with info about state of its link Router verifies that type of LSA is one that can be accepted by this router Router issues a lookup to its topological database when the LSA is valid Entries NOT in topological database will be flooded immediately out all OSPF interfaces except receiving interface Further questions are required when LSA entry is in topological database

Learning a New Route (2500 Series) If sequence numbers are the same, router calculates checksum for LSAs and uses the LSA with the higher checksum When checksum numbers are the same, router checks MaxAge field to ascertain which is more recent update Router determines whether the LSU has arrived outside the wait period before another computation is allowed When new LSA entry passes the tests, it is flooded out all OSPF interfaces except for the receiving interface

Learning a New Route (2500 Series) Current copy replaces old LSA entry. If there was no entry, current copy is placed in database Received LSA is acknowledged If LSA entry was in database, but LSA just received has an older sequence number, the process asks whether info in database is the same If info is different and new LSA has an older sequence number, receiving router discards the LSA update and issues its own LSA After initial flood, updates are sent only when there are changes in the area or when the 30 min. timer goes off

Glossary Adjacency Area Autonomous System Formed when two neighboring routers have exchanged info and share the same topology table. Database are synchronized and see same networks A group of routers that share the same area ID. Each router in the area has the same topology table. Each router is an internal router. The area is defined on an interface basis in the OSPF configuration Routers that share the same routing protocol within the same organization

Glossary Backup Designated Router (BDR) Cost Backup to the designated router in case the DR fails. BDR performs none of the DR functions while the DR is operating correctly A metric for OSPF. Not defined in standard with a value. Cisco uses default of inverse of bandwidth – higher the speed, lower the cost. Can be overridden with manual configuration – do only with full knowledge of network

Glossary Database Descriptor (DDP) Designated Router (DR) Referred to as DBD – database descriptor packet – packets exchanged between neighbors during the exchange state. DDPs contain LSAs which describe the links of every router in the neighbor’s topology table Responsible for making adjacencies with all neighbors on a multiaccess network such as Ethernet or FDDI. DR represents the multiaccess network in that it ensures every router on the link has the same topology database

Glossary Exchange State ExStart init Method by which two neighboring routers discover the map of the network. When these routers become adjacent, they must first exchange DDPs to ensure they have the same topology table State in which the neighboring routers determine the sequence number of the DDPs and establish the master/slave relationship State in which hello packet has been sent from the router, which is waiting for reply to establish two-way communication

Glossary Internal Router Link-State Adv LSA Database Router that has all its interfaces in the same area Packet describing router’s links and state of those links Topology map. Map of every router, its links, state of the links. Also has a map of every network and every path to each network

Glossary Link-State Request LSR Update LSU Neighbor Table Router requests additional info when LSA entry is not present or is older than the DDP when comparing the topology database Update sent in response to the LSR – it is the LSA that was requested Router on the same link with whom routing info is exchanged Table built from hello received from neighbor

Glossary Priority SPF Tree Topology Table Cisco tool by which designated router can be manually elected or prevented from taking part in a DR/BDR election Tree of topological network. Drawn after SPF algorithm has been run. Algorithm prunes database of alternative paths and creates loop-free shortest path to all networks Same as link-state database

More Glossary Flood Fully Adjacent Loading State Loopback Interface Setup Script Two-way State Refers to network info – sent to every device in domain When routing tables of two neighbors are fully synchronized State where router will request more detail using LSR Virtual interface that does not exist physically. If it doesn’t exist, it can’t go down Question and answer dialogue offered by Cisco router State during process in which two routers are creating an adjacency. This is stage before routing info is exchanged