Single Area OSPF Module 2, Review. 2.1.3 How routing information is maintained Link-state routers apply the Dijkstra shortest path first algorithm against.

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

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.
CCNA 2 v3.1 Module 6.
© 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.
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 
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 5: Adjust and Troubleshoot Single- Area OSPF Scaling Networks.
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.
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.
© 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.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
© 2002, Cisco Systems, Inc. All rights reserved. 1 Determining IP Routes.
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)
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.
Saeed Darvish Pazoki – MCSE, CCNA Abstracted From: Cisco Press – ICND 2 – 10 EIGRP 1.
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.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 OSPF Routing Protocols and Concepts – Chapter 11 Sandra Coleman, CCNA,
Open Shortest Path First (OSPF)
Open Shortest Path First (OSPF)
© 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.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 2 Single-Area OSPF.
111 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3: Switching Basics and Intermediate Routing v3.0.
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.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing & Switching.
Open Shortest Path First (OSPF)
ROURING ALGORITHM: LINK STATE
CCNA 3 Chapter 3 Single-Area OSPF
Single Area OSPF Link State Routing Single Area OSPF Concepts
Link State Routing protocol
Kevin Piper, David Perry, Tom Hoffman, Emely Pagan
Routing Protocols and Concepts
Link-State Routing Protocols
Instructor Materials Chapter 10: OSPF Tuning and Troubleshooting
Chapter 10: OSPF Tuning and Troubleshooting
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
Cisco networking, CNET-448
Routing With a Link-State Protocol
Routing Protocols and Concepts – Chapter 11
Switching Basics and Intermediate Routing CCNA 3 Chapter 2
Chapter 10: OSPF Tuning and Troubleshooting
Presentation transcript:

Single Area OSPF Module 2, Review

2.1.3 How routing information is maintained Link-state routers apply the Dijkstra shortest path first algorithm against the link-state database. This builds the SPF tree with the local router as the root.

2.1.4 Link-state routing algorithms An LSA exchange is triggered by an event in the network instead of periodic updates. This speeds up the convergence process because there is no need to wait for a series of timers to expire before the routers can converge.

2.1.5 Advantages and disadvantages of link-state routing The following are advantages of link-state routing protocols  Each router has a complete and synchronized picture of the network. Therefore, it is very difficult for routing loops to occur.

2.1.5 Advantages and disadvantages of link-state routing The following are some disadvantages of link-state routing protocols:  They require more memory and processor power than distance vector protocols. This makes it expensive to use for organizations with small budgets and legacy hardware.  They require strict hierarchical network design, so that a network can be broken into smaller areas to reduce the size of the topology tables.  They require an administrator who understands the protocols well.

2.2.1 OSPF overview Multiple areas connect to a distribution area, or area 0 which is also called the backbone. The hierarchical design approach allows for extensive control of routing updates. Area definition reduces routing overhead, speeds up convergence, confines network instability to an area, and improves performance.

2.2.3 Comparing OSPF with distance vector routing protocols OSPF selects routes based on cost, which is related to speed. The higher the bandwidth, the lower the OSPF cost of the link.

2.2.5 OSPF network types OSPF interfaces recognize three types of networks:  Broadcast multi-access, such as Ethernet  Point-to-point networks  Nonbroadcast multi-access (NBMA), such as Frame Relay On point-to-point networks only two nodes exist and no DR or BDR is elected. Both routers become fully adjacent with each other.

2.2.5 OSPF network types In a multi-access network, it is not known in advance how many routers will be connected. If every router had to establish full adjacency with every other router and exchange link-state information with every neighbor, there would be too much overhead. The solution to this overhead is to hold an election for a designated router (DR). A second router is elected as a backup designated router (BDR) to take over the duties of the DR if it should fail.

2.2.6 OSPF Hello protocol At Layer 3 of the OSI model, the hello packets are addressed to the multicast address This address is “all OSPF routers”.

2.3.1 Configuring OSPF routing process

2.3.2 Configuring OSPF loopback address and router priority A router with the highest OSPF priority will be selected as the DR. A router with the second highest priority will be the BDR. After the election process, the DR and BDR retain their roles even if routers are added to the network with higher OSPF priority values. If the network type of an interface is broadcast, the default OSPF priority is 1. When OSPF priorities are the same, the OSPF election for DR is decided on the router ID. The highest router ID is selected. The election result can be determined by ensuring that the ballots, the hello packets, contain a priority for that router interface. The interface reporting the highest priority for a router will ensure that it becomes the DR.

2.3.3 Modifying OSPF cost metric Use the following interface configuration command to set the link cost: Router(config-if)#ip ospf cost number Costs are also associated with externally derived routing data. In general, the path cost is calculated using the formula 10^8/ bandwidth, where bandwidth is expressed in bps.

2.3.4 Configuring OSPF authentication Use the following command syntax to configure OSPF authentication: Router(config-if)#ip ospf authentication- keypassword

2.3.6 OSPF, propagating a default route A configured default route is used by a router to generate a gateway of last resort. The static default route configuration syntax uses the network address and a subnet mask : Router(config)#ip route [interface | next-hop address ]  This is referred to as the quad-zero route, and any network address is matched using the following rule. The network gateway is determined by ANDing the packet destination with the subnet mask. The following configuration statement will propagate this route to all the routers in a normal OSPF area: Router(config-router)#default-information originate  All routers in the OSPF area will learn a default route provided that the interface of the border router to the default gateway is active.

2.3.7 Common OSPF configuration issues Failure to establish a neighbor relationship is caused by any of the following reasons:  Hellos are not sent from both neighbors.  Hello and dead interval timers are not the same.  Interfaces are on different network types.  Authentication passwords or keys are different.

2.3.8 Verifying the OSPF configuration