Scribd
Upload
71 views

Distance Vector Routing

Distance vector routing protocols allow routers to share routing information with neighbors. Each router maintains a routing table showing the minimum distance to reach all other nodes and the next hop to take. Routers periodically share their routing tables with neighbors so they can learn alternate paths to destinations. When a router receives an update, it adds the cost to reach the sender and uses the information to potentially update its own routing table.

Uploaded by

sumipriyaa
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
71 views

Distance Vector Routing

Distance vector routing protocols allow routers to share routing information with neighbors. Each router maintains a routing table showing the minimum distance to reach all other nodes and the next hop to take. Routers periodically share their routing tables with neighbors so they can learn alternate paths to destinations. When a router receives an update, it adds the cost to reach the sender and uses the information to potentially update its own routing table.

Uploaded by

sumipriyaa
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 9

UNICAST ROUTING PROTOCOLS

 A routing table can be either static or dynamic.


 A static table is one with manual entries.
 A dynamic table is one that is updated
automatically when there is a change somewhere
in the Internet.
 A routing protocol is a combination of rules and
procedures that lets routers in the Internet inform
each other of changes.
Intra- and Interdomain Routing
Popular routing protocols
Distance Vector Routing
 In distance vector routing, the least-cost route
between any two nodes is the route with
minimum distance.
 In this protocol, as the name implies, each node
maintains a vector (table) of minimum
distances to every node.
 The table at each node also guides the packets
to the desired node by showing the next stop in
the route (next-hop routing).
Distance vector routing tables
Initialization of tables in distance vector routing
Sharing
 In distance vector routing, each node shares its routing table
with its immediate neighbors periodically and when there is
a change.
 Although node A does not know about node E, node C does.
So if node C shares its routing table with A, node A can also
know how to reach node E. On the other hand, node C does
not know how to reach node D, but node A does.
 If node A shares its routing table with node C, node C also
knows how to reach node D.
 In other words, nodes A and C, as immediate neighbors, can
improve their routing tables if they help each other.
Updating
When a node receives a two-column table from a neighbor, it
needs to update its routing table. Updating takes three steps:
1. The receiving node needs to add the cost between itself
and the sending node to each value in the second column.
2. The receiving node needs to add the name of the sending
node to each row as the third column if the receiving node
uses information from any row. The sending node is the
next node in the route.
3. The receiving node needs to compare each row of its old
table with the corresponding row of the modified version
of the received table.
a. If the next-node entry is different, the receiving node
chooses the row with the smaller cost. If there is a tie, the
old one is kept.
b. If the next-node entry is the same, the receiving node
chooses the new row.
Updating in distance vector routing

You might also like