SlideShare a Scribd company logo
Lecture 04 -Routing and Routing Protocols
Direct Delivery
 Send a message to a machine in the LAN
Indirect Delivery
Indirect Delivery
 To send a packet from source to destination
 packet should go from router to router
 All routers should maintain a routing table
 IP packet is analyzed at the router and correct path is
selected form the routing table
 The packet is sent though that path
 Indirect delivery is done using the routing strategies
Routing Strategies
 There are four routing strategies
- Fixed Routing
- Flooding
- Random Routing
- Adaptive Routing
Fixed Routing
 Routing information is centrally maintained
 This is called a Directory (A central database)
 Advantage
- Updating new information is easy as need to change at one
location (central Database)
 Disadvantages
- Each and every IP packet should be analyzed
- Network traffic may increase at the central database because it
has to serve lots of requests from routers
- Dynamic changes are not possible
Flooding
 When an IP packet comes, the router will send it on all paths.
- retransmitted to neighbors
 Advantages
- Simple mechanism (IP packets are not analyzed at router)
- Most likely it will reach the destination (Highly reliable)
 Disadvantages
- Causes high network traffic
- Duplicate packets might reach the destination
- Wastes Network bandwidth
Random Routing
 When an IP packet comes to the router, it decides the
path randomly and sends the IP packet in that path
 Advantages
- Will not cause unnecessary network traffic
- Simple
 Disadvantage
- No guarantee that the IP packet will reach to the
destination
Adaptive Routing
 Each router maintains a routing table
 Also it can be changed according to the network changes
(Adaptive)
 Advantages
- Network traffic is minimized
- The best route will be selected most of the time
 Disadvantages
- Routers need to keep a routing table
- Process each IP packet
- Need to update routing tables automatically with the changes
in the network
Routing Methods used in Adaptive
Routing
 Next hop routing
 Host specific
 Network specific
 Default routing
Host Specific Routing
 Each router keeps a table entry for each host (one record for
one host)
 Table entry has Host IP and the Interface
Host Address Interface
A E0
B S0
C S1
Disadvantages
• Large number of records (if multiple paths are available number
of records increases)
•Table updating is difficult and complex as it should be done for
each and every host (if the host IP changes)
Network Specific Routing
 Each router keeps a table entry for each network (one record
for one network)
 Table entry has Network address and Interface
Advantages
• Number of records are limited (Table updates are not for each
host but for a network)
•Update is easy
Network Address Interface
A E0
B S0
C S1
Default Routing
 Another record in the routing table
 Indicates the route/path to be taken, if any of the records does not
match with the IP packet destination IP address
 Stub networks only use default routing , which means that they
have only one exit port out of the network
Routing Table update Methods
 Basically there are three methods to update routing
tables
- Connected
- Static
- Dynamic
Connected
 Once the router is connected to the network its interfaces
are given IP addresses
 With that router automatically identifies the network
addresses to which it connected
Static
 Administrator can manually give routing table
records
Dynamic
 Routing tables are updated automatically by using
routing rules ( protocols )
 Routing tables have
 Initially only ‘connected’ records
 Then add few ‘static’ records
 Then add dynamic updates
Routing Protocols
Features of routing protocols
 Network changes (addition or removal or fault) are
automatically updated in routing tables of all routers
 When there are many routes to a destination, the
best route should be selected
 Share the traffic through different routes
What Is a Routing Protocol?
 Routing Protocols
allow routers to
dynamically
advertise and
learn routes,
determine which
routes are
available and
which are the
most efficient
routes to a
destination
20
Network
Protocol
Destination
Network
Connected
RIP
IGRP
10.120.2.0
172.16.2.0
172.17.3.0
Exit
Interface
E0
S0
S1
Routing Protocol: RIP, IGRP,OSPF
172.17.3.0
172.16.1.010.120.2.0
E0
S0
Routing Protocols
Routing Protocols cont.
 An autonomous system (AS) is a collection of routers
under a common administration
ex : a company's internal network
 Interior Gateway Protocols (IGP) are used for
intra-autonomous system routing
(routing inside an autonomous system)
 Exterior Gateway Protocols (EGP) are used for
inter-autonomous system routing
(routing between autonomous systems)
Routing Protocols cont.
Distance Vector Routing Protocols
 Routes are advertised as vectors of distance and direction
 Distance is defined in terms of a metric such as hop count and
direction is simply the next-hop router or exit interface
 Send periodic updates of their routing information
 Use the Bellman-Ford algorithm for best path selection
 Work best in situations where:
