Link-State Routing Protocols

Routing Protocols and Concepts Chapter 10

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

Objectives

Describe the basic features & concepts of link-state routing protocols.

List the benefits and requirements of link-state routing protocols.

Key Terms

ITE PC v4.0 Chapter 1

Link-state Routing Protocol Shortest Path First Link-state Packet Link-state Database
2007 Cisco Systems, Inc. All rights reserved. Cisco Public

Whos Responsible for Link-State Protocols?

Edsger Dijkstra

Dijkstra's algorithm, solves the single-source shortest path problem for a directed graph with nonnegative edge weights.
Wikipidia
ITE PC v4.0 Chapter 1 2007 Cisco Systems, Inc. All rights reserved. Cisco Public

Link-State Routing Protocols

Also known as shortest path first algorithms

These protocols built around Dijkstras SPF

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

Difference Between LS and DV Protocols

Distance Vector protocols understand distant networks based on direction (example: signs)
Link State protocols create a topology (example: map)

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

Step 1: Determine Connected Networks

Router identifies directly connected networks Includes:
Link - Router Interface State - Information about the condition of the links

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

Step 2: Establish Neighbor Adjacencies

Hello packets are exchanged between routers with connected interfaces Once routers learn it has neighbors they form an adjacency

- Two adjacent neighbors will exchange hello packets

-These packets will also serve as keep alives
Verify that neighbor and states have not changed

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

Step 3: Builds the Link-State Packet

Each router builds its own Link State Packet (LSP)
Contents of LSP: - State of each directly connected link - Includes information about neighbors such as neighbor ID, link type, & bandwidth.

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

Step 4: Flooding LSPs to Neighbors

Once LSP are created they are forwarded out to neighbors Neighbors store the LSPs in a database After receiving the LSPs, the neighbor continues to forward it throughout routing area

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

Flooding LSPs to Neighbors (2)

LSPs are sent out under the following conditions -Initial router start up or routing process

-When there is a change in topology

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

10

Step 5: Constructing a Link State Topology

Routers use a database to construct a topology map of the network Best path selected from topology and placed in routing table

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

11

Sample Exchange of LSPs

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

12

Shortest Path First (SPF) Tree

Building a portion of the SPF tree

Process begins by examining R2s LSP information

-R1 ignores 1st LSP Reason: R1 already knows its connected to R2

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

13

Shortest Path First (SPF) Tree

Building a portion of the SPF tree -R1 uses 2nd LSP
Reason: R1 can create a link from R2 to R5. This information is added to R1s SPF tree

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

14

Shortest Path First (SPF) Tree

Building a portion of the SPF tree -R1 uses 3rd LSP
Reason: R1 learns that R2 is connected to 10.5.0.0/16. This link is added to R1s SPF tree.

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

15

Link-State Routing Path Determination

Determining the shortest path
The shortest path to a destination determined by adding the costs & finding the lowest cost

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

16

Link-State Routing Table

Once the SPF algorithm has determined the shortest path routes, these routes are placed in the routing table.

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

17

Routing Protocols Comparison Table

Advantages of a Link-State Routing Protocol

Routing protocol

Builds Topological map

Router can independently determine the shortest path to every network.

Convergence

A periodic/ event driven routing updates

Use of LSP

Distance vector

No

No

Slow

Generally No

No

Link State

Yes

Yes

Fast

Generally Yes

Yes

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

18

Link-State Hardware Requirements

Memory requirements
Typically link state routing protocols use more memory Processing Requirements

More CPU processing is required of link state routing protocols

Bandwidth Requirements

Initial startup of link state routing protocols can consume lots of bandwidth

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

19

Link State Routing Protocols

Two link state routing protocols used for routing IP -Open Shortest Path First (OSPF)

-Intermediate System-Intermediate System (IS-IS)

ITE PC v4.0 Chapter 1

2007 Cisco Systems, Inc. All rights reserved.

Cisco Public

20