Scribd
Upload
506 views23 pages

Fixed Routing, Adaptive Routing and Flooding

The document discusses routing algorithms in computer networks. It begins by reviewing concepts from the previous class, such as datagram versus virtual circuit networks. It then covers different types of routing algorithms including static algorithms like shortest path and flooding. Adaptive dynamic routing algorithms are also discussed, specifically distance vector routing where routers exchange routing information with neighbors to update their routing tables, and link state routing. Examples are provided to illustrate distance vector routing updates over multiple time intervals.

Uploaded by

Selva Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
506 views23 pages

Fixed Routing, Adaptive Routing and Flooding

The document discusses routing algorithms in computer networks. It begins by reviewing concepts from the previous class, such as datagram versus virtual circuit networks. It then covers different types of routing algorithms including static algorithms like shortest path and flooding. Adaptive dynamic routing algorithms are also discussed, specifically distance vector routing where routers exchange routing information with neighbors to update their routing tables, and link state routing. Examples are provided to illustrate distance vector routing updates over multiple time intervals.

Uploaded by

Selva Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 23

Introduction to Computer Networks

CMPE 150
Fall 2005 Lecture 21

CMPE 150- Introduction to Computer Networks

Announcements
Homework 4 up. Due on 11.23.05. Lab this week:
The Internet Behind the Web video.

CMPE 150- Introduction to Computer Networks

Today
Finish DLL!

CMPE 150- Introduction to Computer Networks

Last Class
Network Layer.
Focus on packet switching networks. Main functions. Different network layer implementations.
Datagrams versus virtual circuits.

CMPE 150- Introduction to Computer Networks

Virtual-Circuit versus Datagram Subnets

5-4

CMPE 150- Introduction to Computer Networks

Routing

CMPE 150- Introduction to Computer Networks

Routing
One of the main functions of network layer. Routing versus forwarding? Datagram versus VC networks?

CMPE 150- Introduction to Computer Networks

Routing Algorithm
Computes routing tables. Properties:
Correctness. Robustness. Stability. Optimality.
Try to optimize a certain metric.

CMPE 150- Introduction to Computer Networks

Optimality Principle
General statement about optimal routes (topology, routing algorithm independent). If router J is on optimal path between I and K, then the optimal path from J to K also falls along the same route.
Proof by contradiction.

Corollary:
Set of optimal routes from all sources to destination form a tree rooted at destination. Sink tree.
CMPE 150- Introduction to Computer Networks

Types of Routing Algorithms


Non-adaptive versus adaptive.

CMPE 150- Introduction to Computer Networks

10

Adaptive and Non-adaptive Routing


Non-adaptive routing:
Fixed routing, static routing. Do not take current state of the network (e.g., load, topology). Routes are computed in advance, off-line, and downloaded to routers when booted.

Adaptive routing:
Routes change dynamically as function of current state of network. Algorithms vary on how they get routing information, metrics used, and when they change routes.
CMPE 150- Introduction to Computer Networks

11

Static Algorithms
(Non-Adaptive)

1.Shortest-path routing. 2.Flooding.

CMPE 150- Introduction to Computer Networks

12

Shortest-Path Routing
Problem: Given a graph, where nodes represent routers and edges, links, find shortest path between a given pair of nodes. What is shortest in shortest path?
Depends on the routing metric in use. Example: number of hops (static), geographic distance (static), delay, bandwidth (raw versus available), combination of a subset of these.

Dijkstras shortest-path algorithm (19590.

CMPE 150- Introduction to Computer Networks

13

Dijkstras Shortest-Path Algorithm


Initially, links are assigned costs. As the algorithm executes, nodes are labeled with its distance to source along best known path. Initially, no routes known, so all nodes are labeled with infinity. Labels change as the algorithm proceeds. Labels can be temporary or permanent.
Initially all labels are tentative. A label becomes permanent if it represents the shortest path from the source to the node.
CMPE 150- Introduction to Computer Networks

14

Shortest Path Routing


Find shortest-path from A to D:
Label each adjacent node with distance to A.

Start

B is made permanent.

CMPE 150- Introduction to Computer Networks

15

Flooding
Every incoming packet forwarded on every outgoing link except the one it arrived on. Problem: duplicates. Constraining the flood:
Hop count. Keep track of packets that have been flooded.

Robust, shortest delay (picks shortest path as one of the paths).

CMPE 150- Introduction to Computer Networks

16

Flooding: Example

Stallings Figure 12.4 (hop-count=3)


17

CMPE 150- Introduction to Computer Networks

Dynamic Routing Algorithms


(Adaptive Routing)
Distance vector routing. Link state routing.

CMPE 150- Introduction to Computer Networks

18

Distance Vector Routing


Aka, Bellman-Ford (1957), Ford-Fulkerson (1962). Original ARPANET routing; also used by Internets RIP. Each router keeps routing table (or routing vector) with best known distance to each destination and corresponding outgoing interface. Routing tables are updated by exchanging routing information with neighbors.
CMPE 150- Introduction to Computer Networks

19

Distance Vector (Contd)


Routing table at each router:
One entry per participating router. Each entry contains outgoing interface and distance to corresponding destination. Metric: number of hops, delay, queue length. Each router knows distance to its neighbors.

Old ARPANET algorithm: DV where cost metric is outgoing link queue length.

CMPE 150- Introduction to Computer Networks

20

Distance Vector Routing

(a) A subnet. (b) Input from A, I, H, K, and the new routing table for J.
21

CMPE 150- Introduction to Computer Networks

Routing Updates
Every T interval, routers exchange routing updates. Routing update from router X consists of a vector with all destinations and the corresponding distance from X to them. When router Y receives an update from X, it can estimate its distance to router Z through X as Dyz = Dyx + Dxz. Router Y receives update from all its neighbors and builds a new RT.
22

CMPE 150- Introduction to Computer Networks

Distance Vector: Example


2
2 1 1 4 1 2 3 4 5 6 5 2 9 79 3 3 1 5 2 2 4 4 4 4 T=T2

3
6

Node Distance Next

1
2 3 4 5 6

0
2 5 1 6 8 T=T0

2 3 4 3 3

2 3 0 3 2 3 5

3 7 4 0 2 1 3

4 5 2 2 0 1 3

Node Distance Next

0 2 3 1 2 4

T=T1

CMPE 150- Introduction to Computer Networks

23

You might also like