- Network is simple
- Administrators do not have enough knowledge to configure
Ex : RIP, IGRP, EIGRP
Link State Routing Protocols
 link-state routing protocol send information about the state of
its links to other routers in the routing domain
 The state of those links includes information about the type of
network and any neighboring routers on those networks
 A link-state update only sent when there is a change in the
topology
 Use the Dijkstra algorithm for best path/ route selection
 Work best in situations where:
- Network design is complex (large networks)
- Administrators have a good knowledge of network
Ex : OSPF, IS-IS
Routing Algorithms
Bellman-Ford Algorithm
 Used by distance vector routing protocols
Dijkstras Algorithm
 Used by link state routing protocols

More Related Content

What's hot (20)

PPTX
Routing
Suryaprakash Nehra
 
PPT
11 routing
shefali84
 
PPTX
M4 san features-4.3.1
MrudulaJoshi10
 
PPTX
Group 1
lifetobeart
 
PPTX
Routing algorithms
MoctardOLOULADE
 
PPTX
Hdlc
Raveena kumari
 
PPT
Network devices
Gopal Krishna
 
PPT
Routing table and routing algorithms
lavanyapathy
 
PPTX
computer Netwoks - network layer
Sendhil Kumar
 
PPT
1 networking devices 2014
Zuhaib Zaroon
 
PDF
Distance vector and link state routing protocol
CCNAStudyGuide
 
PPT
Day 10 rip (2)
CYBERINTELLIGENTS
 
PPTX
BASICS OF ROUTING IN NETWORKS
KABILESH RAMAR
 
PPTX
Routing Techniques
Nishant Munjal
 
PPTX
Computer networks unit ii
JAIGANESH SEKAR
 
PPTX
Routing Protocols
NetProtocol Xpert
 
PDF
Networking devices
rupinderj
 
PPTX
Computer Network
Rubaya Mim
 
PPT
routing
Srinivasa Rao
 
PPTX
Presentation Routing algorithm
Basit Hussain
 
11 routing
shefali84
 
M4 san features-4.3.1
MrudulaJoshi10
 
Group 1
lifetobeart
 
Routing algorithms
MoctardOLOULADE
 
Network devices
Gopal Krishna
 
Routing table and routing algorithms
lavanyapathy
 
computer Netwoks - network layer
Sendhil Kumar
 
1 networking devices 2014
Zuhaib Zaroon
 
Distance vector and link state routing protocol
CCNAStudyGuide
 
Day 10 rip (2)
CYBERINTELLIGENTS
 
BASICS OF ROUTING IN NETWORKS
KABILESH RAMAR
 
Routing Techniques
Nishant Munjal
 
Computer networks unit ii
JAIGANESH SEKAR
 
Routing Protocols
NetProtocol Xpert
 
Networking devices
rupinderj
 
Computer Network
Rubaya Mim
 
routing
Srinivasa Rao
 
Presentation Routing algorithm
Basit Hussain
 

Viewers also liked (20)

PPTX
Lecture 03 networking
HNDE Labuduwa Galle
 
PPTX
Lecture 02 networking
HNDE Labuduwa Galle
 
PPTX
Data Hazard and Solution for Data Hazard
COMSATS Institute of Information Technology
 
PDF
Routing basics/CEF
Dmitry Figol
 
PPTX
CCNA 2 Routing and Switching v5.0 Chapter 8
Nil Menon
 
PDF
Pipeline and data hazard
Waed Shagareen
 
PPT
Pipeline hazard
AJAL A J
 
PPT
pipelining
Siddique Ibrahim
 
PPTX
C++ lecture 04
HNDE Labuduwa Galle
 
PPTX
Lecture 01 networking
HNDE Labuduwa Galle
 
PPTX
C++ lecture 03
HNDE Labuduwa Galle
 
PPTX
Lecture 07 networking
HNDE Labuduwa Galle
 
PPTX
C++ lecture 02
HNDE Labuduwa Galle
 
PPTX
C++ lecture 01
HNDE Labuduwa Galle
 
PDF
What Makes Great Infographics
SlideShare
 
PDF
You Suck At PowerPoint!
Jesse Desjardins - @jessedee
 
PDF
STOP! VIEW THIS! 10-Step Checklist When Uploading to Slideshare
Empowered Presentations
 
PDF
How To Get More From SlideShare - Super-Simple Tips For Content Marketing
Content Marketing Institute
 
