SlideShare a Scribd company logo
9.1
Network Layer:
Internet Protocol
Networking Fundamentals
20.2
INTERNETWORKINGINTERNETWORKING
We now discuss internetworking _ connectingWe now discuss internetworking _ connecting
networks together to make an internetwork or annetworks together to make an internetwork or an
internet.internet.
20.3
Links between two hosts
20.4
Network layer in an internetwork
20.5
Network layer at the source, router, and destination
20.6
Switching at the network layer in the
Internet uses the datagram approach to
packet switching. In a datagram
network, each packet is treated
independently of others, even if it is a
part of a multipacket transmission.
Packets in this approach are normally
referred to as datagrams.
Note
20.7
Communication at the network layer in
the Internet is connectionless. The
reason for this is due to the
heterogeneous nature of the Internet.
Note
20.8
IPv4IPv4
• The Internet Protocol version 4 (The Internet Protocol version 4 (IPv4IPv4) is the) is the
delivery mechanism used by the TCP/IP protocols.delivery mechanism used by the TCP/IP protocols.
• It is an unreliable – aIt is an unreliable – a best-effort deliverybest-effort delivery service.service.
• If reliability is important, then it must be pairedIf reliability is important, then it must be paired
withwith TCP.TCP.
20.9
Position of IPv4 in TCP/IP protocol suite
20.10
IPv4 datagram format
Version ? HLEN ?
20.11
Service type or differentiated services
20.12
• Differentiated Services or DiffServ is a computer
networking architecture that specifies a simple, scalable
and coarse-grained mechanism for classifying, managing
network traffic and providing Quality of Service (QoS)
guarantees on modern IP networks.
• DiffServ can, for example, be used to provide low-
latency, low-loss service to critical network traffic such as
voice or video while providing simple best-effort traffic
guarantees to non-critical services such as web traffic or
file transfers.
• DiffServ uses the 6-bit Differentiated Services Code
Point (DSCP) field in the header of IP packets for packet
classification purposes.
20.13
• In theory, a network could have up to 64 (i.e. 26
)
different traffic classes using different markings in the
DSCP. The DiffServ RFCs recommend, but do not require,
certain encodings.
• This gives a network operator great flexibility in
defining traffic classes. In practice, however, most
networks use the following commonly-defined Per-Hop
Behaviors:
–Default PHB—which is typically best-effort traffic
–Assured Forwarding (AF) PHB— which gives assurance of
delivery under conditions
–Expedited Forwarding (EF) PHB—dedicated to low-loss,
low-latency traffic
20.14
The total length field defines the total
length of the datagram including the
header. Required such that can
differentiate from the padding.
Note
What is this ?
20.15
Encapsulation of a small datagram in an Ethernet frame
20.16
• Time to live (TTL) (8 bits) - Limits the number of
routers the datagram can pass through. Usually
set to 32 or 64 (some even recommend 128).
Every time the datagram passes through a router
this value is decremented by a value of one or
more. This is to keep the datagram from circulating
in an infinite loop forever.
• Protocol (8 bits) - It identifies the protocol
whose data is encapsulated in the datagram.
• Source & Destination IP Address – Self-
explanatory.
20.17
Protocol field and encapsulated data
20.18
An IPv4 packet has arrived with the first 8 bits as shown:
01000010
The receiver discards the packet. Why?
Solution
There is an error in this packet. The 4 leftmost bits (0100)
show the version, which is correct. The next 4 bits (0010)
show an invalid header length (2 × 4 = 8). The minimum
number of bytes in the header must be 20. The packet has
been corrupted in transmission.
Example 1
20.19
In an IPv4 packet, the value of HLEN is 1000 in binary.
How many bytes of options are being carried by this
packet?
Solution
The HLEN value is 8, which means the total number of
bytes in the header is 8 × 4, or 32 bytes. The first 20 bytes
are the base header, the next 12 bytes are the options.
Example 2
20.20
In an IPv4 packet, the value of HLEN is 5, and the value
of the total length field is 0x0028. How many bytes of
data are being carried by this packet?
Solution
The HLEN value is 5, which means the total number of
bytes in the header is 5 × 4, or 20 bytes (no options). The
total length is 40 bytes, which means the packet is
carrying 20 bytes of data (40 20).−
Example 3
20.21
An IPv4 packet has arrived with the first few hexadecimal
digits as shown.
0x45000028000100000102 . . .
How many hops can this packet travel before being
dropped? The data belong to what upper-layer protocol?
Solution
To find the time-to-live field, we skip 8 bytes. The time-to-
live field is the ninth byte, which is 01. This means the
packet can travel only one hop. The protocol field is the
next byte (02), which means that the upper-layer protocol
is IGMP.
Example 4
20.22
Maximum Transmission Unit (MTU)
• IP packets larger than the
MTU must go through IP
fragmentation procedures.
MTUs for some networks
20.23
• Fragmentation related fields:
•Identification - Uniquely identifies each datagram. This is used
to re-assemble the datagram. Each fragment of the datagram
contains this same unique number.
• Flags:
— Bit 0 - reserved.
— Bit 1 - The do not fragment bit. A value of 1 means the packet
should not be fragmented while a 0 means it may be
fragmented.
— Bit 2 - The more fragment bit. This value is set on all fragments
except the last one since a value of 0 means this is the last
fragment.
• Fragment offset - The offset in 8 byte units of this fragment
from the beginning of the original datagram (8191 x 8 = 65528).
20.24
Fragmentation example
Note. Fragmentation offsets are calculated from the data lengths and not the total lengths of
the packet
20.25
Detailed fragmentation example
20.26
A packet has arrived with an M bit value of 0. Is this the
first fragment, the last fragment, or a middle fragment?
Do we know if the packet was fragmented?
Solution
If the M bit is 0, it means that there are no more
fragments; the fragment is the last one. However, we
cannot say if the original packet was fragmented or not. A
non-fragmented packet is considered the last fragment.
Example 5
20.27
A packet has arrived with an M bit value of 1. Is this the
first fragment, the last fragment, or a middle fragment?
Do we know if the packet was fragmented?
Solution
If the M bit is 1, it means that there is at least one more
fragment. This fragment can be the first one or a middle
one, but not the last one. We don’t know if it is the first
one or a middle one; we need more information (the
value of the fragmentation offset).
Example 6
20.28
A packet has arrived with an M bit value of 1 and a
fragmentation offset value of 0. Is this the first fragment,
the last fragment, or a middle fragment?
Solution
Because the M bit is 1, it is either the first fragment or a
middle one. Because the offset value is 0, it is the first
fragment.
Example 7
20.29
A packet has arrived in which the offset value is 100.
What is the number of the first byte? Do we know the
number of the last byte?
Solution
To find the number of the first byte, we multiply the offset
value by 8. This means that the first byte number is 800.
We cannot determine the number of the last byte unless
we know the length.
Example 8
20.30
A packet has arrived in which the offset value is 100, the
value of HLEN is 5, and the value of the total length field
is 100. What are the numbers of the first byte and the last
byte?
Solution
The first byte number is 100 × 8 = 800. The total length is
100 bytes, and the header length is 20 bytes (5 × 4), which
means that there are 80 bytes in this datagram. If the first
byte number is 800, the last byte number must be 879.
Example 9
20.31
Figure shows an example of a checksum calculation for
an IPv4 header without options. The header is divided
into 16-bit sections. All the sections are added and the
sum is complemented. The result is inserted in the
checksum field.
Example 10
20.32
Example of checksum calculation in IPv4
20.33
Taxonomy of options in IPv4
20.34
20.35

