SlideShare una empresa de Scribd logo
1 de 41
Delivery, Forwarding and Routing
Networking Fundamentals
22.2
DELIVERYDELIVERY
• DeliveryDelivery of a packet is defined as the handling ofof a packet is defined as the handling of
the packets by the underlying Physical networksthe packets by the underlying Physical networks
based on the supervision of the Networkbased on the supervision of the Network (& Data(& Data
Link)Link) layer.layer.
• Delivery of a packet to its final destination isDelivery of a packet to its final destination is
accomplished by using two different methods,accomplished by using two different methods,
direct and indirect.direct and indirect.
22.3
Direct and indirect delivery
22.4
FORWARDING & ROUTINGFORWARDING & ROUTING
• ForwardingForwarding means to place the packet in its route to itsmeans to place the packet in its route to its
destination. Forwarding requires a host or a router todestination. Forwarding requires a host or a router to
have a routing table. When a host has a packet to sendhave a routing table. When a host has a packet to send
or when a router has received a packet to be forwarded,or when a router has received a packet to be forwarded,
it looks at this table to find the route to the finalit looks at this table to find the route to the final
destination.destination.
• RoutingRouting refers to the way routing tables are created torefers to the way routing tables are created to
help in forwarding.help in forwarding.
• We now see three forwarding techniques, these makeWe now see three forwarding techniques, these make
thethe size of the routing table manageablesize of the routing table manageable..
22.5
1. Route method versus next-hop method (lesser content)
22.6
2. Host-specific versus network-specific method (again lesser content)
22.7
3. Default method (The default route is normally defined as address 0.0.0.0)
22.8
Classless Inter-Domain Routing (CIDR) is a system
of IP addressing and routing that solves the many
problems of “classful” addressing by eliminating
fixed address classes in favor of a flexible,
multiple-level, hierarchical structure of networks
of varying size.
Note
22.9
22.10
Simplified forwarding module in classless address
22.11
In classless addressing, we need at
least four columns in a routing table.
Usually there are more.
Note
22.12
Make a routing table for router R1, using the
configuration in Figure.
Example 1
Solution
Table after the figure shows the corresponding table.
22.13
Configuration for Example 1
m3
22.14
Routing table for router R1 in Figure
Actually, for Default route, Mask should be /0 and Network Address
should be 0.0.0.0
22.15
Show the forwarding process if a packet arrives at R1 in
Figure with the destination address 180.70.65.140.
Example 2
Solution
The router performs the following steps:
1. The first mask (/26) is applied to the destination address.
The result is 180.70.65.128, which does not match the
corresponding network address.
2. The second mask (/25) is applied to the destination
address. The result is 180.70.65.128, which matches the
corresponding network address. The desination address
and the interface number m0 are passed to ARP for
further processing.
22.16
Show the forwarding process if a packet arrives at R1 in
Figure with the destination address 201.4.22.35.
Example 3
Solution
The router performs the following steps:
1. The first mask (/26) is applied to the destination
address. The result is 201.4.22.0, which does not
match the corresponding network address.
2. The second mask (/25) is applied to the destination address. The
result is 201.4.22.0, which does not match the corresponding
network address (row 2).
3. The third mask (/24) is applied to the destination
address. The result is 201.4.22.0, which matches the
corresponding network address. The destination
address of the packet and the interface number m3 are
passed to ARP.
22.17
Show the forwarding process if a packet arrives at R1 in
Figure with the destination address 18.24.32.78.
Example 4
Solution
This time all masks are applied, one by one, to the
destination address, but no matching network address is
found. When it reaches the end of the table, the module
gives the next-hop address 180.70.65.200 and interface
number m2 to ARP. This is probably an outgoing
package that needs to be sent, via the default router, to
someplace else in the Internet.
22.18
22.19
Address aggregation
22.20
22.21
Longest mask matching
22.22
Earlier
22.23
As an example of hierarchical routing, let us consider the
Figure. A regional ISP is granted 16,384 addresses
starting from 120.14.64.0. The regional ISP has decided
to divide this block into four subblocks, each with 4096
addresses. Three of these subblocks are assigned to three
local ISPs; the second subblock is reserved for future use.
Note that the mask for each block is /20 because the
original block with mask /18 is divided into 4 blocks.
Example 5
The first local ISP has divided its assigned subblock into
8 smaller blocks and assigned each to a small ISP. Each
small ISP provides services to 128 households, each using
four addresses.
22.24
The second local ISP has divided its block into 4 blocks and has
assigned the addresses to four large organizations.
Example 5 (continued)
There is a sense of hierarchy in this configuration. All routers in
the Internet send a packet with destination address 120.14.64.0 to
120.14.127.255 to the regional ISP.
The regional ISP sends every packet between 120.14.64.0 to
120.14.79.255 to local ISP1.
Local ISP1 sends every packet between 120.14.64.0 to
120.14.65.255 to Small ISP1.
Small ISP1 sends every packet between 120.14.64.0 to 120.14.64.3
to H001.
The third local ISP has divided its block into 16 blocks and
assigned each block to a small organization. Each small
organization has 256 addresses, and the mask is /24.
22.25
Hierarchical routing with ISPs
120.14.127.255
120.14.79.255
120.14.95.255
120.14.111.255
120.14.127.255
8
120.14.65.255
120.14.79.255
120.14.64.3
120.14.99.255
120.14.112.255
22.26
22.27
Common fields in a routing table
22.28
22.29
One utility that can be used to find the contents of a
routing table for a host or router is netstat in UNIX or
LINUX. The next slide shows the list of the contents of a
default server. We have used two options, r and n. The
option r indicates that we are interested in the routing
table, and the option n indicates that we are looking for
numeric addresses. Note that this is a routing table for a
host, not a router. Although we discussed the routing table
for a router throughout, a host also needs a routing table.
Example 6
22.30
Example 6 (continued)
The destination column here defines the network address.
The term gateway used by UNIX is synonymous with
router. This column actually defines the address of the next
hop. The value 0.0.0.0 shows that the delivery is direct. The
last entry has a flag of G, which means that the destination
can be reached through a router (default router). The Iface
defines the interface.
22.31
Example 6 (continued)
More information about the IP address and physical
address of the server can be found by using the ifconfig
command on the given interface (eth0).
22.32
Configuration of the server for Example 6
22.33
Destination : The destination can be an IP network address.
Netmask : Specifies the netmask (also known as a subnet mask)
Gateway : Specifies the forwarding or next hop IP address over which the set of addresses defined by the 
network destination and subnet mask are reachable. 
22.34
22.35
UNICAST ROUTING PROTOCOLSUNICAST ROUTING PROTOCOLS
• A routing table can be eitherA routing table can be either staticstatic oror dynamicdynamic. A. A
static table is one with manual entries. A dynamicstatic table is one with manual entries. A dynamic
table is one that is updated automatically whentable is one that is updated automatically when
there is a change somewhere in the Internet.there is a change somewhere in the Internet.
• A routing protocol is a combination of rules andA routing protocol is a combination of rules and
procedures that lets routers in the Internet informprocedures that lets routers in the Internet inform
each other of changes.each other of changes.
• A dynamic routing table is updated periodically byA dynamic routing table is updated periodically by
using one of these protocols.using one of these protocols.
22.36
col
22.37
Autonomous systems
22.38
Popular routing protocols
22.39
Distance-Vector Protocols
• The distance-vector routing approach determines the direction
(vector) and distance (hop count) to any link in the internetwork.
Distance-vector algorithms periodically (such as every 30 seconds)
send all or some portion of their routing table to their adjacent
neighbors.
• Routers running a distance-vector routing protocol send periodic
updates even if there are no changes in the network. By receiving a
neighbor’s routing table, a router can verify all the known routes and
make changes to the local routing table based on updated information
received from the neighboring router.
• Distance-vector protocols use the Bellman-Ford Algorithm to
calculate the best paths. Examples of distance-vector protocols
include the following:
■ Routing Information Protocol (RIP)—The most common IGP in the
Internet, RIP uses hop count as its routing metric.
■ Interior Gateway Routing Protocol (IGRP)— Addresses the issues
associated with routing in large, heterogeneous networks.
22.40
Link-State Protocols
• Link-state routing protocols were designed to overcome the
limitations of distance vector routing protocols. Link-state routing
protocols respond quickly to network changes, send trigger updates
only when a network change has occurred, and send periodic updates
(called link-state refreshes) at long time intervals, such as every 30
minutes.
• When a link changes state, the device that detected the change
creates a link-state advertisement (LSA) concerning that link (route),
and that LSA is propagated to all neighboring devices. Each routing
device takes a copy of the LSA, updates its link-state (topological)
database, and forwards the LSA to all neighboring devices. This
flooding of the LSA is required to ensure that all routing devices
update their databases before creating an updated routing table that
reflects the new topology.
• The link-state database is used to calculate the best paths
through the network by applying the Dijkstra Shortest Path First (SPF)
algorithm
• Examples of link-state protocols are OSPF and IS-IS.
22.41
BGP
• Border Gateway Protocol (BGP) is an example of an
EGP. BGP exchanges routing information between
autonomous systems while guaranteeing loop-free path
selection.
• It is the principal route advertising protocol used by
major companies and ISPs on the Internet. BGP-4 is the
first version of BGP that supports classless interdomain
routing (CIDR) and route aggregation.
• Unlike common IGPs such as RIP, OSPF, and
EIGRP, BGP does not use metrics such as hop count or
bandwidth or delay.
• Instead, BGP makes routing decisions based on
network policies or rules using various BGP path
attributes.

