Scribd
Upload
19 views22 pages

ESET 315 Lecture LinkStateRouting

Uploaded by

bsporras04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
19 views22 pages

ESET 315 Lecture LinkStateRouting

Uploaded by

bsporras04
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 22

ESET 315 – Local and

Metropolitan Area
Networks

Lecture Link State Routing


(OSPF)

Instructor: Dr. Ana Goulart


Texas A&M - ETID Department - 1
Distance vector
Examples of Interior Routing protocols
Link state

RIP v1  Obsolete,but still used


 Adequate for small and simple networks
 Router-to-router reports generates lots of traffic
 Switchover from a failed path to a good path can take minutes

RIP v2  Supports more flexible addressing


 Switchover from failed path still slow

Open Shortest Path Scales to very large networks


Routers build detailed network maps
First (OSPF)
Router-to-router reports consume negligible amounts of traffic.
Switchover from a failed path can occur within a few seconds

Internet Gateway  Cisco proprietary (old version)


 Router-to-router reports generates lots of traffic
Routing Protocol
 Provide routers with detailed throughput, delay and reliability
(IGRP)
information

Enhanced Internet  Cisco proprietary (current version)


 Enhanced algorithm for loop prevention (better convergence)
Gateway Routing
 Router-to-router reports consume negligible amounts of traffic.
Protocol (EIGRP)
 Switchover occurs2 fairly quickly
Difference between distance
vector and link state
• Distance vector:
– Each node talks only to its directly connected
neighbors, but it tells them everything it has
learned (i.e., its whole routing table)
• Link state:
– Each node talks to all other nodes, but it tells
them only what it knows for sure (i.e., only the
state of its directly connected links).

Texas A&M - ETID Department - 3


ENTC 315
Link State Routing Protocols
(OSPF) (Section 3.3.3)
1. Every router sends advertisements about its
directly connected links to every router in its
area.
2. Every router uses the advertisements to
construct a graph of area network.
3. Routers run Dijkstra’s single-source shortest
path algorithm on the graph to determine
shortest paths to all routers in area.

Electronics & 4 IP Routing


Telecommunications
Step 1 - Every router sends advertisements about
its directly connected links to every router in its
area

• Link state packet (LSP) is sent to all


routers with the following information:
– The ID of the node that created the LSP
– A list of directly connected neighbors of that
node, with the cost of the link to each one
– A sequence number
– A time to live for this packet

Electronics & 5 IP Routing


Telecommunications
Reliable flooding of link state packets
X A X A

C B D C B D

(a) (b)

X A X A

C B D C B D

(c) (d)
Electronics & 6 IP Routing
Telecommunications
OSPF Hello Packets

• A router running OSPF discovers its neighbors


by sending and receiving a hello packet (every
10 sec. by default.)
• Allows for less frequent LSP.
• LSPs sent out every 30 minutes
• Incremental updates are sent when a change is
perceived.

Electronics & 7 IP Routing


Telecommunications
Deleting Links
• If a hello packet is not received over 40
seconds, the link is deleted from the
routing table, and an update is flooded for
the router without the link.

Electronics & 8 IP Routing


Telecommunications
Link State Routing Protocols
(OSPF)
1. Every router sends advertisements about its
directly connected links to every router in its
area.
2. Every router uses the advertisements to
construct a graph of area network.
3. Routers run Dijkstra’s single-source shortest
path algorithm on the graph to determine
shortest paths to all routers in area.

Electronics & 9 IP Routing


Telecommunications
How to calculate Shortest Path
• Dijkstra Algorithm - Example

3
1 2 3 2
1 1
1 6

4 4 4
Assume 1 5
this is our
source node

Each node i is labeled with an estimate Di of the shortest path length to node 1
How to calculate Shortest Path
• Dijkstra Algorithm – Main Steps

Step 1: (find the next closest node). Find i Є P such that

Di = min Dj Set P := P U {i} . If P contains all nodes, then stop.


jЄP

Step 2: (updating of labels). For all j Є P set

Dj := min [Dj, dji + Di]

Go to Step 1.
How to calculate Shortest Path
• Dijkstra Algorithm

D2 = 1 D3 = ∞

2 3
D6 = ∞
1
6

4 5
P = {1}
D4 = 4 D5 = ∞

When the estimate becomes certain, we regard the node as being “permanently
Labeled” and keep track of this with a set of P of permanently labeled nodes.
How to calculate Shortest Path
• Dijkstra Algorithm

D2 = 1
2 3

1
6

4 5

P = {1, 2}
How to calculate Shortest Path
• Dijkstra Algorithm

D2 = 1 D3 = 4

2 3
D6 = ∞
1
6

4 5
P = {1, 2} D4 = 4 D5 = 2

Step 1: (find the next closest node).


How to calculate Shortest Path
• Dijkstra Algorithm

D2 = 1 D3 = 4

2 3
D6 = ∞
1
6

4 5
P = {1, 2} D4 = 4 D5 = 2

Step 1: (find the next closest node).


How to calculate Shortest Path
• Dijkstra Algorithm

D2 = 1
2 3

1
6

4 5
P = {1, 2, 5}
D5 = 2

Step 2: update labels


How to calculate Shortest Path
• Dijkstra Algorithm

D3 = 3
D2 = 1
2 3

1
6

4 D6 = 6
5
P = {1, 2, 5} D4 = 3 D5 = 2

Step 1: find the closest node


How to calculate Shortest Path
• Dijkstra Algorithm

D3 = 3
D2 = 1
2 3

1
6

4 5
D4 = 3 D5 = 2
P = {1, 2, 3, 4, 5}
Step 2: update labels
How to calculate Shortest Path
• Dijkstra Algorithm

D3 = 3
D2 = 1
2 3
D6 = 5
1
6

4 5
D4 = 3 D5 = 2
P = {1, 2, 3, 4, 5}
Step 1: find closest node
How to calculate Shortest Path
• Dijkstra Algorithm - Example

D3 = 3
D2 = 1
2 3
D6 = 5
1
6

4 5
D4 = 3 D5 = 2
P = {1, 2, 3, 4, 5, 6}

Step 2: update labels


Source Node 1 1 4
1 1
1 2 5
1 3 6
2

Destination Next Hop Cost


Node 2 - 1

Node 3 Node 2 3

Node 4 Node 2 3

Node 5 Node 2 2

Node 6 Node 2 5
Questions
• Readings for next class
– Section on Routing Protocols (Section 3.3)

Texas A&M - ETID Department - 22


ENTC 315

You might also like