More Related Content

What's hot

http://www.logos.ic.i.u-tokyo.ac.jp/~kay/papers/ccgrid2008_stable_broadcast.pdf
http://www.logos.ic.i.u-tokyo.ac.jp/~kay/papers/ccgrid2008_stable_broadcast.pdfhttp://www.logos.ic.i.u-tokyo.ac.jp/~kay/papers/ccgrid2008_stable_broadcast.pdf
http://www.logos.ic.i.u-tokyo.ac.jp/~kay/papers/ccgrid2008_stable_broadcast.pdfHiroshi Ono
 
A Subspace Method for Blind Channel Estimation in CP-free OFDM Systems
A Subspace Method for Blind Channel Estimation in CP-free OFDM SystemsA Subspace Method for Blind Channel Estimation in CP-free OFDM Systems
A Subspace Method for Blind Channel Estimation in CP-free OFDM Systems
CSCJournals
 
Improving The Performance of Viterbi Decoder using Window System
Improving The Performance of Viterbi Decoder using Window System Improving The Performance of Viterbi Decoder using Window System
Improving The Performance of Viterbi Decoder using Window System
IJECEIAES
 
Real-time DSP Implementation of Audio Crosstalk Cancellation using Mixed Unif...
Real-time DSP Implementation of Audio Crosstalk Cancellation using Mixed Unif...Real-time DSP Implementation of Audio Crosstalk Cancellation using Mixed Unif...
Real-time DSP Implementation of Audio Crosstalk Cancellation using Mixed Unif...
CSCJournals
 
