Dynamic routing is a networking technique that provides optimal data routing. Unlike static routing, dynamic routing enables routers to select paths according to real-time logical network layout changes. ... The most popular are Routing Information Protocol (RIP) and Open Shortest Path First (OSPF).

1. BABA GHULAM SHAH BADSHAH UNIVERSITY (RAJOURI)
AJEELA MUSHTAQ

2. BABA GHULAM SHAH BADSHAH
UNIVERSITY- RAJOURI (J&K).
DEPARTMENT OF COMPUTER
SCIENCES
PRESENTATION TOPIC:-
PRESENTED BY:-
Ajeela Mushtaq Roll NO:-13-Mcs-15
PRESENTED To:-
DR. SANJAY JAMWAL
dynamic routing

3. OUTLINE :
•
ROUTING
•
STATIC ROUTING
•
DYNAMIC ROUTING
1. DISTANCE VECTOR ROUTING
2. LINK STATE ROUTING

4. ROUTING
•
The process of moving a packet of data from source to destination.
•
Routing is usually performed by a dedicated device called a router.
•
Routing is a key feature of the Internet because it enables messages
to pass from one computer to another and eventually reach the
target machine.

5. TYPES :
1. Static Routing.
2. Dynamic routing

6. STATIC ROUTING
•
Static routing is a type of network routing technique.
•
Static routing is not a routing protocol; instead, it is the manual
configuration and selection of a network route, usually managed by
the network administrator.
•
It is employed in scenarios where the network parameters and
environment are expected to remain constant.

7. DYNAMIC ROUTING
•
Dynamic routing is the process of locating a clear path from a
source point to a destination point across a network of nodes
that could change at any point.
•
In computer networking, adaptive routing algorithms are used to
ensure that data packets can move from one point in the
network to another, even if the one or more nodes in between
are unavailable.

8. Example
•
The most widely available example of adaptive routing is the Internet,
which is essentially a worldwide computer network. Data travels
across this network from node to node, server to server. The Internet
is a dynamic network and implements special routing algorithms. This
means that if several servers between two cities are unavailable, the
algorithms will find a new path from one city to the other through
whatever nodes are available.

9. •
Even in a dynamically routed network, the most direct and shortest
path is first attempted.
•
Using protocols, data is able to collect the topography of the network
it is moving across to determine what routes are viable and which
route is the quickest.
•
This information relies on the state of a network. State information is
transferred through adaptive routing protocols from each node.

10. •
People using a transport system can display dynamic routing.
•
For example, if a local railway station is closed, people can alight from
a train at a different station and use another method, such as a bus,
to reach their destination.

11. Link state
ROUTING PROTOCOLS
InterdomainIntradomain
Path vector
Distance
vector

20. LINK STATE ROUTING
•
In link state routing protocols, each router describes itself and its
interfaces to its directly connected objects; these objects can be
either neighboring adjacent routers, or they can be directly attached
networks.
•
This information is passed unchanged from one router to another, so
that in the end, every router knows about every other router, its
interfaces and what exactly they connect to.

21. •
In essence, in link state routing protocols, each router knows the
entire network topology of every single router and every single
interconnection, also called the state of a link, hence the name link
state routing protocol.
•
Link state routing protocols allow a router to have a complete map of
the network , and use specific algorithms to find the shortest paths to
every object in the network.

23. Building Routing Tables
in link state routing, four sets of actions are required to ensure that
each node has the routing table showing the least-cost node to every
other node:
1. Creation of the states of the links by each node, called the link
state packets(LSP).
2. Dissemination of LSP’s to every other called flooding, in an
efficient way.

24. 3. Formation of a shortest path tree for each node.
4.calculation of a routing table based on the shortest path tree.

25. Dijkstra Algorithm

31. Advantages of Dynamic Routing:
1. Simpler to configure on larger networks.
2. Will dynamically choose a different (or better) route if a link goes
down.
3. Ability to load balance between multiple links.
Disadvantages of Dynamic Routing:
1. Updates are shared between routers, thus consuming bandwidth.
2. Routing protocols put additional load on router CPU/RAM.

32. Thank you…!
Have a nice day
32