SlideShare a Scribd company logo
3
Most read
8
Most read
20
Most read
Routing protocols
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
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
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.
CONFIGURATION
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.
CONFIGURATION
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
DV and LS
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.
CONFIGURATION
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.
CONFIGURATION
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
CONFIGURATION
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.
CONFIGURATION
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.
CONFIGURATION
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.
CONFIGURATION
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
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 ?
THANK YOU

More Related Content

PPT
Routing
Saima Azam
 
PPTX
Routing protocols
rajshreemuthiah
 
PPTX
Ppt of routing protocols
Bhagyashri Dhoke
 
PPTX
Routing ppt
ArpiSaxena1
 
PPTX
Open shortest path first (ospf)
Respa Peter
 
PPTX
Ccna PPT
AIRTEL
 
PPTX
Distance Vector & Link state Routing Algorithm
MOHIT AGARWAL
 
PPTX
Routing Information Protocol
Kashif Latif
 
Routing
Saima Azam
 
Routing protocols
rajshreemuthiah
 
Ppt of routing protocols
Bhagyashri Dhoke
 
Routing ppt
ArpiSaxena1
 
Open shortest path first (ospf)
Respa Peter
 
Ccna PPT
AIRTEL
 
Distance Vector & Link state Routing Algorithm
MOHIT AGARWAL
 
Routing Information Protocol
Kashif Latif
 

What's hot (20)

PPTX
EIGRP (Enhanced Interior Gateway Routing Protocol)
NetProtocol Xpert
 
PPTX
Rip presentation
Ebrahim AlRahawe
 
PPTX
Multicast routing
Gunasekara Reddy
 
PDF
Spanning tree protocol (stp)
RaghulR21
 
PPT
Spanning tree protocol
Muuluu
 
PPTX
Classification of routing protocols
Menaga Selvaraj
 
PPTX
IPv4
Dhiraj Mishra
 
PPTX
Address resolution protocol (ARP)
NetProtocol Xpert
 
PPTX
Routing algorithms
Parameswaran Selvakumar
 
PPTX
Point to-point protocol (ppp)
Kongu Engineering College, Perundurai, Erode
 
PPTX
Unit 2 data link control
Vishal kakade
 
PPTX
Protocols and the TCP/IP Protocol Suite
Atharaw Deshmukh
 
PPTX
Media Access Control (MAC Layer)
Meenakshi Paul
 
PPTX
Routing Protocols
NetProtocol Xpert
 
PPTX
Transmission Control Protocol (TCP)
k33a
 
PPT
Network layer tanenbaum
Mahesh Kumar Chelimilla
 
PDF
Link state protocols.ppt
Edgardo Scrimaglia
 
PPTX
Dynamic routing protocols (CCNA)
Varinder Singh Walia
 
PPTX
Routing protocols for ad hoc wireless networks
Divya Tiwari
 
PDF
Transport layer services
Melvin Cabatuan
 
EIGRP (Enhanced Interior Gateway Routing Protocol)
NetProtocol Xpert
 
Rip presentation
Ebrahim AlRahawe
 
Multicast routing
Gunasekara Reddy
 
Spanning tree protocol (stp)
RaghulR21
 
Spanning tree protocol
Muuluu
 
Classification of routing protocols
Menaga Selvaraj
 
Address resolution protocol (ARP)
NetProtocol Xpert
 
Routing algorithms
Parameswaran Selvakumar
 
Point to-point protocol (ppp)
Kongu Engineering College, Perundurai, Erode
 
Unit 2 data link control
Vishal kakade
 
Protocols and the TCP/IP Protocol Suite
Atharaw Deshmukh
 
Media Access Control (MAC Layer)
Meenakshi Paul
 
Routing Protocols
NetProtocol Xpert
 
Transmission Control Protocol (TCP)
k33a
 
Network layer tanenbaum
Mahesh Kumar Chelimilla
 
Link state protocols.ppt
Edgardo Scrimaglia
 
Dynamic routing protocols (CCNA)
Varinder Singh Walia
 
Routing protocols for ad hoc wireless networks
Divya Tiwari
 
Transport layer services
Melvin Cabatuan
 
Ad

Similar to Routing protocols (20)

PPT
Chapter07
Muhammad Ahad
 
ODP
Dynamic routing
Raghu Kiran
 
PDF
ITT06211 CONFIGURING ROUTING PROTOCOLS.pdf
OntopScenes
 
PPT
Dynamic Routing All Algorithms, Working And Basics
Harsh Mehta
 
PPTX
Routing Protocols
KhushbirSinghSandhu
 
DOCX
Dynamic routing
saurabh goel
 
PPTX
CCNA PPT
AIRTEL
 
PPTX
ROUTING PROTOCOLS new.pptx
AayushMishra89
 
PPTX
CCNA ppt Day 5
VISHNU N
 
PPT
Chapter6ccna
Lakshan Perera
 
PPT
Chapter6ccna
Lakshan Perera
 
PPT
Chapter 7
Suchit Aher
 
PPTX
Routing
Suryaprakash Nehra
 
PPTX
EIGRP, DHCP, OSPF, NAT
Md. Rakibul Islam
 
PPTX
Router and routing
Iran-Gul Mukhlis
 
PPT
Networking Fundamentals
Gayathri Kesavan
 
PPTX
PLNOG 17 - Leonir Hoxha - Next Generation Network Architecture - Segment Routing
PROIDEA
 