Más contenido relacionado

La actualidad más candente

Ccna 3-discovery-4-0-module-6-100-
Ccna 3-discovery-4-0-module-6-100-Ccna 3-discovery-4-0-module-6-100-
Ccna 3-discovery-4-0-module-6-100-junkut3
 
Ccna day5-140715152501-phpapp01
Ccna day5-140715152501-phpapp01Ccna day5-140715152501-phpapp01
Ccna day5-140715152501-phpapp01Sachin Morya
 
Ccna day3-140715152337-phpapp01
Ccna day3-140715152337-phpapp01Ccna day3-140715152337-phpapp01
Ccna day3-140715152337-phpapp01Sachin Morya
 
Lecture 3 network layer
Lecture 3 network layerLecture 3 network layer
Lecture 3 network layerRonoh Kennedy
 
23 Process to_Process_Delivery_UDP_TCP_and_SCTP
23 Process to_Process_Delivery_UDP_TCP_and_SCTP23 Process to_Process_Delivery_UDP_TCP_and_SCTP
23 Process to_Process_Delivery_UDP_TCP_and_SCTPAhmar Hashmi
 
20CS2007 Computer Communication Networks
20CS2007 Computer Communication Networks 20CS2007 Computer Communication Networks
20CS2007 Computer Communication Networks Kathirvel Ayyaswamy
 
