lecture 3 ospf n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Lecture #3 OSPF PowerPoint Presentation
Download Presentation
Lecture #3 OSPF

Loading in 2 Seconds...

play fullscreen
1 / 31

Lecture #3 OSPF - PowerPoint PPT Presentation


  • 96 Views
  • Uploaded on

Lecture #3 OSPF. Asst.Prof. Dr.Anan Phonphoem Department of Computer Engineering, Faculty of Engineering, Kasetsart University, Bangkok, Thailand. Outline. Distance VS. Link-State Route selection Link-State network (OSPF) Link-State Operation Basic OSPF configuration and verification.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Lecture #3 OSPF' - cybele


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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
lecture 3 ospf

Lecture #3 OSPF

Asst.Prof. Dr.Anan Phonphoem

Department of Computer Engineering,

Faculty of Engineering, Kasetsart University,

Bangkok, Thailand

outline
Outline
  • Distance VS. Link-State
  • Route selection
  • Link-State network (OSPF)
  • Link-State Operation
  • Basic OSPF configuration and verification
terminology
Terminology
  • Link
  • Link-State
  • Link-State db
  • Area
  • Cost
  • Routing Table
  • Adjacency db
  • DR / BDR
ospf path cost
OSPF path cost

Cisco Default Value

cost weight in link state routing
Cost (weight) in link state routing

Cost is applied only by router

Cost is applied when packet leaves the router

link state packet
Link state packet

Cost: weight (traffic, security level, link state)

shortest path tree
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
basic configuration
Basic configuration
  • Wildcard-Mask
  • Area ID
basic configuration loopback
Basic configuration - Loopback
  • Setup Loopback
    • Ensure that at least one is active (For stability)
basic configuration priority
Basic configuration - priority
  • Setup priority
    • For DR/BDR selection