Open Shortest Path First (OSPF)

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.
Routing Protocol.
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.
OSPF (Open Shortest Path First)
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.
Chapter 12 Intro to Routing & Switching.  Upon completion of this chapter, you should be able to:  Read a routing table  Configure a static route 
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.
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
© 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.
© 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.
1 © 2009 Cisco Systems, Inc. All rights reserved.Cisco Confidential Routing Protocols.
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.
Chapter 7 Enhanced IGRP (EIGRP) and Open Shortest Path First (OSPF)
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.
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)
Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.
© 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.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing & Switching.
Single Area OSPF Link State Routing Single Area OSPF Concepts
Link State Routing protocol
Instructor & Todd Lammle
Kevin Piper, David Perry, Tom Hoffman, Emely Pagan
Routing Protocols and Concepts
Link-State Routing Protocols
Dynamic Routing Protocols part2
Single-Area OSPF (Open Shortest Path First Protocol)
Chapter 10: OSPF Tuning and Troubleshooting
Chapter 9: Multiarea OSPF
Module Summary Open Shortest Path First (OSPF) protocol is one of the most commonly used link-state IP routing protocols in networking. It is an open standard.
CCNA 3 v3 JEOPARDY Module 2 CCNA3 v3 Module 2 K. Martin.
OSPF.
Link-State Routing Protocols
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
Routing With a Link-State Protocol
Link-State Routing Protocols
Routing Protocols and Concepts – Chapter 11
Chapter 9: Multiarea OSPF
CCNP Network Route OSPF Part -II
Switching Basics and Intermediate Routing CCNA 3 Chapter 2
Dynamic Routing Protocols part3 B
Chapter 10: OSPF Tuning and Troubleshooting
Presentation transcript:

Open Shortest Path First (OSPF)

Agenda OSPF Basics OSPF Terminology SPF Tree Calculation Verifying OSPF

OSPF Basics

OSPF Basics (1) Open standards. Use Dijkstra algorithm. It only supports IP routing. OSPF is supposed to be designed in a hierarchical fashion  separate the larger internetwork into smaller internetworks called areas. To decrease routing overhead To speed up convergence To confine network instability to single area Area 0  backbone area.

OSPF Basics (2)

OSPF Terminology

OSPF Terminology (1) Link  a network or router interface. Router ID  an IP address used to identify the router  highest loopback interfaces. Neighbors  routers that have an interface on a common network. Adjacency  relationship between two OSPF routers that permits the direct exchange of route updates. Neighborship database  a list of all OSPF routers for which Hello packets have been seen. LSA (Link State Advertisement)  an OSPF data packet containing link-state and routing information that’s shared among OSPF routers.

OSPF Terminology (2) Topology database  information from all of the LSA packets. Designated Router (DR) All routers on the multi-access network will establish adjacencies with the DR and BDR. Highest priority  router ID is used as a tiebreaker. Backup Designated Router (BDR) A hot standby for the DR.

Type of Networks Broadcast multi-access A DR and a BDR must be elected. Ethernet Nonbroadcast multi-access (NBMA) Frame relay, X.25, ATM Point-to-point Direct connection between two routers  physical or logical. Point-to-multipoint A series of connections between a single interface on one router and multiple destination routers. All of the interfaces belong to the same network.

SPF Tree Calculation

SPF Tree Calculation Shortest Path First (SPF) algorithm. Each router constructing a tree  the router is the root and all other networks are arranged along the branches and leaves. Separate trees will be constructed for each area. OSPF metric  cost. Cisco bases link cost on bandwidth  108/bandwidth

Verifying OSPF

OSPF Troubleshooting Commands show ip route  shows the entire routing table show ip ospf  displays OSPF information show ip ospf database  displays the topology database show ip ospf interface  displays all interface-related OSPF information show ip ospf neighbor  shows all OSPF neighbors