Et3003 sem2-1314-9 network layers vi (routing protocols)
Et3003 sem2-1314-9 network layers vi (routing protocols)Et3003 sem2-1314-9 network layers vi (routing protocols)
Et3003 sem2-1314-9 network layers vi (routing protocols)Tutun Juhana
 
Packet transfer mechanism using routers and IP addresses
Packet transfer mechanism using routers and IP addresses Packet transfer mechanism using routers and IP addresses
Packet transfer mechanism using routers and IP addresses myrajendra
 
Network layer
Network layerNetwork layer
Network layersbkbca
 
Et3003 sem2-1314-4 network layers i (ipv4 addressing)
Et3003 sem2-1314-4 network layers i (ipv4 addressing)Et3003 sem2-1314-4 network layers i (ipv4 addressing)
Et3003 sem2-1314-4 network layers i (ipv4 addressing)Tutun Juhana
 
CCNA ppt Day 2
CCNA ppt Day 2CCNA ppt Day 2
CCNA ppt Day 2VISHNU N
 

La actualidad más candente (20)

Ccna 3-discovery-4-0-module-6-100-
Ccna 3-discovery-4-0-module-6-100-Ccna 3-discovery-4-0-module-6-100-
Ccna 3-discovery-4-0-module-6-100-
 
Ccna day5
Ccna day5Ccna day5
Ccna day5
 
Ccna day5-140715152501-phpapp01
Ccna day5-140715152501-phpapp01Ccna day5-140715152501-phpapp01
Ccna day5-140715152501-phpapp01
 
Ccna day3-140715152337-phpapp01
Ccna day3-140715152337-phpapp01Ccna day3-140715152337-phpapp01
Ccna day3-140715152337-phpapp01
 
Media Access Layer
Media Access LayerMedia Access Layer
Media Access Layer
 
Lecture 3 network layer
Lecture 3 network layerLecture 3 network layer
Lecture 3 network layer
 
Ccna day3
Ccna day3Ccna day3
Ccna day3
 
Routing
RoutingRouting
Routing
 
23 Process to_Process_Delivery_UDP_TCP_and_SCTP
23 Process to_Process_Delivery_UDP_TCP_and_SCTP23 Process to_Process_Delivery_UDP_TCP_and_SCTP
23 Process to_Process_Delivery_UDP_TCP_and_SCTP
 
Network Layer
Network LayerNetwork Layer
Network Layer
 
Ccna day1
Ccna day1Ccna day1
Ccna day1
 
Cs8591 Computer Networks
Cs8591 Computer NetworksCs8591 Computer Networks
Cs8591 Computer Networks
 
20CS2007 Computer Communication Networks
20CS2007 Computer Communication Networks 20CS2007 Computer Communication Networks
20CS2007 Computer Communication Networks
 
Et3003 sem2-1314-9 network layers vi (routing protocols)
Et3003 sem2-1314-9 network layers vi (routing protocols)Et3003 sem2-1314-9 network layers vi (routing protocols)
Et3003 sem2-1314-9 network layers vi (routing protocols)
 
Chapter 8: Switching
Chapter 8: SwitchingChapter 8: Switching
Chapter 8: Switching
 
CS6551 COMPUTER NETWORKS
CS6551 COMPUTER NETWORKSCS6551 COMPUTER NETWORKS
CS6551 COMPUTER NETWORKS
 
Packet transfer mechanism using routers and IP addresses
Packet transfer mechanism using routers and IP addresses Packet transfer mechanism using routers and IP addresses
Packet transfer mechanism using routers and IP addresses
 
Network layer
Network layerNetwork layer
Network layer
 
Et3003 sem2-1314-4 network layers i (ipv4 addressing)
Et3003 sem2-1314-4 network layers i (ipv4 addressing)Et3003 sem2-1314-4 network layers i (ipv4 addressing)
Et3003 sem2-1314-4 network layers i (ipv4 addressing)
 
CCNA ppt Day 2
CCNA ppt Day 2CCNA ppt Day 2
CCNA ppt Day 2
 

Similar a 4d routing

module 5 ch22_networking_routing.pdf
module 5 ch22_networking_routing.pdfmodule 5 ch22_networking_routing.pdf
module 5 ch22_networking_routing.pdfprashant554034
 
Concept of Network Routing Layer
Concept of Network Routing LayerConcept of Network Routing Layer
Concept of Network Routing LayerPawan Singh
 
