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 Dynamic Routing Protocols
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.
1 ELEN 602 Lecture 20 More on Routing RIP, OSPF, BGP.
CCNA 2 v3.1 Module 6.
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.
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 CCNA 3 v3.1 Module 2. 2 CCNA 3 Module 2 Single Area OSPF.
Lecture Week 3 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Objectives After completing this chapter you will be able to: Describe hierarchical routing in OSPF Describe the 3 protocols in OSPF, the Hello, Exchange.
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.
Chapter 3 Dynamic Routing Protocols. Introduction to Dynamic Routing Protocols Perspective and Background Network Discovery and Routing Table Maintenance.
Introduction to networking Dynamic routes. Objectives  Define dynamic routing and its properties  Describe the classes of routing protocols  Describe.
Link State Routing Protocol W.lilakiatsakun. Introduction (1) Link-state routing protocols are also known as shortest path first protocols and built around.
Routing and Routing Protocols Dynamic Routing Overview.
1 CS 4396 Computer Networks Lab Dynamic Routing Protocols - II OSPF.
Lecture Week 10 Link-State Routing Protocols. Objectives Describe the basic features & concepts of link-state routing protocols. List the benefits and.
Introduction to Routing and Routing Protocols By Ashar Anwar.
Dynamic Routing Protocols  Function(s) of Dynamic Routing Protocols: – Dynamically share information between routers (Discover remote networks). – Automatically.
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.
Introduction to Dynamic Routing Protocol
Collected By: Mehdi Daneshvar Supervisor: E.M.Kosari.
Routing -2 Dynamic Routing
Review Routing fundamental W.lilakiatsakun. Review Routing Fundamental VLSM VLSM Route Summarization Route Summarization Static & Dynamic Routing Static.
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.
OSPF Last Update Copyright Kenneth M. Chipps Ph.D.
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:
© 2002, Cisco Systems, Inc. All rights reserved. 1 Determining IP Routes.
Routing Fundamental W.lilakiatsakun. Review Routing Fundamental VLSM Static & Dynamic Routing Routing algorithm concept.
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.
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.
Routing and Routing Protocols
1 Version 3.1 Module 6 Routed & Routing Protocols.
1 7-Jan-16 S Ward Abingdon and Witney College Dynamic Routing CCNA Exploration Semester 2 Chapter 3.
Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.
© 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.
Single Area OSPF Module 2, Review How routing information is maintained Link-state routers apply the Dijkstra shortest path first algorithm against.
GROUP ASSIGNMENT CT NWT NETWORK TROUBLESHOOTING Name: Tan Ming Fatt Student ID: TP Group Members: - Gan Pei Shan Elamparithi A/L Thuraisamy.
Prof. Alfred J Bird, Ph.D., NBCT Office – Science 3rd floor – S Office Hours – Monday and Thursday.
Prof. Alfred J Bird, Ph.D., NBCT Office – McCormick 3rd floor 607 Office Hours – Monday 3:00 to 4:00 and.
Routing and Routing Protocols CCNA 2 v3 – Module 6.
Lec4: Introduction to Dynamic Routing Protocol
Link State Routing protocol
OSPF (Open Shortest Path First)
Routing Protocols and Concepts
Link-State Routing Protocols
Dynamic Routing Protocols part2
Introduction to Dynamic Routing Protocol
Chapter 5: Dynamic Routing
Link State Algorithm Alternative to distance-vector
Introduction to Dynamic Routing Protocol
Link-State Routing Protocols
Dynamic Routing and OSPF
Chapter 8: Single-Area OSPF
Dynamic Routing Protocols part2
Cisco networking, CNET-448
Link-State Routing Protocols
CCNP Network Route OSPF Part -II
Dynamic Routing Protocols part3 B
Presentation transcript:

Open Shortest Path First (OSPF) Presented by, Palak Lakhani(303229022) Rajvi Barfiwala(304389259) Shruti Kapadiya(304381680)

Project Title Setup OSPF on a group of routers. Capture and decode various types of  OSPF packets (Hello, database description, LSA request, LSA update, and link-state acknowledge). Capture and decode the OSPF packets transmitted whenever a router link  becomes unavailable, forcing the router to dynamically reroute traffic.