PDF
Masters of SlideShare
Kapost
 
PDF
10 Ways to Win at SlideShare SEO & Presentation Optimization
Oneupweb
 
Lecture 03 networking
HNDE Labuduwa Galle
 
Lecture 02 networking
HNDE Labuduwa Galle
 
Data Hazard and Solution for Data Hazard
COMSATS Institute of Information Technology
 
Routing basics/CEF
Dmitry Figol
 
CCNA 2 Routing and Switching v5.0 Chapter 8
Nil Menon
 
Pipeline and data hazard
Waed Shagareen
 
Pipeline hazard
AJAL A J
 
pipelining
Siddique Ibrahim
 
C++ lecture 04
HNDE Labuduwa Galle
 
Lecture 01 networking
HNDE Labuduwa Galle
 
C++ lecture 03
HNDE Labuduwa Galle
 
Lecture 07 networking
HNDE Labuduwa Galle
 
C++ lecture 02
HNDE Labuduwa Galle
 
C++ lecture 01
HNDE Labuduwa Galle
 
What Makes Great Infographics
SlideShare
 
You Suck At PowerPoint!
Jesse Desjardins - @jessedee
 
STOP! VIEW THIS! 10-Step Checklist When Uploading to Slideshare
Empowered Presentations
 
How To Get More From SlideShare - Super-Simple Tips For Content Marketing
Content Marketing Institute
 
Masters of SlideShare
Kapost
 
10 Ways to Win at SlideShare SEO & Presentation Optimization
Oneupweb
 
Ad

Similar to Lecture 04 networking (20)

PDF
Lecture number 5 Theory.pdf(machine learning)
ZainabShahzad9
 
PPTX
computer communications
JAYASHSINGHRA2111003
 
PDF
ITT06211 CONFIGURING ROUTING PROTOCOLS.pdf
OntopScenes
 
PDF
Routing
Sisir Ghosh
 
PPTX
1737674082397_LEnnnnnnCTURE 0nn2 (a).pptx
nyalawemgunga
 
PPTX
7-ROUTING IN COMPUTER NETWORKS .pptx
shawwalrashed
 
PDF
1Routing Basics.pdf
gebreyesusweldegebri2
 
PPT
Routing
RJ Fahim
 
PPT
module10-rip (1).ppt
Rakesh Dhiman
 
PPTX
Network Layer
reshmadayma
 
PDF
introduction to network and computer security
abrhamworkie8
 
PPTX
Ns lecture1: Introduction to Routing Protocol
Aksum Institute of Technology(AIT, @Letsgo)
 
PPTX
Network layer new
reshmadayma
 
PPTX
Routing Protocols
Dr.Ashvini Chaudhari Bhongade
 
PPTX
Chapter Four - Network Layer.pptx
GirT2
 
PPTX
Routing Protocols
KhushbirSinghSandhu
 
PPTX
Routing protocols.pptx
MNSUAM
 
PPT
Routing.pptbbbbbbbbbbbbbbbbbbbbbnbbnbbbbnbb
nijjilnarula1
 
PPTX
Network Layer
reshmadayma
 
Lecture number 5 Theory.pdf(machine learning)
ZainabShahzad9
 
computer communications
JAYASHSINGHRA2111003
 
ITT06211 CONFIGURING ROUTING PROTOCOLS.pdf
OntopScenes
 
Routing
Sisir Ghosh
 
1737674082397_LEnnnnnnCTURE 0nn2 (a).pptx
nyalawemgunga
 
7-ROUTING IN COMPUTER NETWORKS .pptx
shawwalrashed
 
1Routing Basics.pdf
gebreyesusweldegebri2
 
Routing
RJ Fahim
 
module10-rip (1).ppt
Rakesh Dhiman
 
Network Layer
reshmadayma
 
introduction to network and computer security
abrhamworkie8
 
Ns lecture1: Introduction to Routing Protocol
Aksum Institute of Technology(AIT, @Letsgo)
 
Network layer new
reshmadayma
 
Chapter Four - Network Layer.pptx
GirT2
 
Routing Protocols
KhushbirSinghSandhu
 
Routing protocols.pptx
MNSUAM
 
Routing.pptbbbbbbbbbbbbbbbbbbbbbnbbnbbbbnbb
nijjilnarula1
 
Network Layer
reshmadayma
 
Ad

Recently uploaded (20)

PPTX
GitOps_Without_K8s_Training_detailed git repository
DanialHabibi2
 
