OSPF Protocol.

Slides:



Advertisements
Similar presentations
4/12/2015© 2009 Raymond P. Jefferis IIILect Internet Protocol - Continued.
Advertisements

Network Layer – Routing 2 Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2001 Chapter 21 Networking and Internetworking Devices.
Routing Protocol.
1 LINK STATE PROTOCOLS (contents) Disadvantages of the distance vector protocols Link state protocols Why is a link state protocol better?
Networks: Routing1 Network Layer Routing. Networks: Routing2 Network Layer Concerned with getting packets from source to destination Network layer must.
RD-CSY /09 Distance Vector Routing Protocols.
TNMK09 Computer Networks Copyright © 2005 Di Yuan, ITN, LiTH 1  Non-hierarchical routing, static or dynamic, won’t work in the Internet  None of the.
© 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 Computer Networks Routing Algorithms. 2 IP Packet Delivery Two Processes are required to accomplish IP packet delivery: –Routing discovering and selecting.
Networks: Routing1 Network Layer Routing. Networks: Routing2 Network Layer Concerned with getting packets from source to destination. The network layer.
CSE123A discussion session 2007/03/08 Ryo Sugihara.
INTRA- AND INTERDOMAIN ROUTING Routing inside an autonomous system is referred to as intradomain routing. Routing between autonomous systems is.
Delivery, Forwarding and
© 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.
Link-State Routing Protocols
Link State Routing Protocols Last Update Copyright Kenneth M. Chipps Ph.D.
Lecture Week 10 Link-State Routing Protocols. Objectives Describe the basic features & concepts of link-state routing protocols. List the benefits and.
Review: routing algorithms. –Choose the appropriate paths. –Routing algorithms Flooding Shortest path routing (example). –Dijkstra algorithm. –Bellman-Ford.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
1 Routing Table  The seven fields Mask: for finding (sub)network address of the destination l Host-specific routing: (/32) l Default routing:
Chapter 11 Networking and Internetworking Devices BY Dr.Sukchatri Prasomsuk.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 2 Single-Area OSPF.
The Network Layer.
Distance Vector Routing Protocols Dynamic Routing.
Lecture #3 OSPF Asst.Prof. Dr.Anan Phonphoem Department of Computer Engineering, Faculty of Engineering, Kasetsart University, Bangkok, Thailand.
Networking and internetworking devices. Repeater.
ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.
Stainov - DataComMET CS TC5353 THE NETWORK LAYER 5.2 ROUTING ALGORITHMS - adaptive Distance Vector Routing (Bellman-Ford, Ford-Fulkenson). It was used.
OSPF Open Shortest Path First. Table of Content  IP Routes  OSPF History  OSPF Design  OSPF Link State  OSPF Routing Table  OSPF Data Packets.
Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.
Routing Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.
Routing Protocols Brandon Wagner.
Computer Networks22-1 Network Layer Delivery, Forwarding, and Routing.
Ch 22. Routing Direct and Indirect Delivery.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Link-State Routing Protocols Routing Protocols and Concepts – Chapter 10.
1 INTRA- AND INTERDOMAIN ROUTING Routing inside an autonomous system is referred to as intradomain routing. Routing between autonomous systems is referred.
CS440 Computer Networks 1 Link State Routing and OSPF Neil Tang 10/31/2008.
Network Layer (2). Review Physical layer: move bits between physically connected stations Data link layer: move frames between physically connected stations.
S305 – Network Infrastructure Chapter 5 Network and Transport Layers.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 2 Single-Area OSPF.
CSE 421 Computer Networks. Network Layer 4-2 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside.
+ Dynamic Routing Protocols 2 nd semester
Network Layer Routing Networks: Routing.
Open Shortest Path First (OSPF)
Introduction to Dynamic Routing Protocol
Working at a Small-to-Medium Business or ISP – Chapter 6
ROURING ALGORITHM: LINK STATE
CCNA 3 Chapter 3 Single-Area OSPF
Pertemuan 23 IP Routing Protocols
Instructor Materials Chapter 5: Dynamic Routing
16장. Networking and Internetworking Devices
Routing Protocols and Concepts
COMP 3270 Computer Networks
Link-State Routing Protocols
Dynamic Routing Protocols part2
What is a router? A router is a device that connects multiple computers together. Not to be confused with a switch Routers transmit packets of data across.
Single-Area OSPF (Open Shortest Path First Protocol)
Chapter 5 The Network Layer.
Chapter 5: Dynamic Routing
CHAPTER 10.
Dynamic Routing Protocols
Link-State Routing Protocols
Network Layer Routing Networks: Routing.
Dynamic Routing Protocols
Chapter 22. Network Layer: Routing
Link-State Routing Protocols
Working at a Small-to-Medium Business or ISP – Chapter 6
Network Layer Routing.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2001 Chapter 21 Networking and Internetworking Devices.
Presentation transcript:

OSPF Protocol

What is OSPF ? OSPF stands for Open Shortest Path First OSPF considered as thired layer Protocol OSPF is Industry Standard that means it is not monopoly for any company OSPF is a link-state Protocol

What is link-state Protocol ? developed to overcome the disadvantages of the distance vector protocols Each router is responsible for meeting its neighbors and learning their names. Each router constructs a link state packet (LSP) which consists of a list of names and cost for each of its neighbors. The LSP is transmitted to all other routers. Each router stores the most recently generated LSP from each other router. Each router uses complete information on the network topology to compute the shortest path route to each destination node.

How OSPF builds its routing table ? OSPF chooses the best route depending on the cost using this formula on each link Cost = 100,000,000/Line Speed

How OSPF builds its routing table ? OSPF uses Dijkstra’s Algorithm to choose the best route then comparing it to its database to build the routing table .

OSPF Routing tables

OSPF Routing tables # show ip route

OSPF Routing tables # show ip ospf database

OSPF Routing tables # show ip ospf neighbor