Scribd
Upload
16 views23 pages

Week 08-09 - Ch20 - p1

This document discusses unicast routing and provides an overview of routing algorithms. It describes how unicast routing works, with routers using forwarding tables to hop packets from source to destination. It then covers three routing algorithms: distance-vector routing, where routers continuously share routing information with neighbors; link-state routing, where each router shares link information with all routers; and path-vector routing, which allows sending packets along specific policy-based routes. The document uses diagrams and examples to illustrate how the different algorithms calculate least-cost routes and build forwarding tables.

Uploaded by

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

Week 08-09 - Ch20 - p1

This document discusses unicast routing and provides an overview of routing algorithms. It describes how unicast routing works, with routers using forwarding tables to hop packets from source to destination. It then covers three routing algorithms: distance-vector routing, where routers continuously share routing information with neighbors; link-state routing, where each router shares link information with all routers; and path-vector routing, which allows sending packets along specific policy-based routes. The document uses diagrams and examples to illustrate how the different algorithms calculate least-cost routes and build forwarding tables.

Uploaded by

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

King Fahd University of Petroleum & Minerals

College of Computer Science & Engineering

Information & Computer Science Department

ICS 343
Fundamentals of Computer Networks

Unicast Routing

These slides are based on:


Chapter 20, Data Communications and Networking, 5th Edition
Outline

◼ 20.1 Introduction
◼ 20.2 Routing Algorithms
◼ 20.3 Unicast Routing Protocols
20.1.1 General Idea

◼ In unicast routing, a packet is routed, hop by hop, from its source


to its destination with the help of forwarding tables.

◼ The source host needs no forwarding table because it delivers its


packet to the default router in its local network.

◼ The destination host needs no forwarding table either because it


receives the packet from its default router in its local network.

◼ This means that only the routers that glue together the
networks on the internet need forwarding tables.
20.1.2 Least-Cost Routing

◼ When the internet is modeled as a weighted graph, one of the


ways to find the best route from the source router to the
destination router is to find the least cost between the two.

◼ In other words, the source router chooses a route to the


destination router in such a way that the total cost for the route
is the least cost among all possible routes.
Figure 20.1: An Internet and its Graphical Representation
Least-Cost Trees for Nodes in the Internet of Figure
20.1
20.2 ROUTING ALGORITHMS

◼ Several routing algorithms have been designed in the past.

◼ The differences between these methods are in


◼ the way they find the least cost and
◼ the way they create the least-cost tree for each node.

◼ In this section, we discuss the common algorithms; later we


show how a routing protocol in the Internet implements one of
these algorithms.
20.2 ROUTING ALGORITHMS

◼ Three Routing algorithms:

◼ Distance-Vector Routing
◼ Link-State Routing
◼ Path-Vector Routing
Graphical Idea Behind Bellman-Ford Equation
Distance-Vector Routing

◼ The goal of distance-vector (DV) routing is to find the best


route.

◼ In distance-vector routing, the first thing each node creates is


its own least-cost tree with the simple information it has about
its immediate neighbors.

◼ The incomplete trees are exchanged between immediate


neighbors to make the trees more and more complete and to
represent the whole internet.

◼ We can say that in distance-vector routing, a router


continuously tells all of its neighbors what it knows about the
whole internet.
The Distance Vector Corresponding to a Tree
The First Distance Vector for an Internet
The First Distance Vector for an Internet
Two-Node Instability
20.2.2 Link-State Routing

◼ A routing algorithm that directly follows our discussion for


creating least-cost trees and forwarding tables is Link-State
(LS) routing.

◼ This method uses the term link-state to define the


characteristics of a link (an edge) that represents a network in
the internet.

◼ In this algorithm the cost associated with an edge defines the


state of the link.

◼ Links with lower costs are preferred to links with higher costs;
if the cost of a link is infinity, it means that the link does not
exist or has been broken.
Example of a Link-State Database (LSDB)

◼ The LSDB can be represented as a two-dimensional


array (matrix) in which the value of each cell defines
the cost of the corresponding link.
LSPs Created and Sent out by each Node to Build LSDB
Link-State vs Distance-Vector Routing

◼ In the distance-vector routing algorithm, each router


tells its neighbors what it knows about the whole
internet.

◼ In the link-state routing algorithm, each router tells


the whole internet what it knows about its
neighbors.
Least-Cost Tree (Dijkstra Algorithm)
20.2.3 Path-Vector Routing
◼ Both link-state and distance-vector routing are based on the
least-cost goal.

◼ However, there are instances where this goal is not the


priority.

◼ For example, assume that there are some routers in the


internet that a sender wants to prevent its packets from going
through.

◼ In other words, the least-cost goal, applied by LS or DV


routing, does not allow a sender to apply specific policies to
the route a packet may take.

◼ To respond to these demands, a third routing algorithm, called


path-vector (PV) routing has been devised.
Path Vectors made at Booting Time
Updating Path-Vectors
Outline

◼ 20.1 Introduction
◼ 20.2 Routing Algorithms
◼ 20.3 Unicast Routing Protocols

Important to do at home :
- Read chapter 20 of the textbook

You might also like