Scribd
Upload
13 views6 pages

R20 Shortest Path in CN

The document discusses the concepts of intradomain and interdomain routing within autonomous systems (AS) due to the complexity of large networks. It explains the Distance Vector Routing scheme, where routers share their routing tables with neighbors and update them based on received distance vectors using the Bellman-Ford algorithm. An example illustrates how routers calculate the shortest path to destination nodes by considering intermediate nodes in the network.

Uploaded by

vinay.nani919
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
13 views6 pages

R20 Shortest Path in CN

The document discusses the concepts of intradomain and interdomain routing within autonomous systems (AS) due to the complexity of large networks. It explains the Distance Vector Routing scheme, where routers share their routing tables with neighbors and update them based on received distance vectors using the Bellman-Ford algorithm. An example illustrates how routers calculate the shortest path to destination nodes by considering intermediate nodes in the network.

Uploaded by

vinay.nani919
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/ 6

OPTIMALITY PRINCIPLE:

Flooding Algorithm:
Intra- and Interdomain Routing: Today, an internet can be so large that one routing
protocol cannot handle the task of updating the routing tables of all routers. For this
reason, an internet is divided into autonomous systems. An autonomous system (AS)
is a group of networks and routers under the authority of a single administration.
Routing inside an autonomous system is referred to as intradomain routing. Routing
between autonomous systems is referred to as interdomain routing.

Distance Vector Routing:


●​ In this routing scheme, each router periodically shares its knowledge about the
entire network with its neighbours.

●​ Each router has a table with information about the network. These tables are
updated by exchanging information with the immediate neighbours.

●​ It is also known as Belman-Ford Algorithm.

●​ Bellman Ford Basics – Each router maintains a Distance Vector table containing the
distance between itself and ALL possible destination nodes. Distances,based on a
chosen metric, are computed using information from the neighbours’ distance
vectors.

Distance Vector Algorithm –

●​ A router transmits its distance vector to each of its neighbours in a routing packet.

●​ Each router receives and saves the most recently received distance vector from each
of its neighbours.

●​ A router recalculates its distance vector when:

●​ It receives a distance vector from a neighbour containing different information than


before.

When a node x receives new DV estimate from any neighbour v, it saves v’s distance vector
and it updates its own DV using B-F equation:

●​ Dx(y) = min { C(x,v) + Dv(y), Dx(y) } for each node y ∈ N

Example – Consider 3-routers X, Y and Z as shown in figure. Each router have their routing
table. Every routing table will contain distance to the destination nodes.​

​
Consider router X , X will share it routing table to neighbours and neighbours will share it
routing table to it to X and distance from node X to destination will be calculated using
bellmen- ford equation.

Dx(y) = min { C(x,v) + Dv(y)} for each node y ∈ N

As we can see that distance will be less going from X to Z when Y is intermediate node(hop)
so it will be update in routing table X.
​
Similarly for Z also –

Finally the routing table for all –


​

You might also like