Multiplexing : Wave Division Multiplexing
Multiplexing : Wave Division MultiplexingMultiplexing : Wave Division Multiplexing
Multiplexing : Wave Division Multiplexing
Dr Rajiv Srivastava
 
Oblivious Neural Network Predictions via MiniONN Transformations
Oblivious Neural Network Predictions via MiniONN TransformationsOblivious Neural Network Predictions via MiniONN Transformations
Oblivious Neural Network Predictions via MiniONN Transformations
Sherif Abdelfattah
 
5 multiplexing dan media transmisi
5 multiplexing dan media transmisi5 multiplexing dan media transmisi
5 multiplexing dan media transmisiampas03
 
Multiplexing
MultiplexingMultiplexing
Multiplexing
Romyull Islam
 
Study of the operational SNR while constructing polar codes
Study of the operational SNR while constructing polar codes Study of the operational SNR while constructing polar codes
Study of the operational SNR while constructing polar codes
IJECEIAES
 
Iterative Soft Decision Based Complex K-best MIMO Decoder
Iterative Soft Decision Based Complex K-best MIMO DecoderIterative Soft Decision Based Complex K-best MIMO Decoder
Iterative Soft Decision Based Complex K-best MIMO Decoder
CSCJournals
 
Subproblem-Tree Calibration: A Unified Approach to Max-Product Message Passin...
Subproblem-Tree Calibration: A Unified Approach to Max-Product Message Passin...Subproblem-Tree Calibration: A Unified Approach to Max-Product Message Passin...
Subproblem-Tree Calibration: A Unified Approach to Max-Product Message Passin...
Varad Meru
 
Mi0035 computer networks
Mi0035   computer networksMi0035   computer networks
Mi0035 computer networks
smumbahelp
 
Cb25464467
Cb25464467Cb25464467
Cb25464467
IJERA Editor
 
Fuzzieee-98-final
Fuzzieee-98-finalFuzzieee-98-final
Fuzzieee-98-finalSumit Sen
 
Ch7 noise variation of different modulation scheme pg 63
Ch7 noise variation of different modulation scheme pg 63Ch7 noise variation of different modulation scheme pg 63
Ch7 noise variation of different modulation scheme pg 63
Prateek Omer
 
Communication costs in parallel machines
Communication costs in parallel machinesCommunication costs in parallel machines
Communication costs in parallel machines
Syed Zaid Irshad
 
1.[1 6] a novel papr reduction scheme based on selective mapping and a random...
1.[1 6] a novel papr reduction scheme based on selective mapping and a random...1.[1 6] a novel papr reduction scheme based on selective mapping and a random...
1.[1 6] a novel papr reduction scheme based on selective mapping and a random...Alexander Decker
 

What's hot (19)

http://www.logos.ic.i.u-tokyo.ac.jp/~kay/papers/ccgrid2008_stable_broadcast.pdf
http://www.logos.ic.i.u-tokyo.ac.jp/~kay/papers/ccgrid2008_stable_broadcast.pdfhttp://www.logos.ic.i.u-tokyo.ac.jp/~kay/papers/ccgrid2008_stable_broadcast.pdf
http://www.logos.ic.i.u-tokyo.ac.jp/~kay/papers/ccgrid2008_stable_broadcast.pdf
 
A Subspace Method for Blind Channel Estimation in CP-free OFDM Systems
A Subspace Method for Blind Channel Estimation in CP-free OFDM SystemsA Subspace Method for Blind Channel Estimation in CP-free OFDM Systems
A Subspace Method for Blind Channel Estimation in CP-free OFDM Systems
 
Improving The Performance of Viterbi Decoder using Window System
Improving The Performance of Viterbi Decoder using Window System Improving The Performance of Viterbi Decoder using Window System
Improving The Performance of Viterbi Decoder using Window System
 
Real-time DSP Implementation of Audio Crosstalk Cancellation using Mixed Unif...
Real-time DSP Implementation of Audio Crosstalk Cancellation using Mixed Unif...Real-time DSP Implementation of Audio Crosstalk Cancellation using Mixed Unif...
Real-time DSP Implementation of Audio Crosstalk Cancellation using Mixed Unif...
 