Module_3_Part_3.pptx
Module_3_Part_3.pptxModule_3_Part_3.pptx
Module_3_Part_3.pptxKPDDRAVIDIAN
 
destination. The network layer must know the topology of the subnet and choos...
destination. The network layer must know the topology of the subnet and choos...destination. The network layer must know the topology of the subnet and choos...
destination. The network layer must know the topology of the subnet and choos...Ashish Gupta
 
Chapter_6_ Network Layer.pptx
Chapter_6_ Network Layer.pptxChapter_6_ Network Layer.pptx
Chapter_6_ Network Layer.pptxduotchol
 
Network layer Part 3
Network layer Part 3Network layer Part 3
Network layer Part 3Tutun Juhana
 
Lecture 1-Networl Layer Services (1).pdf
Lecture 1-Networl Layer Services (1).pdfLecture 1-Networl Layer Services (1).pdf
Lecture 1-Networl Layer Services (1).pdfbeetlejuice6
 
Network layer ip address assignment and routing
Network layer ip address assignment and routingNetwork layer ip address assignment and routing
Network layer ip address assignment and routingHamzahMohammed4
 
Networking in college
Networking in collegeNetworking in college
Networking in collegeHarpreet Gaba
 
Ad-Hoc Wireless Network
Ad-Hoc Wireless NetworkAd-Hoc Wireless Network
Ad-Hoc Wireless Networkmdfarhanh1
 
Et3003 sem2-1314-5 network layers ii (intro to routing)
Et3003 sem2-1314-5 network layers ii (intro to routing)Et3003 sem2-1314-5 network layers ii (intro to routing)
Et3003 sem2-1314-5 network layers ii (intro to routing)Tutun Juhana
 

Similar a 4d routing (20)

Chapter 22
Chapter 22Chapter 22
Chapter 22
 
ch22.ppt
ch22.pptch22.ppt
ch22.ppt
 
module 5 ch22_networking_routing.pdf
module 5 ch22_networking_routing.pdfmodule 5 ch22_networking_routing.pdf
module 5 ch22_networking_routing.pdf
 
Concept of Network Routing Layer
Concept of Network Routing LayerConcept of Network Routing Layer
Concept of Network Routing Layer
 
Module_3_Part_3.pptx
Module_3_Part_3.pptxModule_3_Part_3.pptx
Module_3_Part_3.pptx
 
destination. The network layer must know the topology of the subnet and choos...
destination. The network layer must know the topology of the subnet and choos...destination. The network layer must know the topology of the subnet and choos...
destination. The network layer must know the topology of the subnet and choos...
 
Network_Layer.ppt
Network_Layer.pptNetwork_Layer.ppt
Network_Layer.ppt
 
Chapter_6_ Network Layer.pptx
Chapter_6_ Network Layer.pptxChapter_6_ Network Layer.pptx
Chapter_6_ Network Layer.pptx
 
Unit 4 - Network Layer
Unit 4 - Network LayerUnit 4 - Network Layer
Unit 4 - Network Layer
 
Network layer Part 3
Network layer Part 3Network layer Part 3
Network layer Part 3
 
Unit 4
Unit  4Unit  4
Unit 4
 
Lecture 1-Networl Layer Services (1).pdf
Lecture 1-Networl Layer Services (1).pdfLecture 1-Networl Layer Services (1).pdf
Lecture 1-Networl Layer Services (1).pdf
 
Routing
RoutingRouting
Routing
 
Network layer ip address assignment and routing
Network layer ip address assignment and routingNetwork layer ip address assignment and routing
Network layer ip address assignment and routing
 
Network layer
Network layerNetwork layer
Network layer
 
gofortution
gofortutiongofortution
gofortution
 
Networking in college
Networking in collegeNetworking in college
Networking in college
 
Ad-Hoc Wireless Network
Ad-Hoc Wireless NetworkAd-Hoc Wireless Network
Ad-Hoc Wireless Network
 
DSR,LSR,IGMP,RIP,OSPF.ppt
DSR,LSR,IGMP,RIP,OSPF.pptDSR,LSR,IGMP,RIP,OSPF.ppt
DSR,LSR,IGMP,RIP,OSPF.ppt
 
Et3003 sem2-1314-5 network layers ii (intro to routing)
Et3003 sem2-1314-5 network layers ii (intro to routing)Et3003 sem2-1314-5 network layers ii (intro to routing)
Et3003 sem2-1314-5 network layers ii (intro to routing)
 

Más de kavish dani

4b internet protocol
4b internet protocol4b internet protocol
4b internet protocolkavish dani
 
4a logical laddressing
4a logical laddressing4a logical laddressing
4a logical laddressingkavish dani
 
4c Address Mapping, Error Reporting and Multicasting
4c Address Mapping, Error Reporting and Multicasting4c Address Mapping, Error Reporting and Multicasting
4c Address Mapping, Error Reporting and Multicastingkavish dani
 
1b network models
1b network models1b network models
1b network modelskavish dani
 
3d connecting networks
3d connecting networks3d connecting networks
3d connecting networkskavish dani
 
3b multiple access
3b multiple access3b multiple access
3b multiple accesskavish dani
 