PPTX
MobileComputingMANET2023 MobileComputingMANET2023.pptx
masterfake98765
 
PPTX
Element 7. CHEMICAL AND BIOLOGICAL AGENT.pptx
merrandomohandas
 
PPTX
Lecture 1 Shell and Tube Heat exchanger-1.pptx
mailforillegalwork
 
PDF
Biomechanics of Gait: Engineering Solutions for Rehabilitation (www.kiu.ac.ug)
publication11
 
PPTX
Arduino Based Gas Leakage Detector Project
CircuitDigest
 
PPTX
Day2 B2 Best.pptx
helenjenefa1
 
PDF
Ethics and Trustworthy AI in Healthcare – Governing Sensitive Data, Profiling...
AlqualsaDIResearchGr
 
PDF
PORTFOLIO Golam Kibria Khan — architect with a passion for thoughtful design...
MasumKhan59
 
PPTX
Element 11. ELECTRICITY safety and hazards
merrandomohandas
 
PPTX
原版一样(Acadia毕业证书)加拿大阿卡迪亚大学毕业证办理方法
Taqyea
 
PDF
Pressure Measurement training for engineers and Technicians
AIESOLUTIONS
 
PPTX
Hashing Introduction , hash functions and techniques
sailajam21
 
PPTX
Snet+Pro+Service+Software_SNET+Pro+2+Instructions.pptx
jenilsatikuvar1
 
PDF
MAD Unit - 2 Activity and Fragment Management in Android (Diploma IT)
JappanMavani
 
PPTX
UNIT DAA PPT cover all topics 2021 regulation
archu26
 
PDF
Set Relation Function Practice session 24.05.2025.pdf
DrStephenStrange4
 
DOC
MRRS Strength and Durability of Concrete
CivilMythili
 
DOCX
CS-802 (A) BDH Lab manual IPS Academy Indore
thegodhimself05
 
PPTX
MPMC_Module-2 xxxxxxxxxxxxxxxxxxxxx.pptx
ShivanshVaidya5
 
GitOps_Without_K8s_Training_detailed git repository
DanialHabibi2
 
MobileComputingMANET2023 MobileComputingMANET2023.pptx
masterfake98765
 
Element 7. CHEMICAL AND BIOLOGICAL AGENT.pptx
merrandomohandas
 
Lecture 1 Shell and Tube Heat exchanger-1.pptx
mailforillegalwork
 
Biomechanics of Gait: Engineering Solutions for Rehabilitation (www.kiu.ac.ug)
publication11
 
Arduino Based Gas Leakage Detector Project
CircuitDigest
 
Day2 B2 Best.pptx
helenjenefa1
 
Ethics and Trustworthy AI in Healthcare – Governing Sensitive Data, Profiling...
AlqualsaDIResearchGr
 
PORTFOLIO Golam Kibria Khan — architect with a passion for thoughtful design...
MasumKhan59
 
Element 11. ELECTRICITY safety and hazards
merrandomohandas
 
原版一样(Acadia毕业证书)加拿大阿卡迪亚大学毕业证办理方法
Taqyea
 
Pressure Measurement training for engineers and Technicians
AIESOLUTIONS
 
Hashing Introduction , hash functions and techniques
sailajam21
 
Snet+Pro+Service+Software_SNET+Pro+2+Instructions.pptx
jenilsatikuvar1
 
MAD Unit - 2 Activity and Fragment Management in Android (Diploma IT)
JappanMavani
 
UNIT DAA PPT cover all topics 2021 regulation
archu26
 
Set Relation Function Practice session 24.05.2025.pdf
DrStephenStrange4
 
MRRS Strength and Durability of Concrete
CivilMythili
 
CS-802 (A) BDH Lab manual IPS Academy Indore
thegodhimself05
 
MPMC_Module-2 xxxxxxxxxxxxxxxxxxxxx.pptx
ShivanshVaidya5
 