Multiplexing : Wave Division Multiplexing
Multiplexing : Wave Division MultiplexingMultiplexing : Wave Division Multiplexing
Multiplexing : Wave Division Multiplexing
 
Data compression
Data compressionData compression
Data compression
 
Oblivious Neural Network Predictions via MiniONN Transformations
Oblivious Neural Network Predictions via MiniONN TransformationsOblivious Neural Network Predictions via MiniONN Transformations
Oblivious Neural Network Predictions via MiniONN Transformations
 
5 multiplexing dan media transmisi
5 multiplexing dan media transmisi5 multiplexing dan media transmisi
5 multiplexing dan media transmisi
 
Multiplexing
MultiplexingMultiplexing
Multiplexing
 
Study of the operational SNR while constructing polar codes
Study of the operational SNR while constructing polar codes Study of the operational SNR while constructing polar codes
Study of the operational SNR while constructing polar codes
 
Iterative Soft Decision Based Complex K-best MIMO Decoder
Iterative Soft Decision Based Complex K-best MIMO DecoderIterative Soft Decision Based Complex K-best MIMO Decoder
Iterative Soft Decision Based Complex K-best MIMO Decoder
 
Subproblem-Tree Calibration: A Unified Approach to Max-Product Message Passin...
Subproblem-Tree Calibration: A Unified Approach to Max-Product Message Passin...Subproblem-Tree Calibration: A Unified Approach to Max-Product Message Passin...
Subproblem-Tree Calibration: A Unified Approach to Max-Product Message Passin...
 
Mi0035 computer networks
Mi0035   computer networksMi0035   computer networks
Mi0035 computer networks
 
Cb25464467
Cb25464467Cb25464467
Cb25464467
 
Fuzzieee-98-final
Fuzzieee-98-finalFuzzieee-98-final
Fuzzieee-98-final
 
Multiplexing
MultiplexingMultiplexing
Multiplexing
 
Ch7 noise variation of different modulation scheme pg 63
Ch7 noise variation of different modulation scheme pg 63Ch7 noise variation of different modulation scheme pg 63
Ch7 noise variation of different modulation scheme pg 63
 
Communication costs in parallel machines
Communication costs in parallel machinesCommunication costs in parallel machines
Communication costs in parallel machines
 
1.[1 6] a novel papr reduction scheme based on selective mapping and a random...
1.[1 6] a novel papr reduction scheme based on selective mapping and a random...1.[1 6] a novel papr reduction scheme based on selective mapping and a random...
1.[1 6] a novel papr reduction scheme based on selective mapping and a random...
 

Similar to 4b internet protocol

Chapter 20
Chapter 20Chapter 20
Chapter 20
Faisal Mehmood
 
Chapter 20: Internet Protocol
Chapter 20: Internet ProtocolChapter 20: Internet Protocol
Chapter 20: Internet Protocol
Shafaan Khaliq Bhatti
 
20 Network Layer_Internet_Protocol
20 Network Layer_Internet_Protocol20 Network Layer_Internet_Protocol
20 Network Layer_Internet_Protocol
Ahmar Hashmi
 
Ch2020
Ch2020Ch2020
Chap 08 ip
Chap 08 ipChap 08 ip
Chap 08 ip
Noctorous Jamal
 
C. N. II Lec.4.pdf h
C. N. II Lec.4.pdf                      hC. N. II Lec.4.pdf                      h
C. N. II Lec.4.pdf h
abdnazar2003
 
Ipspk1
Ipspk1Ipspk1
COMPUTER COMMUNICATION NETWORKS -IPv4
COMPUTER COMMUNICATION NETWORKS -IPv4COMPUTER COMMUNICATION NETWORKS -IPv4
COMPUTER COMMUNICATION NETWORKS -IPv4
Krishna Nanda
 
Demodulation of Wi-Fi 802.11g Packets
Demodulation of Wi-Fi 802.11g PacketsDemodulation of Wi-Fi 802.11g Packets
Demodulation of Wi-Fi 802.11g Packets
Shamman Noor Shoudha
 
IPV4 Frame Format
IPV4 Frame FormatIPV4 Frame Format
IPV4 Frame Format
Aditya Rawat
 
Lecture-05.pdf
Lecture-05.pdfLecture-05.pdf
Lecture-05.pdf
AbrahamGadissa
 
Ch 19 Network-layer protocols Section 1
Ch 19  Network-layer protocols Section 1Ch 19  Network-layer protocols Section 1
Ch 19 Network-layer protocols Section 1
Hossam El-Deen Osama
 
IntroductionTransport LayerTransport Layer forms the bas.docx
IntroductionTransport LayerTransport Layer forms the bas.docxIntroductionTransport LayerTransport Layer forms the bas.docx
IntroductionTransport LayerTransport Layer forms the bas.docx
mariuse18nolet
 
Razin Kabir (063452556)
Razin Kabir (063452556)Razin Kabir (063452556)
Razin Kabir (063452556)mashiur
 
IPHEADER_IPV4_IPV6_4.pdf
IPHEADER_IPV4_IPV6_4.pdfIPHEADER_IPV4_IPV6_4.pdf
IPHEADER_IPV4_IPV6_4.pdf
AbhishekKumar66407
 

Similar to 4b internet protocol (20)

Chapter 20
Chapter 20Chapter 20
Chapter 20
 
Ch20
Ch20Ch20
Ch20
 
Chapter 20: Internet Protocol
Chapter 20: Internet ProtocolChapter 20: Internet Protocol
Chapter 20: Internet Protocol
 
20 Network Layer_Internet_Protocol
20 Network Layer_Internet_Protocol20 Network Layer_Internet_Protocol
20 Network Layer_Internet_Protocol
 
Ch2020
Ch2020Ch2020
Ch2020
 
Ch08
Ch08Ch08
Ch08
 
Chap 08 ip
Chap 08 ipChap 08 ip
Chap 08 ip
 
C. N. II Lec.4.pdf h
C. N. II Lec.4.pdf                      hC. N. II Lec.4.pdf                      h
C. N. II Lec.4.pdf h
 
Unit-2_CN.pdf
Unit-2_CN.pdfUnit-2_CN.pdf
Unit-2_CN.pdf
 
Ipspk1
Ipspk1Ipspk1
Ipspk1
 
COMPUTER COMMUNICATION NETWORKS -IPv4
COMPUTER COMMUNICATION NETWORKS -IPv4COMPUTER COMMUNICATION NETWORKS -IPv4
COMPUTER COMMUNICATION NETWORKS -IPv4
 
Demodulation of Wi-Fi 802.11g Packets
Demodulation of Wi-Fi 802.11g PacketsDemodulation of Wi-Fi 802.11g Packets
Demodulation of Wi-Fi 802.11g Packets
 
IPV4 Frame Format
IPV4 Frame FormatIPV4 Frame Format
IPV4 Frame Format
 
Lecture-05.pdf
Lecture-05.pdfLecture-05.pdf
Lecture-05.pdf
 
Ch 19 Network-layer protocols Section 1
Ch 19  Network-layer protocols Section 1Ch 19  Network-layer protocols Section 1
Ch 19 Network-layer protocols Section 1
 
IntroductionTransport LayerTransport Layer forms the bas.docx
IntroductionTransport LayerTransport Layer forms the bas.docxIntroductionTransport LayerTransport Layer forms the bas.docx
IntroductionTransport LayerTransport Layer forms the bas.docx
 
CN Unit 3
CN Unit 3 CN Unit 3
CN Unit 3
 
Internet Protocol
Internet ProtocolInternet Protocol
Internet Protocol
 
Razin Kabir (063452556)
Razin Kabir (063452556)Razin Kabir (063452556)
Razin Kabir (063452556)
 
IPHEADER_IPV4_IPV6_4.pdf
IPHEADER_IPV4_IPV6_4.pdfIPHEADER_IPV4_IPV6_4.pdf
IPHEADER_IPV4_IPV6_4.pdf
 

More from kavish 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 access
kavish 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 fundamentals
kavish dani
 

More from kavish dani (14)

4d routing
4d routing4d routing
4d routing
 
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
 

Recently uploaded

678020731-Sumas-y-Restas-Para-Colorear.pdf
678020731-Sumas-y-Restas-Para-Colorear.pdf678020731-Sumas-y-Restas-Para-Colorear.pdf
678020731-Sumas-y-Restas-Para-Colorear.pdf
CarlosHernanMontoyab2
 
Phrasal Verbs.XXXXXXXXXXXXXXXXXXXXXXXXXX
Phrasal Verbs.XXXXXXXXXXXXXXXXXXXXXXXXXXPhrasal Verbs.XXXXXXXXXXXXXXXXXXXXXXXXXX
Phrasal Verbs.XXXXXXXXXXXXXXXXXXXXXXXXXX
MIRIAMSALINAS13
 
1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx
JosvitaDsouza2
 
