Scribd
Upload
17 views3 pages

Forwading and Routing

This document discusses routing protocols and how routers communicate network topology changes. It covers: 1) The main functions of routing are forwarding packets using routing tables and updating tables when network changes occur. 2) Distance vector routing protocols use routing tables that each router shares with neighbors periodically and when changes occur, allowing routers to calculate shortest paths. 3) Link state routing protocols have each router flood link state packets describing its neighbors, allowing all routers to build identical maps of the network and independently calculate optimal routes using algorithms like Dijkstra's.

Uploaded by

harsharewards1
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
17 views3 pages

Forwading and Routing

This document discusses routing protocols and how routers communicate network topology changes. It covers: 1) The main functions of routing are forwarding packets using routing tables and updating tables when network changes occur. 2) Distance vector routing protocols use routing tables that each router shares with neighbors periodically and when changes occur, allowing routers to calculate shortest paths. 3) Link state routing protocols have each router flood link state packets describing its neighbors, allowing all routers to build identical maps of the network and independently calculate optimal routes using algorithms like Dijkstra's.

Uploaded by

harsharewards1
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/ 3

Forwarding and Unicast Routing protocols

The main function of NL (Network Layer) is routing packets from the source machine to the
destination machine.
There are two processes inside router:
a) One of them handles each packet as it arrives, looking up the outgoing line to use for it in
the routing table. This process is forwarding.
b) The other process is responsible for filling in and updating the routing tables. That is where
the routing algorithm comes into play. This process is routing.

routing table

static dynamic
A static A dynamic table is one that is updated updated
table is one wi ht automatically automatically when there is achange
manual entries. somewhere in the Internet.

A routing protocol is a combination of rules and procedures that lets routers in the Internet inform
each other of change

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 intra domain routing
➔ Routing between autonomous systems is referred to as inter domain routing
Distance Vector Routing

• In distance vector routing, the least-cost route between any two nodes is the route with
minimum distance/cost .
• In this protocol, as the name implies, each node maintains a vector (table)
of minimum distances to every node.
• Mainly 3 things in this
Initialization
Sharing
Updating
Initialization:
Each router prepares its routing table,by their local knowledge.
each router knows about-

•All the routers present in the network


•Distance to its neighboring routers

Sharing:Each router exchanges its distance vector with its neighboring routers.
• When to Share: the table is sent both periodically and when there is a change in the table

Updating:Each router prepares a new routing table using the distance vectors it has obtained from its
neighbors.
• For calculating shortest paths in routing algorithms we use Bellman Ford's Algorithm

D(x,y)=min{ c(x,v)+D(v,y)}

Let us take an example:

B C D updated A
A 5 2 3 0
B 0 4 - 5
C 4 0 - 2
D - - 0 3
E 3 4 - 6
(Routing information protocol)

Link State Routing

Building Routing Tables

➔Creation of the states of the links by each node, called the link state packet (LSP).
LSPs are generated on two occasions:
● 1. When there is a change in the topology of the domain
● 2. on a periodic basis: The period in this case is much longer compared to
distance vector.
➔Dissemination of LSPs to every other router, called flooding,in an efficient and reliable
way.
➔Formation of a shortest path tree for each node. (Dijkstra algorithm)

➔Routing table –A list of known paths and interfaces.


EXAMPLE:OSPF(open shortest path first)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy