Here it has all the basic concepts of routing protocol but I think it will better for ur's seminar topic....

2. ROUTING PROTOCOLS
• Routing protocols are the set of rules used by the
routers to communicate between source & destination.
They do not move the information source to
destination only update the routing table.
• Each protocol has its own algorithm to choose the best
path.
• The metrics by routing protocols:-
• Number of network layer devices along with the path
(hop count)
• Bandwidth
• Delay
• Load

3. TYPES OF ROUTING PROTOCOL
DYNAMIC ROUTING
PROTOCOL
STATIC ROUTING
PROTOCOL
OSPF
EIGRP
RIP
RIPV2
LINK STATE
DISTANCE
VECTOR
RIPV1
TYPES OF ROUTING PROTOCOL
STATIC ROUTING
PROTOCOL
OSPF
EIGRP
LINK STATE
DISTANCE
VECTOR
RIPV1
DEFAULT
ROUTING
PROTOCOL

4. STATIC ROUTING PROTOCOLS
• Static routing ,when an administrator manually assigns
the path from source to destination network. This is
feasible in small networks, but not in large networks.
Advantages:-
– No overhead on router CPU.
– No bandwidth usage between links.
– Security (only administrator add routes.)
Disadvantages:-
– All link will be down on a link failure.
– Not practical on large networks.
– Administrator must update all routes.

5. CONFIGURATION

6. DEFAULT ROUTING PROTOCOLS
• Default Route is the network route used by a router when
there is no other known route exists for a given IP
datagram’s destination address. All the IP datagrams with
unknown destination address are sent to the default route.
Advantages:-
– No overhead on router CPU.
– No bandwidth usage between links.
– Security (only administrator add routes.)
Disadvantages:-
– All link will be down on a link failure.
– Not practical on large networks.
– Administrator must update all routes.

7. CONFIGURATION

8. DYNAMIC ROUTING PROTOCOLS
• Dynamic routing is the process in which routing tables
are automatically updates by routing table of each
neighbor.
– Dynamically discover & maintains routes.
– Calculate routes
Advantages
– Less work in maintaining the configuration when adding &
deleting networks.
– Protocols automatically react to the topology changes.
– Configuration is less-prone.
Disadvantages
– Routers resource are used.
– More administrator knowledge is required for configuration

9. DV and LS

10. RIP
• It allows routers to exchange their routing tables at
a predefined interval.
• It is a distance-vector routing protocol which
employs the hop count as a routing metric.
• It transmitted updates in every 30 seconds.
CHARACTERISTICS: -
Uses hop count metric
Supports 15 hop-count limit
AD value is 120.
Supports classful networks.

11. CONFIGURATION

12. RIPv2
o It is a Extended version of RIP routing protocol.
o Maximum hop count is 15.
o Supports small network
o Supports classless network.
o Supports VLSM/CIDR.
o Supports Auto-Summarization.
o Route updates after 30 sec.
o It supports Key-authentication.

13. CONFIGURATION

14. RIPng
• RIPng is works basically the same way as RIP but has
some differences from RIP to support IPv6 address
format.
• RIPng sends an update to its connected routers
after every 30 seconds.
CHARACTERISTICS: -
Uses hop count metric
Supports classful networks.
Multicast address is FF02::9

15. CONFIGURATION

16. EIGRP
• It’s supports the features both distance vector &
link state protocol.
• It is a cisco proprietary protocol.
• By default, bandwidth & delay are the activated
metrics.
CHARACTERISTICS: -
Uses DUAL algorithm.
Supports classless network
Supports VLSM/CIDR.
It supports trigger updates.

17. CONFIGURATION

18. EIGRPv6
• It’s support IPv6.
• It is a cisco proprietary protocol.
• By default, bandwidth & delay are the activated
metrics.
CHARACTERISTICS: -
Uses DUAL algorithm.
Supports classless network
Supports VLSM/CIDR.
It supports trigger updates.

19. CONFIGURATION

20. OSPF
• The large network can be broken into the small areas so
the router in one area know less topology and they
don’t have information about other areas routers.
Creating OSPF areas result in smaller database which
reduce the memory consumption and processing.
• OSPF maintains a two layer hierarchy consisting of: -
Backbone area (area 0) -Off backbone area (areas1-
65,535)
• CHARACTERISTICS:
– AD value is 110.
– Supports classless network.
– Supports VLSM/CIDR & has unlimited hop counts
– Supports hierarchical network.
– Route propagation using multicasting.

21. CONFIGURATION

22. Routing Protocols Comparison
Name Class Type AD Metric IP
classes
Algorithm Scalability
RIP v1 Distance
Vector
IGP 120 Hop count Classful Bellman-Ford Small
RIP v2 Distance
Vector
IGP 120 Hop count Classless Bellman-Ford Small
OSPF Link State IGP 110 Cost Classless Dijkstra(SPF) Large
IGRP Distance
Vector
IGP 100 Composite
(BW + DLY)
Classful Dijkstra(SPF) Medium
EIGRP (Advance
Distance
Vector)
IGP 90 Composite
(BW + DLY)
Classless DUAL Large

23. P l e a s e g i v e y o u r s u g g e s t i o n s
a n d f e e d b a c k s
O r
A n y q u e s t i o n ?

24. THANK YOU