PPT
Day 10 rip (2)
CYBERINTELLIGENTS
 
Chapter07
Muhammad Ahad
 
Dynamic routing
Raghu Kiran
 
ITT06211 CONFIGURING ROUTING PROTOCOLS.pdf
OntopScenes
 
Dynamic Routing All Algorithms, Working And Basics
Harsh Mehta
 
Routing Protocols
KhushbirSinghSandhu
 
Dynamic routing
saurabh goel
 
CCNA PPT
AIRTEL
 
ROUTING PROTOCOLS new.pptx
AayushMishra89
 
CCNA ppt Day 5
VISHNU N
 
Chapter6ccna
Lakshan Perera
 
Chapter6ccna
Lakshan Perera
 
Chapter 7
Suchit Aher
 
EIGRP, DHCP, OSPF, NAT
Md. Rakibul Islam
 
Router and routing
Iran-Gul Mukhlis
 
Networking Fundamentals
Gayathri Kesavan
 
PLNOG 17 - Leonir Hoxha - Next Generation Network Architecture - Segment Routing
PROIDEA
 
Day 10 rip (2)
CYBERINTELLIGENTS
 
Ad

Recently uploaded (20)

PPTX
FUNDAMENTALS OF ELECTRIC VEHICLES UNIT-1
MikkiliSuresh
 
PPT
Understanding the Key Components and Parts of a Drone System.ppt
Siva Reddy
 
PPTX
MSME 4.0 Template idea hackathon pdf to understand
alaudeenaarish
 
PDF
67243-Cooling and Heating & Calculation.pdf
DHAKA POLYTECHNIC
 
PDF
All chapters of Strength of materials.ppt
girmabiniyam1234
 
PDF
67243-Cooling and Heating & Calculation.pdf
DHAKA POLYTECHNIC
 
PPTX
Chapter_Seven_Construction_Reliability_Elective_III_Msc CM
SubashKumarBhattarai
 
PDF
67243-Cooling and Heating & Calculation.pdf
DHAKA POLYTECHNIC
 
PPTX
MULTI LEVEL DATA TRACKING USING COOJA.pptx
dollysharma12ab
 
PDF
Packaging Tips for Stainless Steel Tubes and Pipes
heavymetalsandtubes
 
PPTX
Civil Engineering Practices_BY Sh.JP Mishra 23.09.pptx
bineetmishra1990
 
PDF
Introduction to Ship Engine Room Systems.pdf
Mahmoud Moghtaderi
 
PDF
Construction of a Thermal Vacuum Chamber for Environment Test of Triple CubeS...
2208441
 
PDF
Unit I Part II.pdf : Security Fundamentals
Dr. Madhuri Jawale
 
PPTX
IoT_Smart_Agriculture_Presentations.pptx
poojakumari696707
 
PDF
2010_Book_EnvironmentalBioengineering (1).pdf
EmilianoRodriguezTll
 
PDF
AI-Driven IoT-Enabled UAV Inspection Framework for Predictive Maintenance and...
ijcncjournal019
 
PDF
20ME702-Mechatronics-UNIT-1,UNIT-2,UNIT-3,UNIT-4,UNIT-5, 2025-2026
Mohanumar S
 
PPTX
quantum computing transition from classical mechanics.pptx
gvlbcy
 
PPTX
Inventory management chapter in automation and robotics.
atisht0104
 
FUNDAMENTALS OF ELECTRIC VEHICLES UNIT-1
MikkiliSuresh
 
Understanding the Key Components and Parts of a Drone System.ppt
Siva Reddy
 
MSME 4.0 Template idea hackathon pdf to understand
alaudeenaarish
 
67243-Cooling and Heating & Calculation.pdf
DHAKA POLYTECHNIC
 
All chapters of Strength of materials.ppt
girmabiniyam1234
 
67243-Cooling and Heating & Calculation.pdf
DHAKA POLYTECHNIC
 
Chapter_Seven_Construction_Reliability_Elective_III_Msc CM
SubashKumarBhattarai
 
67243-Cooling and Heating & Calculation.pdf
DHAKA POLYTECHNIC
 
MULTI LEVEL DATA TRACKING USING COOJA.pptx
dollysharma12ab
 
Packaging Tips for Stainless Steel Tubes and Pipes
heavymetalsandtubes
 
Civil Engineering Practices_BY Sh.JP Mishra 23.09.pptx
bineetmishra1990
 
Introduction to Ship Engine Room Systems.pdf
Mahmoud Moghtaderi
 
Construction of a Thermal Vacuum Chamber for Environment Test of Triple CubeS...
2208441
 
Unit I Part II.pdf : Security Fundamentals
Dr. Madhuri Jawale
 
IoT_Smart_Agriculture_Presentations.pptx
poojakumari696707
 
2010_Book_EnvironmentalBioengineering (1).pdf
EmilianoRodriguezTll
 
AI-Driven IoT-Enabled UAV Inspection Framework for Predictive Maintenance and...
ijcncjournal019
 
20ME702-Mechatronics-UNIT-1,UNIT-2,UNIT-3,UNIT-4,UNIT-5, 2025-2026
Mohanumar S
 
quantum computing transition from classical mechanics.pptx
gvlbcy
 
Inventory management chapter in automation and robotics.
atisht0104
 

Routing protocols

  • 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.
  • 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.
  • 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
  • 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.
  • 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.
  • 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
  • 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.
  • 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.
  • 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.
  • 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 ?