The Challenger.pdf DNHS Official Publication
The Challenger.pdf DNHS Official PublicationThe Challenger.pdf DNHS Official Publication
The Challenger.pdf DNHS Official Publication
Delapenabediema
 
How to Make a Field invisible in Odoo 17
How to Make a Field invisible in Odoo 17How to Make a Field invisible in Odoo 17
How to Make a Field invisible in Odoo 17
Celine George
 
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptxChapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptx
Mohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
 
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
Jisc
 
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.pptThesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
EverAndrsGuerraGuerr
 
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and ResearchDigital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
Vikramjit Singh
 
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
Levi Shapiro
 
A Strategic Approach: GenAI in Education
A Strategic Approach: GenAI in EducationA Strategic Approach: GenAI in Education
A Strategic Approach: GenAI in Education
Peter Windle
 
Guidance_and_Counselling.pdf B.Ed. 4th Semester
Guidance_and_Counselling.pdf B.Ed. 4th SemesterGuidance_and_Counselling.pdf B.Ed. 4th Semester
Guidance_and_Counselling.pdf B.Ed. 4th Semester
Atul Kumar Singh
 
Lapbook sobre os Regimes Totalitários.pdf
Lapbook sobre os Regimes Totalitários.pdfLapbook sobre os Regimes Totalitários.pdf
Lapbook sobre os Regimes Totalitários.pdf
Jean Carlos Nunes Paixão
 
Francesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk - How can education support child empowerment.pptxFrancesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk - How can education support child empowerment.pptx
EduSkills OECD
 
Language Across the Curriculm LAC B.Ed.
Language Across the  Curriculm LAC B.Ed.Language Across the  Curriculm LAC B.Ed.
Language Across the Curriculm LAC B.Ed.
Atul Kumar Singh
 
Honest Reviews of Tim Han LMA Course Program.pptx
Honest Reviews of Tim Han LMA Course Program.pptxHonest Reviews of Tim Han LMA Course Program.pptx
Honest Reviews of Tim Han LMA Course Program.pptx
timhan337
 
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdfAdversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
Po-Chuan Chen
 
Introduction to AI for Nonprofits with Tapp Network
Introduction to AI for Nonprofits with Tapp NetworkIntroduction to AI for Nonprofits with Tapp Network
Introduction to AI for Nonprofits with Tapp Network
TechSoup
 
The Accursed House by Émile Gaboriau.pptx
The Accursed House by Émile Gaboriau.pptxThe Accursed House by Émile Gaboriau.pptx
The Accursed House by Émile Gaboriau.pptx
DhatriParmar
 
The approach at University of Liverpool.pptx
The approach at University of Liverpool.pptxThe approach at University of Liverpool.pptx
The approach at University of Liverpool.pptx
Jisc
 

Recently uploaded (20)

678020731-Sumas-y-Restas-Para-Colorear.pdf
678020731-Sumas-y-Restas-Para-Colorear.pdf678020731-Sumas-y-Restas-Para-Colorear.pdf
678020731-Sumas-y-Restas-Para-Colorear.pdf
 
Phrasal Verbs.XXXXXXXXXXXXXXXXXXXXXXXXXX
Phrasal Verbs.XXXXXXXXXXXXXXXXXXXXXXXXXXPhrasal Verbs.XXXXXXXXXXXXXXXXXXXXXXXXXX
Phrasal Verbs.XXXXXXXXXXXXXXXXXXXXXXXXXX
 
1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx
 
The Challenger.pdf DNHS Official Publication
The Challenger.pdf DNHS Official PublicationThe Challenger.pdf DNHS Official Publication
The Challenger.pdf DNHS Official Publication
 
How to Make a Field invisible in Odoo 17
How to Make a Field invisible in Odoo 17How to Make a Field invisible in Odoo 17
How to Make a Field invisible in Odoo 17
 
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptxChapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptx
 
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
 
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.pptThesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
 
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and ResearchDigital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
 
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...
 
A Strategic Approach: GenAI in Education
A Strategic Approach: GenAI in EducationA Strategic Approach: GenAI in Education
A Strategic Approach: GenAI in Education
 
Guidance_and_Counselling.pdf B.Ed. 4th Semester
Guidance_and_Counselling.pdf B.Ed. 4th SemesterGuidance_and_Counselling.pdf B.Ed. 4th Semester
Guidance_and_Counselling.pdf B.Ed. 4th Semester
 