Lecture 04 networking

  • 1. Lecture 04 -Routing and Routing Protocols
  • 2. Direct Delivery  Send a message to a machine in the LAN
  • 4. Indirect Delivery  To send a packet from source to destination  packet should go from router to router  All routers should maintain a routing table  IP packet is analyzed at the router and correct path is selected form the routing table  The packet is sent though that path  Indirect delivery is done using the routing strategies
  • 5. Routing Strategies  There are four routing strategies - Fixed Routing - Flooding - Random Routing - Adaptive Routing
  • 6. Fixed Routing  Routing information is centrally maintained  This is called a Directory (A central database)  Advantage - Updating new information is easy as need to change at one location (central Database)  Disadvantages - Each and every IP packet should be analyzed - Network traffic may increase at the central database because it has to serve lots of requests from routers - Dynamic changes are not possible
  • 7. Flooding  When an IP packet comes, the router will send it on all paths. - retransmitted to neighbors  Advantages - Simple mechanism (IP packets are not analyzed at router) - Most likely it will reach the destination (Highly reliable)  Disadvantages - Causes high network traffic - Duplicate packets might reach the destination - Wastes Network bandwidth
  • 8. Random Routing  When an IP packet comes to the router, it decides the path randomly and sends the IP packet in that path  Advantages - Will not cause unnecessary network traffic - Simple  Disadvantage - No guarantee that the IP packet will reach to the destination
  • 9. Adaptive Routing  Each router maintains a routing table  Also it can be changed according to the network changes (Adaptive)  Advantages - Network traffic is minimized - The best route will be selected most of the time  Disadvantages - Routers need to keep a routing table - Process each IP packet - Need to update routing tables automatically with the changes in the network
  • 10. Routing Methods used in Adaptive Routing  Next hop routing  Host specific  Network specific  Default routing
  • 11. Host Specific Routing  Each router keeps a table entry for each host (one record for one host)  Table entry has Host IP and the Interface Host Address Interface A E0 B S0 C S1 Disadvantages • Large number of records (if multiple paths are available number of records increases) •Table updating is difficult and complex as it should be done for each and every host (if the host IP changes)
  • 12. Network Specific Routing  Each router keeps a table entry for each network (one record for one network)  Table entry has Network address and Interface Advantages • Number of records are limited (Table updates are not for each host but for a network) •Update is easy Network Address Interface A E0 B S0 C S1
  • 13. Default Routing  Another record in the routing table  Indicates the route/path to be taken, if any of the records does not match with the IP packet destination IP address  Stub networks only use default routing , which means that they have only one exit port out of the network
  • 14. Routing Table update Methods  Basically there are three methods to update routing tables - Connected - Static - Dynamic
  • 15. Connected  Once the router is connected to the network its interfaces are given IP addresses  With that router automatically identifies the network addresses to which it connected
  • 16. Static  Administrator can manually give routing table records
  • 17. Dynamic  Routing tables are updated automatically by using routing rules ( protocols )  Routing tables have  Initially only ‘connected’ records  Then add few ‘static’ records  Then add dynamic updates
  • 19. Features of routing protocols  Network changes (addition or removal or fault) are automatically updated in routing tables of all routers  When there are many routes to a destination, the best route should be selected  Share the traffic through different routes
  • 20. What Is a Routing Protocol?  Routing Protocols allow routers to dynamically advertise and learn routes, determine which routes are available and which are the most efficient routes to a destination 20 Network Protocol Destination Network Connected RIP IGRP 10.120.2.0 172.16.2.0 172.17.3.0 Exit Interface E0 S0 S1 Routing Protocol: RIP, IGRP,OSPF 172.17.3.0 172.16.1.010.120.2.0 E0 S0
  • 22. Routing Protocols cont.  An autonomous system (AS) is a collection of routers under a common administration ex : a company's internal network  Interior Gateway Protocols (IGP) are used for intra-autonomous system routing (routing inside an autonomous system)  Exterior Gateway Protocols (EGP) are used for inter-autonomous system routing (routing between autonomous systems)
  • 24. Distance Vector Routing Protocols  Routes are advertised as vectors of distance and direction  Distance is defined in terms of a metric such as hop count and direction is simply the next-hop router or exit interface  Send periodic updates of their routing information  Use the Bellman-Ford algorithm for best path selection  Work best in situations where: - Network is simple - Administrators do not have enough knowledge to configure Ex : RIP, IGRP, EIGRP
  • 25. Link State Routing Protocols  link-state routing protocol send information about the state of its links to other routers in the routing domain  The state of those links includes information about the type of network and any neighboring routers on those networks  A link-state update only sent when there is a change in the topology  Use the Dijkstra algorithm for best path/ route selection  Work best in situations where: - Network design is complex (large networks) - Administrators have a good knowledge of network Ex : OSPF, IS-IS
  • 26. Routing Algorithms Bellman-Ford Algorithm  Used by distance vector routing protocols Dijkstras Algorithm  Used by link state routing protocols