W7 L1 - Link-State Routing & OSPF

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/3

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

4 Terms

1
New cards

Dynamic Host Configuration Protocol (DHCP)

Goal: Dynamically obtain IP address from network server when it joins a network

Process:

  1. Client broadcasts for DHCP until it receives ACK and usable IP address

  2. Client accepts IP address

2
New cards

Network Address Translation (NAT)

All datagrams leaving local network have the same source NAT ip address, but different source port numbers.

  • In a network, NAT hides private IPs behind one public IP

  • NAT translates the internal IPs and Ports to a public IP port for outgoing traffic

  • Maintains “translation table” for routing replies back to the correct device

3
New cards

OSPF routing

Uses Dijkstras and adds to it for a real-world application for routing

  1. Each router learns about its neighbors

  2. Routers flood link-state advertisements (LSAs)

  3. Each router builds a full map of network

  4. Dijkstras algoithm runs

  5. Routing table updated

4
New cards

Hierarchical OSPF

Two-level hierarchy - local area, backbone

  • LSAs only flooded in one area

  • Each node has detailed area topology

<p>Two-level hierarchy - local area, backbone</p><ul><li><p>LSAs only flooded in one area</p></li><li><p>Each node has detailed area topology</p></li></ul><p></p>