3a data link layer continued
3a data link layer continued3a data link layer continued
3a data link layer continuedkavish dani
 
3a data link layer
3a data link layer 3a data link layer
3a data link layer kavish dani
 
2c wired transmission
2c wired transmission2c wired transmission
2c wired transmissionkavish dani
 
2b switching in networks
2b switching in networks2b switching in networks
2b switching in networkskavish dani
 
2a transmission media
2a transmission  media2a transmission  media
2a transmission mediakavish dani
 
1a introduction to network fundamentals
1a introduction to network fundamentals1a introduction to network fundamentals
1a introduction to network fundamentalskavish dani
 

Más de kavish dani (14)

4b internet protocol
4b internet protocol4b internet protocol
4b internet protocol
 
4a logical laddressing
4a logical laddressing4a logical laddressing
4a logical laddressing
 
4c Address Mapping, Error Reporting and Multicasting
4c Address Mapping, Error Reporting and Multicasting4c Address Mapping, Error Reporting and Multicasting
4c Address Mapping, Error Reporting and Multicasting
 
1b network models
1b network models1b network models
1b network models
 
3d connecting networks
3d connecting networks3d connecting networks
3d connecting networks
 
3c ethernet
3c ethernet3c ethernet
3c ethernet
 
3b multiple access
3b multiple access3b multiple access
3b multiple access
 
3a data link layer continued
3a data link layer continued3a data link layer continued
3a data link layer continued
 
3a data link layer
3a data link layer 3a data link layer
3a data link layer
 
2c wired transmission
2c wired transmission2c wired transmission
2c wired transmission
 
2b switching in networks
2b switching in networks2b switching in networks
2b switching in networks
 
2a transmission media
2a transmission  media2a transmission  media
2a transmission media
 
1a introduction to network fundamentals
1a introduction to network fundamentals1a introduction to network fundamentals
1a introduction to network fundamentals
 
5 forces model
5 forces model5 forces model
5 forces model
 

Último

HED Office Sohayok Exam Question Solution 2023.pdf
HED Office Sohayok Exam Question Solution 2023.pdfHED Office Sohayok Exam Question Solution 2023.pdf
HED Office Sohayok Exam Question Solution 2023.pdfMohonDas
 
General views of Histopathology and step
General views of Histopathology and stepGeneral views of Histopathology and step
General views of Histopathology and stepobaje godwin sunday
 
The Singapore Teaching Practice document
The Singapore Teaching Practice documentThe Singapore Teaching Practice document
The Singapore Teaching Practice documentXsasf Sfdfasd
 
PISA-VET launch_El Iza Mohamedou_19 March 2024.pptx
PISA-VET launch_El Iza Mohamedou_19 March 2024.pptxPISA-VET launch_El Iza Mohamedou_19 March 2024.pptx
PISA-VET launch_El Iza Mohamedou_19 March 2024.pptxEduSkills OECD
 
3.21.24 The Origins of Black Power.pptx
3.21.24  The Origins of Black Power.pptx3.21.24  The Origins of Black Power.pptx
3.21.24 The Origins of Black Power.pptxmary850239
 
2024.03.23 What do successful readers do - Sandy Millin for PARK.pptx
2024.03.23 What do successful readers do - Sandy Millin for PARK.pptx2024.03.23 What do successful readers do - Sandy Millin for PARK.pptx
2024.03.23 What do successful readers do - Sandy Millin for PARK.pptxSandy Millin
 
Presentation on the Basics of Writing. Writing a Paragraph
Presentation on the Basics of Writing. Writing a ParagraphPresentation on the Basics of Writing. Writing a Paragraph
Presentation on the Basics of Writing. Writing a ParagraphNetziValdelomar1
 
Human-AI Co-Creation of Worked Examples for Programming Classes
Human-AI Co-Creation of Worked Examples for Programming ClassesHuman-AI Co-Creation of Worked Examples for Programming Classes
Human-AI Co-Creation of Worked Examples for Programming ClassesMohammad Hassany
 
How to Make a Field read-only in Odoo 17
How to Make a Field read-only in Odoo 17How to Make a Field read-only in Odoo 17
How to Make a Field read-only in Odoo 17Celine George
 
Latin American Revolutions, c. 1789-1830
Latin American Revolutions, c. 1789-1830Latin American Revolutions, c. 1789-1830
Latin American Revolutions, c. 1789-1830Dave Phillips
 
Philosophy of Education and Educational Philosophy
Philosophy of Education  and Educational PhilosophyPhilosophy of Education  and Educational Philosophy
Philosophy of Education and Educational PhilosophyShuvankar Madhu
 
AUDIENCE THEORY -- FANDOM -- JENKINS.pptx
AUDIENCE THEORY -- FANDOM -- JENKINS.pptxAUDIENCE THEORY -- FANDOM -- JENKINS.pptx
AUDIENCE THEORY -- FANDOM -- JENKINS.pptxiammrhaywood
 
How to Print Employee Resume in the Odoo 17
How to Print Employee Resume in the Odoo 17How to Print Employee Resume in the Odoo 17
How to Print Employee Resume in the Odoo 17Celine George
 
Clinical Pharmacy Introduction to Clinical Pharmacy, Concept of clinical pptx
Clinical Pharmacy  Introduction to Clinical Pharmacy, Concept of clinical pptxClinical Pharmacy  Introduction to Clinical Pharmacy, Concept of clinical pptx
Clinical Pharmacy Introduction to Clinical Pharmacy, Concept of clinical pptxraviapr7
 
Prescribed medication order and communication skills.pptx
Prescribed medication order and communication skills.pptxPrescribed medication order and communication skills.pptx
Prescribed medication order and communication skills.pptxraviapr7
 
In - Vivo and In - Vitro Correlation.pptx
In - Vivo and In - Vitro Correlation.pptxIn - Vivo and In - Vitro Correlation.pptx
In - Vivo and In - Vitro Correlation.pptxAditiChauhan701637
 
How to Solve Singleton Error in the Odoo 17
How to Solve Singleton Error in the  Odoo 17How to Solve Singleton Error in the  Odoo 17
How to Solve Singleton Error in the Odoo 17Celine George
 
How to Add a many2many Relational Field in Odoo 17
How to Add a many2many Relational Field in Odoo 17How to Add a many2many Relational Field in Odoo 17
How to Add a many2many Relational Field in Odoo 17Celine George
 
Quality Assurance_GOOD LABORATORY PRACTICE
Quality Assurance_GOOD LABORATORY PRACTICEQuality Assurance_GOOD LABORATORY PRACTICE
Quality Assurance_GOOD LABORATORY PRACTICESayali Powar
 

Último (20)

HED Office Sohayok Exam Question Solution 2023.pdf
HED Office Sohayok Exam Question Solution 2023.pdfHED Office Sohayok Exam Question Solution 2023.pdf
HED Office Sohayok Exam Question Solution 2023.pdf
 
General views of Histopathology and step
General views of Histopathology and stepGeneral views of Histopathology and step
General views of Histopathology and step
 
The Singapore Teaching Practice document
The Singapore Teaching Practice documentThe Singapore Teaching Practice document
The Singapore Teaching Practice document
 
PISA-VET launch_El Iza Mohamedou_19 March 2024.pptx
PISA-VET launch_El Iza Mohamedou_19 March 2024.pptxPISA-VET launch_El Iza Mohamedou_19 March 2024.pptx
PISA-VET launch_El Iza Mohamedou_19 March 2024.pptx
 
3.21.24 The Origins of Black Power.pptx
3.21.24  The Origins of Black Power.pptx3.21.24  The Origins of Black Power.pptx
3.21.24 The Origins of Black Power.pptx
 
2024.03.23 What do successful readers do - Sandy Millin for PARK.pptx
2024.03.23 What do successful readers do - Sandy Millin for PARK.pptx2024.03.23 What do successful readers do - Sandy Millin for PARK.pptx
2024.03.23 What do successful readers do - Sandy Millin for PARK.pptx
 
Presentation on the Basics of Writing. Writing a Paragraph
Presentation on the Basics of Writing. Writing a ParagraphPresentation on the Basics of Writing. Writing a Paragraph
Presentation on the Basics of Writing. Writing a Paragraph
 
Human-AI Co-Creation of Worked Examples for Programming Classes
Human-AI Co-Creation of Worked Examples for Programming ClassesHuman-AI Co-Creation of Worked Examples for Programming Classes
Human-AI Co-Creation of Worked Examples for Programming Classes
 
How to Make a Field read-only in Odoo 17
How to Make a Field read-only in Odoo 17How to Make a Field read-only in Odoo 17
How to Make a Field read-only in Odoo 17
 
Latin American Revolutions, c. 1789-1830
Latin American Revolutions, c. 1789-1830Latin American Revolutions, c. 1789-1830
Latin American Revolutions, c. 1789-1830
 
Philosophy of Education and Educational Philosophy
Philosophy of Education  and Educational PhilosophyPhilosophy of Education  and Educational Philosophy
Philosophy of Education and Educational Philosophy
 
AUDIENCE THEORY -- FANDOM -- JENKINS.pptx
AUDIENCE THEORY -- FANDOM -- JENKINS.pptxAUDIENCE THEORY -- FANDOM -- JENKINS.pptx
AUDIENCE THEORY -- FANDOM -- JENKINS.pptx
 
How to Print Employee Resume in the Odoo 17
How to Print Employee Resume in the Odoo 17How to Print Employee Resume in the Odoo 17
How to Print Employee Resume in the Odoo 17
 
Clinical Pharmacy Introduction to Clinical Pharmacy, Concept of clinical pptx
Clinical Pharmacy  Introduction to Clinical Pharmacy, Concept of clinical pptxClinical Pharmacy  Introduction to Clinical Pharmacy, Concept of clinical pptx
Clinical Pharmacy Introduction to Clinical Pharmacy, Concept of clinical pptx
 
Finals of Kant get Marx 2.0 : a general politics quiz
Finals of Kant get Marx 2.0 : a general politics quizFinals of Kant get Marx 2.0 : a general politics quiz
Finals of Kant get Marx 2.0 : a general politics quiz
 