Link-State Routing Link-state routing algorithms, also known as shortest path first (SPF) algorithms. It maintains a complex database of topology information Use triggered updates that allow efficient use of bandwidth and faster convergence Maintain full knowledge of distant routers and how they interconnect Link-state routing protocols were designed to overcome the limitations of distance vector routing protocols

Link-state routing protocols perform the following functions: - Respond quickly to network changes. - Send triggered updates only when a network change has occurred. Send periodic updates known as Link-State refreshes. Link-state routing uses the following features: - Link-state advertisements (LSAs) - A topological database The shortest path first (SPF) algorithm A routing table of paths and ports to each network to determine the best paths for packets

Link-state protocols support… - Classless interdomain routing (CIDR) - Variable-length subnet mask (VLSM) Link-state protocols generally outperform distance vector protocols on any size network. Link-state protocols are not implemented on every network because… - They can overwhelm slower equipment - They are quite complex and require well-trained administrators to correctly configure and maintain them

What is a “link” in Link-State Routing? A “link” is the same as an interface on a router The “state of the link” describes an interface and the relationship to its neighboring routers It includes… the IP address of the interface the subnet mask the type of network to which it is connected the routers connected to that network

OSPF Open Shortest Path First (OSPF) is a link-state routing protocol based on open standards The Open in OSPF means that it is open to the public and is non-proprietary. OSPF is becoming the preferred IGP protocol when compared with RIP v1 and RIP v2 . OSPF can be used and configured as a single area for small networks can also be used for large networks if hierarchical network design principles are used

OSPF Packet Types There are 5 different type of packets. Type Packet Name Protocol Function 1 Hello Discover/maintain neighbors 2 Database Description Summarize database contents 3 Link State Request Database download 4 Link State Update Database update 5 Link State Ack Flooding acknowledgment

Hello Packet It is the type 1 packet. The hello message will perform 4 major functions such as: It discovers the other OSPF speaking routers on the common subnets. Verify the bidirectional visibility between the routers Check for the agreement on a particular configuration parameter Monitor the neighbor's health to react suppose the neighbor fails.

Database descriptor packet For the link state routing protocols, it is essential that the link state database for all the routers remain synchronized. This synchronization will begin as soon as an adjacency formed between the neighbors. The OSPF uses the DBD - database descriptor packets for that purpose. The poll response procedure is mainly used for the multiple packet description usage. Among the routers, one is designated to be a slave and other as a master. A database description packets are mainly sent by a slave after sending a database description packet by the master.

Link state request packet The LSR packet is one of the OSPF packets. After the DBD packet exchange process, a router can find that it has not any up-to-date database. An LSR packet is mainly used to request the pieces of a neighbors database which is more up-to-date. Link state request packet

Link state update packet This packet implements the LSA flooding. Every LSA comprises the metric, topology information and routing to describe the OSPF network portion. A local router will advertise the LSA within the LSU packet to the neighboring router. Additionally, a local router advertises an LSU packet with the information in response to the LSR packet.

Link state acknowledgement packet The OSPF needs acknowledgement for a receipt of the each LSA. The multiple LSA may be acknowledged in the single LSAck packet. The LSR/LSA process will use the reliable protocol, which has 2 options, in that link state acknowledgement is among them. The LSU can be acknowledged by a receiver of an LSU simply repeating a same LSU back to the sender. Alternatively, the router will send back the LSAck packet to acknowledge the packets that contain the acknowledged LSA header list.

When a router starts an OSPF routing process on an interface, it sends a hello packet and continues to send hellos at regular intervals The rules that govern the exchange of OSPF hello packets are called the Hello protocol. Hello packet timing… sent every 10 seconds by default on broadcast multi-access and point-to-point networks.

Advantages OSPF uses multitasking within areas. OSPF will run on most routers, since it is based on an open standard, not related to any particular vendor. OSPF uses link-state Algorithm and OSPF network can be much larger than that of RIP. It provides fast convergence with triggered, incremental updates via Link State Advertisements (LSAs). Using areas, OSPF network can be logically segmented to improve administrator and decrease the size of routing tables. It supports Variable Length Subnet Mask, resulting in efficient use of networking resources

Disadvantages Requires very strict network design. It requires more memory to hold the adjacency (list of OSPF neighbors), topology and routing tables. It requires extra CPU processing to run the SPF algorithm. Requires a knowledgeable network administrator. Significant demands on memory and processing resources. It is complex to configure and more difficult to troubleshoot compared to RIP.

Network Design

Thank You