cybele
Uploaded by
31 SLIDES
454 VUES
310LIKES

Understanding OSPF: A Comprehensive Overview of Link-State Routing Protocols

DESCRIPTION

This lecture provides an in-depth exploration of the Open Shortest Path First (OSPF) routing protocol, focusing on the differences between Distance Vector and Link-State routing methods. Key topics include route selection, the structure of Link-State networks, OSPF operation, and essential configuration and verification processes. Attendees will learn about OSPF network terminology, including concepts like Area, Cost, Routing Tables, and the Dijkstra algorithm for shortest path calculations. The session is designed for students and professionals in computer engineering and networking.

1 / 31

Download Presentation
Télécharger la présentation

Understanding OSPF: A Comprehensive Overview of Link-State Routing Protocols

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture #3 OSPF Asst.Prof. Dr.Anan Phonphoem Department of Computer Engineering, Faculty of Engineering, Kasetsart University, Bangkok, Thailand

  2. Outline • Distance VS. Link-State • Route selection • Link-State network (OSPF) • Link-State Operation • Basic OSPF configuration and verification

  3. Distance Vector VS. Link-State

  4. Pro/Con of Link-State

  5. OSPF RIP Route Selection

  6. Single-Area Multiple-Area OSPF Network

  7. Terminology • Link • Link-State • Link-State db • Area • Cost • Routing Table • Adjacency db • DR / BDR

  8. OSPF path cost Cisco Default Value

  9. OSPF Packet Header

  10. Concept of link state routing

  11. Cost (weight) in link state routing Cost is applied only by router Cost is applied when packet leaves the router

  12. Link state packet Cost: weight (traffic, security level, link state)

  13. Flooding of A’s LSP

  14. Link state database

  15. Shortest path tree • Build the tree, start by identifying a root  attach all reached nodes • Compare arcs and find the lowest cost  add this node (to be permanent) and its arcs (temp) • Examine database and identify the reachable node • Repeat the last two steps

  16. Costs in the Dijkstra algorithm

  17. Step1 Step2 Shortest path calculation

  18. Step3 Step4 Shortest path calculation

  19. Step5 Step6 Shortest path calculation

  20. Shortest path calculation – S7

  21. Shortest path calculation – S8

  22. Shortest path calculation – S9

  23. Shortest path calculation – S10

  24. Shortest path calculation – S11

  25. Shortest path calculation – S12

  26. Shortest path calculation – S13

  27. Link state routing table for router A

  28. Basic configuration • Wildcard-Mask • Area ID

  29. Basic configuration - Loopback • Setup Loopback • Ensure that at least one is active (For stability)

  30. Basic configuration - priority • Setup priority • For DR/BDR selection

  31. OSPF verification

More Related
SlideServe
Audio
Live Player
Audio Wave
Play slide audio to activate visualizer
Slide 1

Sea Ice

Slide Player

AI NARRATOR Slide 1 of 12

Sea Ice

0:00 0:15