Prescribed medication order and communication skills.pptx
Prescribed medication order and communication skills.pptxPrescribed medication order and communication skills.pptx
Prescribed medication order and communication skills.pptx
 
In - Vivo and In - Vitro Correlation.pptx
In - Vivo and In - Vitro Correlation.pptxIn - Vivo and In - Vitro Correlation.pptx
In - Vivo and In - Vitro Correlation.pptx
 
How to Solve Singleton Error in the Odoo 17
How to Solve Singleton Error in the  Odoo 17How to Solve Singleton Error in the  Odoo 17
How to Solve Singleton Error in the Odoo 17
 
How to Add a many2many Relational Field in Odoo 17
How to Add a many2many Relational Field in Odoo 17How to Add a many2many Relational Field in Odoo 17
How to Add a many2many Relational Field in Odoo 17
 
Quality Assurance_GOOD LABORATORY PRACTICE
Quality Assurance_GOOD LABORATORY PRACTICEQuality Assurance_GOOD LABORATORY PRACTICE
Quality Assurance_GOOD LABORATORY PRACTICE
 

4d routing

  • 1. Delivery, Forwarding and Routing Networking Fundamentals
  • 2. 22.2 DELIVERYDELIVERY • DeliveryDelivery of a packet is defined as the handling ofof a packet is defined as the handling of the packets by the underlying Physical networksthe packets by the underlying Physical networks based on the supervision of the Networkbased on the supervision of the Network (& Data(& Data Link)Link) layer.layer. • Delivery of a packet to its final destination isDelivery of a packet to its final destination is accomplished by using two different methods,accomplished by using two different methods, direct and indirect.direct and indirect.
  • 4. 22.4 FORWARDING & ROUTINGFORWARDING & ROUTING • ForwardingForwarding means to place the packet in its route to itsmeans to place the packet in its route to its destination. Forwarding requires a host or a router todestination. Forwarding requires a host or a router to have a routing table. When a host has a packet to sendhave a routing table. When a host has a packet to send or when a router has received a packet to be forwarded,or when a router has received a packet to be forwarded, it looks at this table to find the route to the finalit looks at this table to find the route to the final destination.destination. • RoutingRouting refers to the way routing tables are created torefers to the way routing tables are created to help in forwarding.help in forwarding. • We now see three forwarding techniques, these makeWe now see three forwarding techniques, these make thethe size of the routing table manageablesize of the routing table manageable..
  • 5. 22.5 1. Route method versus next-hop method (lesser content)
  • 6. 22.6 2. Host-specific versus network-specific method (again lesser content)
  • 7. 22.7 3. Default method (The default route is normally defined as address 0.0.0.0)
  • 8. 22.8 Classless Inter-Domain Routing (CIDR) is a system of IP addressing and routing that solves the many problems of “classful” addressing by eliminating fixed address classes in favor of a flexible, multiple-level, hierarchical structure of networks of varying size. Note
  • 10. 22.10 Simplified forwarding module in classless address
  • 11. 22.11 In classless addressing, we need at least four columns in a routing table. Usually there are more. Note
  • 12. 22.12 Make a routing table for router R1, using the configuration in Figure. Example 1 Solution Table after the figure shows the corresponding table.
  • 14. 22.14 Routing table for router R1 in Figure Actually, for Default route, Mask should be /0 and Network Address should be 0.0.0.0
  • 15. 22.15 Show the forwarding process if a packet arrives at R1 in Figure with the destination address 180.70.65.140. Example 2 Solution The router performs the following steps: 1. The first mask (/26) is applied to the destination address. The result is 180.70.65.128, which does not match the corresponding network address. 2. The second mask (/25) is applied to the destination address. The result is 180.70.65.128, which matches the corresponding network address. The desination address and the interface number m0 are passed to ARP for further processing.
  • 16. 22.16 Show the forwarding process if a packet arrives at R1 in Figure with the destination address 201.4.22.35. Example 3 Solution The router performs the following steps: 1. The first mask (/26) is applied to the destination address. The result is 201.4.22.0, which does not match the corresponding network address. 2. The second mask (/25) is applied to the destination address. The result is 201.4.22.0, which does not match the corresponding network address (row 2). 3. The third mask (/24) is applied to the destination address. The result is 201.4.22.0, which matches the corresponding network address. The destination address of the packet and the interface number m3 are passed to ARP.
  • 17. 22.17 Show the forwarding process if a packet arrives at R1 in Figure with the destination address 18.24.32.78. Example 4 Solution This time all masks are applied, one by one, to the destination address, but no matching network address is found. When it reaches the end of the table, the module gives the next-hop address 180.70.65.200 and interface number m2 to ARP. This is probably an outgoing package that needs to be sent, via the default router, to someplace else in the Internet.
  • 18. 22.18
  • 20. 22.20
  • 23. 22.23 As an example of hierarchical routing, let us consider the Figure. A regional ISP is granted 16,384 addresses starting from 120.14.64.0. The regional ISP has decided to divide this block into four subblocks, each with 4096 addresses. Three of these subblocks are assigned to three local ISPs; the second subblock is reserved for future use. Note that the mask for each block is /20 because the original block with mask /18 is divided into 4 blocks. Example 5 The first local ISP has divided its assigned subblock into 8 smaller blocks and assigned each to a small ISP. Each small ISP provides services to 128 households, each using four addresses.
  • 24. 22.24 The second local ISP has divided its block into 4 blocks and has assigned the addresses to four large organizations. Example 5 (continued) There is a sense of hierarchy in this configuration. All routers in the Internet send a packet with destination address 120.14.64.0 to 120.14.127.255 to the regional ISP. The regional ISP sends every packet between 120.14.64.0 to 120.14.79.255 to local ISP1. Local ISP1 sends every packet between 120.14.64.0 to 120.14.65.255 to Small ISP1. Small ISP1 sends every packet between 120.14.64.0 to 120.14.64.3 to H001. The third local ISP has divided its block into 16 blocks and assigned each block to a small organization. Each small organization has 256 addresses, and the mask is /24.
  • 25. 22.25 Hierarchical routing with ISPs 120.14.127.255 120.14.79.255 120.14.95.255 120.14.111.255 120.14.127.255 8 120.14.65.255 120.14.79.255 120.14.64.3 120.14.99.255 120.14.112.255
  • 26. 22.26
  • 27. 22.27 Common fields in a routing table
  • 28. 22.28
  • 29. 22.29 One utility that can be used to find the contents of a routing table for a host or router is netstat in UNIX or LINUX. The next slide shows the list of the contents of a default server. We have used two options, r and n. The option r indicates that we are interested in the routing table, and the option n indicates that we are looking for numeric addresses. Note that this is a routing table for a host, not a router. Although we discussed the routing table for a router throughout, a host also needs a routing table. Example 6
  • 30. 22.30 Example 6 (continued) The destination column here defines the network address. The term gateway used by UNIX is synonymous with router. This column actually defines the address of the next hop. The value 0.0.0.0 shows that the delivery is direct. The last entry has a flag of G, which means that the destination can be reached through a router (default router). The Iface defines the interface.
  • 31. 22.31 Example 6 (continued) More information about the IP address and physical address of the server can be found by using the ifconfig command on the given interface (eth0).
  • 32. 22.32 Configuration of the server for Example 6
  • 34. 22.34
  • 35. 22.35 UNICAST ROUTING PROTOCOLSUNICAST ROUTING PROTOCOLS • A routing table can be eitherA routing table can be either staticstatic oror dynamicdynamic. A. A static table is one with manual entries. A dynamicstatic table is one with manual entries. A dynamic table is one that is updated automatically whentable is one that is updated automatically when there is a change somewhere in the Internet.there is a change somewhere in the Internet. • A routing protocol is a combination of rules andA routing protocol is a combination of rules and procedures that lets routers in the Internet informprocedures that lets routers in the Internet inform each other of changes.each other of changes. • A dynamic routing table is updated periodically byA dynamic routing table is updated periodically by using one of these protocols.using one of these protocols.
  • 39. 22.39 Distance-Vector Protocols • The distance-vector routing approach determines the direction (vector) and distance (hop count) to any link in the internetwork. Distance-vector algorithms periodically (such as every 30 seconds) send all or some portion of their routing table to their adjacent neighbors. • Routers running a distance-vector routing protocol send periodic updates even if there are no changes in the network. By receiving a neighbor’s routing table, a router can verify all the known routes and make changes to the local routing table based on updated information received from the neighboring router. • Distance-vector protocols use the Bellman-Ford Algorithm to calculate the best paths. Examples of distance-vector protocols include the following: ■ Routing Information Protocol (RIP)—The most common IGP in the Internet, RIP uses hop count as its routing metric. ■ Interior Gateway Routing Protocol (IGRP)— Addresses the issues associated with routing in large, heterogeneous networks.
  • 40. 22.40 Link-State Protocols • Link-state routing protocols were designed to overcome the limitations of distance vector routing protocols. Link-state routing protocols respond quickly to network changes, send trigger updates only when a network change has occurred, and send periodic updates (called link-state refreshes) at long time intervals, such as every 30 minutes. • When a link changes state, the device that detected the change creates a link-state advertisement (LSA) concerning that link (route), and that LSA is propagated to all neighboring devices. Each routing device takes a copy of the LSA, updates its link-state (topological) database, and forwards the LSA to all neighboring devices. This flooding of the LSA is required to ensure that all routing devices update their databases before creating an updated routing table that reflects the new topology. • The link-state database is used to calculate the best paths through the network by applying the Dijkstra Shortest Path First (SPF) algorithm • Examples of link-state protocols are OSPF and IS-IS.
  • 41. 22.41 BGP • Border Gateway Protocol (BGP) is an example of an EGP. BGP exchanges routing information between autonomous systems while guaranteeing loop-free path selection. • It is the principal route advertising protocol used by major companies and ISPs on the Internet. BGP-4 is the first version of BGP that supports classless interdomain routing (CIDR) and route aggregation. • Unlike common IGPs such as RIP, OSPF, and EIGRP, BGP does not use metrics such as hop count or bandwidth or delay. • Instead, BGP makes routing decisions based on network policies or rules using various BGP path attributes.