Lapbook sobre os Regimes Totalitários.pdf
Lapbook sobre os Regimes Totalitários.pdfLapbook sobre os Regimes Totalitários.pdf
Lapbook sobre os Regimes Totalitários.pdf
 
Francesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk - How can education support child empowerment.pptxFrancesca Gottschalk - How can education support child empowerment.pptx
Francesca Gottschalk - How can education support child empowerment.pptx
 
Language Across the Curriculm LAC B.Ed.
Language Across the  Curriculm LAC B.Ed.Language Across the  Curriculm LAC B.Ed.
Language Across the Curriculm LAC B.Ed.
 
Honest Reviews of Tim Han LMA Course Program.pptx
Honest Reviews of Tim Han LMA Course Program.pptxHonest Reviews of Tim Han LMA Course Program.pptx
Honest Reviews of Tim Han LMA Course Program.pptx
 
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdfAdversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
 
Introduction to AI for Nonprofits with Tapp Network
Introduction to AI for Nonprofits with Tapp NetworkIntroduction to AI for Nonprofits with Tapp Network
Introduction to AI for Nonprofits with Tapp Network
 
The Accursed House by Émile Gaboriau.pptx
The Accursed House by Émile Gaboriau.pptxThe Accursed House by Émile Gaboriau.pptx
The Accursed House by Émile Gaboriau.pptx
 
The approach at University of Liverpool.pptx
The approach at University of Liverpool.pptxThe approach at University of Liverpool.pptx
The approach at University of Liverpool.pptx
 

