TYPES OF ROUTING PROTOCOLS

1. ROUTING

2. DEFINITION
IP Routing is the process of moving Packets from
one Network to another Network by using
routers.

3. NEED ROUTER ???

4. WHY IT NEEDS ROUTER HERE??

5. ROUTING TABLE
In computer networking a routing table is
a data table stored in a router that lists the
routes to particular network destinations,
metrics (distances) associated with those
routes.

6. DIAGRAM OF ROUTING TABLE

7. STATIC ROUTING
In static routing the routes are described by
fixed paths through a data network.
The hosts which are present in the same router
are entered are entered by system
administrator.
No routing algorithm or update mechanisms are
required.

8. DYNAMIC ROUTING
Dynamic Routing is used whenever the topology
changes frequently.
No Need to enter the Address belongs to the
network manually.
Here Routing Algorithms are used to calculate
the Route to destination.

9. PROACTIVE ROUTING PROTOCOLS
In this protocol all the nodes maintain the
information about the next node.
All the mobile nodes of this protocol have to
relay its entries to its adjacent nodes.

10. PROACTIVE ROUTING PROTOCOLS
Whenever any changes occurs in the topology, it
generates large number of control messages.
So the control messages consumes more
amount of Bandwidth.

11. REACTIVE ROUTING PROTOCOLS
Reactive protocols seek to set up routes on-
demand.
If a node wants to initiate communication with a
node to which it has no route, the routing protocol
will try to establish such a route by using Flooding
technique.
It reduces the large overhead information of
messages.

12. HYBRID ROUTING PROTOCOLS
It is a combination of Proactive and Reactive
Routing protocols.
It is used to increase the scalability of nodes in a
network.

13. DIFFERENCES BETWEEN PROACTIVE
AND REACTIVE
1) The delivery of packets is more efficient in
Reactive protocol than Proactive.
2) The performance is better in Reactive
protocol (Since it generates less control
messages).
3) Reactive consumes less Bandwidth.
4) The routing tables are updated only when
there is any changes in topology.

14. MANET ROUTING PROTOCOLS

15. DSDV
Stands for Destination Sequenced Distance
Vector Routing Protocol.
It is a Table Driven Routing Protocol which
extends the Bellman Ford.
In DSDV, each nodes maintain a Routing Table
where the Destination and number of hops to
reach destination are recorded.

16. DSDV
Each node which are participating in the
topology knows the list of nodes, links and the
cost of each nodes.
The routing information are updated
periodically. Periodic updates are sent out after
every interval of 15s

17. DSDV
Sequence Number is used to differentiate the
Stale routes from new routes.

18. STEPS IN DSDV
1) Each Router in the network collects the
Information of all the neighboring Routers.
2) After gathering Information, the node
determines the shortest path to reach all the
destinations.
3) Based on it new Routing table is created and
the table is known to all the neighbors.

19. PROS OF DSDV
1) Since the paths to all destinations are known
less delay is required in the path set up
process.

20. CONS OF DSDV
1) DSDV requires a regular update of its routing
tables, which uses up battery power and a small
amount of bandwidth.
2) DSDV is not suitable for highly dynamic or
large scale networks.

21. DSR
Stands for Dynamic Source Routing.
The sender of a packet determines the complete
sequence of nodes and records the exact path in
packet header.
In this protocol, the nodes do not need to exchange
the Routing table periodically, instead the Routing
table is updated when there is any change in
topology.

22. DSR
Since the Routing table is updated when there is
any change in topology the control messages is
reduced which conserve the Bandwidth.
Routing cache is updated when there is a change
in topology.

23. PHASES OF DSR
1) ROUTE DISCOVERY
When a node has to send a packet it first
checks the routing cache, if it finds a valid route in
the routing cache it delivers the packet to the
destination.
Otherwise it broadcasts Route Request
packet to all its neighbors. Upon the receipt of
Route Request packet it initiate the Route Reply
that knows the route to destination.

24. DSR ROUTE DISCOVERY

25. DSR ROUTE DISCOVERY

26. DSR ROUTE DISCOVERY

27. DSR ROUTE DISCOVERY AND ROUTE
REPLY

28. DSR ROUTE DISCOVERY AND ROUTE
REPLY

29. DSR ROUTE DISCOVERY AND ROUTE
REPLY

30. PHASES OF DSR
2) ROUTE MAINTENANCE
It is the process of monitoring the route in
use and taking corrective action when needed.
When a node finds to be broken because of
the shutdown, the nodes should not exchange any
information

31. PHASES OF DSR
When a node is broken it should send a Route Error
packet, which indicates the next hop is not
available.
As soon as a node receives a Route Error packet the
corresponding packet must be removed from the
cache.
It tries to rediscover a new route to reach the
destination.

32. CONS OF DSR
In DSR Routing along with the data the entire
path is sent over the network.
As the network size increases, the length of the
path increases which consumes more
bandwidth.

33. AODV
Stands for Adhoc On Demand Distance Vector
Protocol.
It is a Reactive Routing protocol (i.e.) The routes are
created only when it is needed (On Demand).
AODV protocol makes use of HOP count, sequence
number to route the packets from source to
destination.

34. ROUTE REQUEST
Route Discovery mechanism is based on RREQ
(Route Request) and RREP (Route Reply).
The Source node that needs a route to the
destination issues a Route Request. The Route
Request consists of following fields

35. ROUTE REPLY
The Route Reply is used to forward the packet
from where the packet gets requested.

36. EXAMPLE

37. EXAMPLE

38. EXAMPLE

39. EXAMPLE

40. EXAMPLE

41. ZONE ROUTING PROTOCOL
It is a Hybrid Routing Protocol.
Within a zone Table Driven (Pro Active Routing
Protocol) is used. This implies regular updates
takes place only within the zone.
If a node is outside the zone Reactive Routing
protocol is used.