4b internet protocol

  • 2. 20.2 INTERNETWORKINGINTERNETWORKING We now discuss internetworking _ connectingWe now discuss internetworking _ connecting networks together to make an internetwork or annetworks together to make an internetwork or an internet.internet.
  • 4. 20.4 Network layer in an internetwork
  • 5. 20.5 Network layer at the source, router, and destination
  • 6. 20.6 Switching at the network layer in the Internet uses the datagram approach to packet switching. In a datagram network, each packet is treated independently of others, even if it is a part of a multipacket transmission. Packets in this approach are normally referred to as datagrams. Note
  • 7. 20.7 Communication at the network layer in the Internet is connectionless. The reason for this is due to the heterogeneous nature of the Internet. Note
  • 8. 20.8 IPv4IPv4 • The Internet Protocol version 4 (The Internet Protocol version 4 (IPv4IPv4) is the) is the delivery mechanism used by the TCP/IP protocols.delivery mechanism used by the TCP/IP protocols. • It is an unreliable – aIt is an unreliable – a best-effort deliverybest-effort delivery service.service. • If reliability is important, then it must be pairedIf reliability is important, then it must be paired withwith TCP.TCP.
  • 9. 20.9 Position of IPv4 in TCP/IP protocol suite
  • 11. 20.11 Service type or differentiated services
  • 12. 20.12 • Differentiated Services or DiffServ is a computer networking architecture that specifies a simple, scalable and coarse-grained mechanism for classifying, managing network traffic and providing Quality of Service (QoS) guarantees on modern IP networks. • DiffServ can, for example, be used to provide low- latency, low-loss service to critical network traffic such as voice or video while providing simple best-effort traffic guarantees to non-critical services such as web traffic or file transfers. • DiffServ uses the 6-bit Differentiated Services Code Point (DSCP) field in the header of IP packets for packet classification purposes.
  • 13. 20.13 • In theory, a network could have up to 64 (i.e. 26 ) different traffic classes using different markings in the DSCP. The DiffServ RFCs recommend, but do not require, certain encodings. • This gives a network operator great flexibility in defining traffic classes. In practice, however, most networks use the following commonly-defined Per-Hop Behaviors: –Default PHB—which is typically best-effort traffic –Assured Forwarding (AF) PHB— which gives assurance of delivery under conditions –Expedited Forwarding (EF) PHB—dedicated to low-loss, low-latency traffic
  • 14. 20.14 The total length field defines the total length of the datagram including the header. Required such that can differentiate from the padding. Note What is this ?
  • 15. 20.15 Encapsulation of a small datagram in an Ethernet frame
  • 16. 20.16 • Time to live (TTL) (8 bits) - Limits the number of routers the datagram can pass through. Usually set to 32 or 64 (some even recommend 128). Every time the datagram passes through a router this value is decremented by a value of one or more. This is to keep the datagram from circulating in an infinite loop forever. • Protocol (8 bits) - It identifies the protocol whose data is encapsulated in the datagram. • Source & Destination IP Address – Self- explanatory.
  • 17. 20.17 Protocol field and encapsulated data
  • 18. 20.18 An IPv4 packet has arrived with the first 8 bits as shown: 01000010 The receiver discards the packet. Why? Solution There is an error in this packet. The 4 leftmost bits (0100) show the version, which is correct. The next 4 bits (0010) show an invalid header length (2 × 4 = 8). The minimum number of bytes in the header must be 20. The packet has been corrupted in transmission. Example 1
  • 19. 20.19 In an IPv4 packet, the value of HLEN is 1000 in binary. How many bytes of options are being carried by this packet? Solution The HLEN value is 8, which means the total number of bytes in the header is 8 × 4, or 32 bytes. The first 20 bytes are the base header, the next 12 bytes are the options. Example 2
  • 20. 20.20 In an IPv4 packet, the value of HLEN is 5, and the value of the total length field is 0x0028. How many bytes of data are being carried by this packet? Solution The HLEN value is 5, which means the total number of bytes in the header is 5 × 4, or 20 bytes (no options). The total length is 40 bytes, which means the packet is carrying 20 bytes of data (40 20).− Example 3
  • 21. 20.21 An IPv4 packet has arrived with the first few hexadecimal digits as shown. 0x45000028000100000102 . . . How many hops can this packet travel before being dropped? The data belong to what upper-layer protocol? Solution To find the time-to-live field, we skip 8 bytes. The time-to- live field is the ninth byte, which is 01. This means the packet can travel only one hop. The protocol field is the next byte (02), which means that the upper-layer protocol is IGMP. Example 4
  • 22. 20.22 Maximum Transmission Unit (MTU) • IP packets larger than the MTU must go through IP fragmentation procedures. MTUs for some networks
  • 23. 20.23 • Fragmentation related fields: •Identification - Uniquely identifies each datagram. This is used to re-assemble the datagram. Each fragment of the datagram contains this same unique number. • Flags: — Bit 0 - reserved. — Bit 1 - The do not fragment bit. A value of 1 means the packet should not be fragmented while a 0 means it may be fragmented. — Bit 2 - The more fragment bit. This value is set on all fragments except the last one since a value of 0 means this is the last fragment. • Fragment offset - The offset in 8 byte units of this fragment from the beginning of the original datagram (8191 x 8 = 65528).
  • 24. 20.24 Fragmentation example Note. Fragmentation offsets are calculated from the data lengths and not the total lengths of the packet
  • 26. 20.26 A packet has arrived with an M bit value of 0. Is this the first fragment, the last fragment, or a middle fragment? Do we know if the packet was fragmented? Solution If the M bit is 0, it means that there are no more fragments; the fragment is the last one. However, we cannot say if the original packet was fragmented or not. A non-fragmented packet is considered the last fragment. Example 5
  • 27. 20.27 A packet has arrived with an M bit value of 1. Is this the first fragment, the last fragment, or a middle fragment? Do we know if the packet was fragmented? Solution If the M bit is 1, it means that there is at least one more fragment. This fragment can be the first one or a middle one, but not the last one. We don’t know if it is the first one or a middle one; we need more information (the value of the fragmentation offset). Example 6
  • 28. 20.28 A packet has arrived with an M bit value of 1 and a fragmentation offset value of 0. Is this the first fragment, the last fragment, or a middle fragment? Solution Because the M bit is 1, it is either the first fragment or a middle one. Because the offset value is 0, it is the first fragment. Example 7
  • 29. 20.29 A packet has arrived in which the offset value is 100. What is the number of the first byte? Do we know the number of the last byte? Solution To find the number of the first byte, we multiply the offset value by 8. This means that the first byte number is 800. We cannot determine the number of the last byte unless we know the length. Example 8
  • 30. 20.30 A packet has arrived in which the offset value is 100, the value of HLEN is 5, and the value of the total length field is 100. What are the numbers of the first byte and the last byte? Solution The first byte number is 100 × 8 = 800. The total length is 100 bytes, and the header length is 20 bytes (5 × 4), which means that there are 80 bytes in this datagram. If the first byte number is 800, the last byte number must be 879. Example 9
  • 31. 20.31 Figure shows an example of a checksum calculation for an IPv4 header without options. The header is divided into 16-bit sections. All the sections are added and the sum is complemented. The result is inserted in the checksum field. Example 10
  • 32. 20.32 Example of checksum calculation in IPv4
  • 34. 20.34
  • 35. 20.35