SlideShare una empresa de Scribd logo
1 de 61
Chapter 8 Internet Protocol (IP)
CONTENTS ,[object Object],[object Object],[object Object],[object Object],[object Object]
Figure  8-1 Position of IP in TCP/IP protocol suite
DATAGRAM 8.1
Figure  8-2 IP datagram
Figure  8-3 Service Type or Differentiated Services
The precedence subfield is  not used in version 4.
The total length field defines the total length of the  datagram including the header.
Figure  8-4 Encapsulation of a small datagram  in an Ethernet frame
Figure  8-5 Multiplexing
Example 1 An IP 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 left-most bits ( 0100 ) show the version, which is correct. The next 4 bits ( 0010 ) show the header length, which means (2    4    8), which is wrong. The minimum number of bytes in the header must be 20. The packet has been corrupted in transmission.
Example 2 In an IP 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 main header, the next 12 bytes are the options.
Example 3 In an IP packet, the value of HLEN is 5 16  and the value of the total length field is 0028 16 . 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 4 An IP packet has arrived with the first few hexadecimal digits as shown below:     45000028000100000102................... 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 should skip 8 bytes (16 hexadecimal digits). 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.
FRAGMENTATION 8.2
Figure  8-6 MTU
Figure  8-7 Flag field
Figure  8-8 Fragmentation example
Figure  8-9 Detailed  example
Example 5 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 nonfragmented packet is considered the last fragment.
Example 6 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). However, we can definitely say the original packet has been fragmented because the  M  bit value is 1.
Example 7 A packet has arrived with an  M  bit value of 1 and a fragmentation offset value of zero. 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 8 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 of the data.
Example 9 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 is the number 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 879.
OPTIONS 8.3
Figure  8-10 Option format
Figure  8-11 Categories of options
Figure  8-12 No operation  option
Figure  8-13 End of option  option
Figure  8-14 Record route  option
Figure  8-15 Record route  concept
Figure  8-16 Strict source route  option
Figure  8-17 Strict source route  concept
Figure  8-18 Loose source route  option
Figure  8-19 Timestamp  option
Figure  8-20 Use of flag in timestamp
Figure  8-21 Timestamp concept
Example 10 Which of the six options must be copied to each fragment?
Solution We look at the first (left-most) bit of the code for each option. No operation : Code is  0 0000001; no copy. End of option : Code is  0 0000000; no copy. Record route : Code is  0 0000111; no copy. Strict source route : Code is  1 0001001; copied. Loose source route : Code is  1 0000011; copied. Timestamp : Code is  0 1000100; no copy.
Example 11 Which of the six options are used for datagram control and which are used for debugging and management?
Solution We look at the second and third (left-most) bits of the code. No operation : Code is 0 00 00001; control. End of option : Code is 0 00 00000; control. Record route : Code is 0 00 00111; control. Strict source route : Code is 1 00 01001; control. Loose source route : Code is 1 00 00011; control. Timestamp:  Code is 0 10 00100; debugging
CHECKSUM 8.4
[object Object],[object Object],[object Object],[object Object]
Figure  8-22 Checksum concept
Figure  8-23 Checksum in one’s complement arithmetic
Figure  8-24 Example of  checksum  calculation in binary
Figure  8-25 Example of  checksum  calculation in  hexadecimal
Check Appendix C for a detailed  description of checksum calculation  and the handling of carries.
IP PACKAGE 8.5
Figure  8-26 IP components
Figure  8-27 MTU table
Figure  8-28 Reassembly table

Más contenido relacionado

La actualidad más candente

C programming session 05
C programming session 05C programming session 05
C programming session 05
Dushmanta Nath
 

La actualidad más candente (17)

Ch19
Ch19Ch19
Ch19
 
Conditional Statements
Conditional StatementsConditional Statements
Conditional Statements
 
Lecture set 3
Lecture set 3Lecture set 3
Lecture set 3
 
Looping
LoopingLooping
Looping
 
Lesson 13. Pattern 5. Address arithmetic
Lesson 13. Pattern 5. Address arithmeticLesson 13. Pattern 5. Address arithmetic
Lesson 13. Pattern 5. Address arithmetic
 
Function
FunctionFunction
Function
 
Huffman Algorithm and its Application by Ekansh Agarwal
Huffman Algorithm and its Application by Ekansh AgarwalHuffman Algorithm and its Application by Ekansh Agarwal
Huffman Algorithm and its Application by Ekansh Agarwal
 
Arithmetic coding
Arithmetic codingArithmetic coding
Arithmetic coding
 
Chap 05
Chap 05Chap 05
Chap 05
 
Ip addressing classless
Ip addressing classlessIp addressing classless
Ip addressing classless
 
C programming session 05
C programming session 05C programming session 05
C programming session 05
 
Error Correction And Hamming Code Ibrar
Error Correction And Hamming Code IbrarError Correction And Hamming Code Ibrar
Error Correction And Hamming Code Ibrar
 
Chapter 20: Internet Protocol
Chapter 20: Internet ProtocolChapter 20: Internet Protocol
Chapter 20: Internet Protocol
 
Acm aleppo cpc training introduction 1
Acm aleppo cpc training introduction 1Acm aleppo cpc training introduction 1
Acm aleppo cpc training introduction 1
 
Programming in Python
Programming in Python Programming in Python
Programming in Python
 
Arithmetic Coding
Arithmetic CodingArithmetic Coding
Arithmetic Coding
 
Python programming language
Python programming languagePython programming language
Python programming language
 

Destacado (8)

Chapter4 Network
Chapter4 NetworkChapter4 Network
Chapter4 Network
 
Computer Networks Homework Help
Computer Networks Homework HelpComputer Networks Homework Help
Computer Networks Homework Help
 
GOOGLE CAR(autonomous car)
GOOGLE CAR(autonomous  car)GOOGLE CAR(autonomous  car)
GOOGLE CAR(autonomous car)
 
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
 
Tcp Udp Icmp And The Transport Layer
Tcp Udp Icmp And The Transport LayerTcp Udp Icmp And The Transport Layer
Tcp Udp Icmp And The Transport Layer
 
Multicast Routing Protocols
Multicast Routing ProtocolsMulticast Routing Protocols
Multicast Routing Protocols
 
Chapter4 l4
Chapter4 l4Chapter4 l4
Chapter4 l4
 
IP addressing by Mamun Sir
IP addressing by Mamun SirIP addressing by Mamun Sir
IP addressing by Mamun Sir
 

Similar a Ch08

4b internet protocol
4b internet protocol4b internet protocol
4b internet protocol
kavish dani
 
1606660774-ip-addresses-classful-3.ppt
1606660774-ip-addresses-classful-3.ppt1606660774-ip-addresses-classful-3.ppt
1606660774-ip-addresses-classful-3.ppt
PUSHPAKJAIN8
 
9-Lect_9-2.pptx DataLink Layer DataLink Layer
9-Lect_9-2.pptx DataLink Layer DataLink Layer9-Lect_9-2.pptx DataLink Layer DataLink Layer
9-Lect_9-2.pptx DataLink Layer DataLink Layer
ZahouAmel1
 
TCN  5080  -­‐‑  Project  1  Description  C.docx
TCN  5080  -­‐‑  Project  1  Description  C.docxTCN  5080  -­‐‑  Project  1  Description  C.docx
TCN  5080  -­‐‑  Project  1  Description  C.docx
ssuserf9c51d
 

Similar a Ch08 (20)

Chapter 20
Chapter 20Chapter 20
Chapter 20
 
Chap 08 ip
Chap 08 ipChap 08 ip
Chap 08 ip
 
4b internet protocol
4b internet protocol4b internet protocol
4b internet protocol
 
20 Network Layer_Internet_Protocol
20 Network Layer_Internet_Protocol20 Network Layer_Internet_Protocol
20 Network Layer_Internet_Protocol
 
Ch2020
Ch2020Ch2020
Ch2020
 
Lecture-05.pdf
Lecture-05.pdfLecture-05.pdf
Lecture-05.pdf
 
Modern Block Cipher- Modern Symmetric-Key Cipher
Modern Block Cipher- Modern Symmetric-Key CipherModern Block Cipher- Modern Symmetric-Key Cipher
Modern Block Cipher- Modern Symmetric-Key Cipher
 
Data Link Layer Numericals
Data Link Layer NumericalsData Link Layer Numericals
Data Link Layer Numericals
 
1606660774-ip-addresses-classful-3.ppt
1606660774-ip-addresses-classful-3.ppt1606660774-ip-addresses-classful-3.ppt
1606660774-ip-addresses-classful-3.ppt
 
An IP datagram has arrived with the following information in the heade.docx
An IP datagram has arrived with the following information in the heade.docxAn IP datagram has arrived with the following information in the heade.docx
An IP datagram has arrived with the following information in the heade.docx
 
9-Lect_9-2.pptx DataLink Layer DataLink Layer
9-Lect_9-2.pptx DataLink Layer DataLink Layer9-Lect_9-2.pptx DataLink Layer DataLink Layer
9-Lect_9-2.pptx DataLink Layer DataLink Layer
 
ip address
ip addressip address
ip address
 
06 wireshark ip-solution_july_22
06 wireshark ip-solution_july_2206 wireshark ip-solution_july_22
06 wireshark ip-solution_july_22
 
COMPUTER COMMUNICATION NETWORKS -IPv4
COMPUTER COMMUNICATION NETWORKS -IPv4COMPUTER COMMUNICATION NETWORKS -IPv4
COMPUTER COMMUNICATION NETWORKS -IPv4
 
I.p. protocol
I.p. protocolI.p. protocol
I.p. protocol
 
network fundamental
network fundamentalnetwork fundamental
network fundamental
 
Transport layer
Transport layer   Transport layer
Transport layer
 
TCN  5080  -­‐‑  Project  1  Description  C.docx
TCN  5080  -­‐‑  Project  1  Description  C.docxTCN  5080  -­‐‑  Project  1  Description  C.docx
TCN  5080  -­‐‑  Project  1  Description  C.docx
 
Transport layer udp and tcp network
Transport layer udp and tcp networkTransport layer udp and tcp network
Transport layer udp and tcp network
 
Wireshark udp solution
Wireshark udp solutionWireshark udp solution
Wireshark udp solution
 

Más de tejindershami (20)

Ch30
Ch30Ch30
Ch30
 
Ch29
Ch29Ch29
Ch29
 
Ch28
Ch28Ch28
Ch28
 
Ch27
Ch27Ch27
Ch27
 
Ch26
Ch26Ch26
Ch26
 
Ch25
Ch25Ch25
Ch25
 
Ch24
Ch24Ch24
Ch24
 
Ch23
Ch23Ch23
Ch23
 
Ch22
Ch22Ch22
Ch22
 
Ch21
Ch21Ch21
Ch21
 
Ch20
Ch20Ch20
Ch20
 
Ch19
Ch19Ch19
Ch19
 
Ch18
Ch18Ch18
Ch18
 
Ch17
Ch17Ch17
Ch17
 
Ch16
Ch16Ch16
Ch16
 
Ch15
Ch15Ch15
Ch15
 
Ch14
Ch14Ch14
Ch14
 
Ch13
Ch13Ch13
Ch13
 
Ch12
Ch12Ch12
Ch12
 
Ch11
Ch11Ch11
Ch11
 

Último

+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
?#DUbAI#??##{{(☎️+971_581248768%)**%*]'#abortion pills for sale in dubai@
 

Último (20)

Data Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt RobisonData Cloud, More than a CDP by Matt Robison
Data Cloud, More than a CDP by Matt Robison
 
Real Time Object Detection Using Open CV
Real Time Object Detection Using Open CVReal Time Object Detection Using Open CV
Real Time Object Detection Using Open CV
 
Apidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, Adobe
Apidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, AdobeApidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, Adobe
Apidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, Adobe
 
Strategies for Landing an Oracle DBA Job as a Fresher
Strategies for Landing an Oracle DBA Job as a FresherStrategies for Landing an Oracle DBA Job as a Fresher
Strategies for Landing an Oracle DBA Job as a Fresher
 
Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
Strategize a Smooth Tenant-to-tenant Migration and Copilot TakeoffStrategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
Strategize a Smooth Tenant-to-tenant Migration and Copilot Takeoff
 
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
Mastering MySQL Database Architecture: Deep Dive into MySQL Shell and MySQL R...
 
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
+971581248768>> SAFE AND ORIGINAL ABORTION PILLS FOR SALE IN DUBAI AND ABUDHA...
 
GenAI Risks & Security Meetup 01052024.pdf
GenAI Risks & Security Meetup 01052024.pdfGenAI Risks & Security Meetup 01052024.pdf
GenAI Risks & Security Meetup 01052024.pdf
 
Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024Axa Assurance Maroc - Insurer Innovation Award 2024
Axa Assurance Maroc - Insurer Innovation Award 2024
 
Partners Life - Insurer Innovation Award 2024
Partners Life - Insurer Innovation Award 2024Partners Life - Insurer Innovation Award 2024
Partners Life - Insurer Innovation Award 2024
 
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time AutomationFrom Event to Action: Accelerate Your Decision Making with Real-Time Automation
From Event to Action: Accelerate Your Decision Making with Real-Time Automation
 
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
Strategies for Unlocking Knowledge Management in Microsoft 365 in the Copilot...
 
Top 5 Benefits OF Using Muvi Live Paywall For Live Streams
Top 5 Benefits OF Using Muvi Live Paywall For Live StreamsTop 5 Benefits OF Using Muvi Live Paywall For Live Streams
Top 5 Benefits OF Using Muvi Live Paywall For Live Streams
 
Apidays New York 2024 - The Good, the Bad and the Governed by David O'Neill, ...
Apidays New York 2024 - The Good, the Bad and the Governed by David O'Neill, ...Apidays New York 2024 - The Good, the Bad and the Governed by David O'Neill, ...
Apidays New York 2024 - The Good, the Bad and the Governed by David O'Neill, ...
 
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...Workshop - Best of Both Worlds_ Combine  KG and Vector search for  enhanced R...
Workshop - Best of Both Worlds_ Combine KG and Vector search for enhanced R...
 
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemkeProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke
 
Connector Corner: Accelerate revenue generation using UiPath API-centric busi...
Connector Corner: Accelerate revenue generation using UiPath API-centric busi...Connector Corner: Accelerate revenue generation using UiPath API-centric busi...
Connector Corner: Accelerate revenue generation using UiPath API-centric busi...
 
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024
 
TrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments
TrustArc Webinar - Stay Ahead of US State Data Privacy Law DevelopmentsTrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments
TrustArc Webinar - Stay Ahead of US State Data Privacy Law Developments
 
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024
Bajaj Allianz Life Insurance Company - Insurer Innovation Award 2024
 

Ch08

  • 1. Chapter 8 Internet Protocol (IP)
  • 2.
  • 3. Figure 8-1 Position of IP in TCP/IP protocol suite
  • 5. Figure 8-2 IP datagram
  • 6. Figure 8-3 Service Type or Differentiated Services
  • 7. The precedence subfield is not used in version 4.
  • 8. The total length field defines the total length of the datagram including the header.
  • 9. Figure 8-4 Encapsulation of a small datagram in an Ethernet frame
  • 10. Figure 8-5 Multiplexing
  • 11. Example 1 An IP packet has arrived with the first 8 bits as shown:  01000010 The receiver discards the packet. Why?
  • 12. Solution There is an error in this packet. The 4 left-most bits ( 0100 ) show the version, which is correct. The next 4 bits ( 0010 ) show the header length, which means (2  4  8), which is wrong. The minimum number of bytes in the header must be 20. The packet has been corrupted in transmission.
  • 13. Example 2 In an IP packet, the value of HLEN is 1000 in binary. How many bytes of options are being carried by this packet?
  • 14. 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 main header, the next 12 bytes are the options.
  • 15. Example 3 In an IP packet, the value of HLEN is 5 16 and the value of the total length field is 0028 16 . How many bytes of data are being carried by this packet?
  • 16. 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).
  • 17. Example 4 An IP packet has arrived with the first few hexadecimal digits as shown below:  45000028000100000102................... How many hops can this packet travel before being dropped? The data belong to what upper layer protocol?
  • 18. Solution To find the time-to-live field, we should skip 8 bytes (16 hexadecimal digits). 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.
  • 20. Figure 8-6 MTU
  • 21. Figure 8-7 Flag field
  • 22. Figure 8-8 Fragmentation example
  • 23. Figure 8-9 Detailed example
  • 24. Example 5 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?
  • 25. 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 nonfragmented packet is considered the last fragment.
  • 26. Example 6 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?
  • 27. 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). However, we can definitely say the original packet has been fragmented because the M bit value is 1.
  • 28. Example 7 A packet has arrived with an M bit value of 1 and a fragmentation offset value of zero. Is this the first fragment, the last fragment, or a middle fragment?
  • 29. 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.
  • 30. Example 8 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?
  • 31. 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 of the data.
  • 32. Example 9 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 is the number of the first byte and the last byte?
  • 33. 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 879.
  • 35. Figure 8-10 Option format
  • 36. Figure 8-11 Categories of options
  • 37. Figure 8-12 No operation option
  • 38. Figure 8-13 End of option option
  • 39. Figure 8-14 Record route option
  • 40. Figure 8-15 Record route concept
  • 41. Figure 8-16 Strict source route option
  • 42. Figure 8-17 Strict source route concept
  • 43. Figure 8-18 Loose source route option
  • 44. Figure 8-19 Timestamp option
  • 45. Figure 8-20 Use of flag in timestamp
  • 46. Figure 8-21 Timestamp concept
  • 47. Example 10 Which of the six options must be copied to each fragment?
  • 48. Solution We look at the first (left-most) bit of the code for each option. No operation : Code is 0 0000001; no copy. End of option : Code is 0 0000000; no copy. Record route : Code is 0 0000111; no copy. Strict source route : Code is 1 0001001; copied. Loose source route : Code is 1 0000011; copied. Timestamp : Code is 0 1000100; no copy.
  • 49. Example 11 Which of the six options are used for datagram control and which are used for debugging and management?
  • 50. Solution We look at the second and third (left-most) bits of the code. No operation : Code is 0 00 00001; control. End of option : Code is 0 00 00000; control. Record route : Code is 0 00 00111; control. Strict source route : Code is 1 00 01001; control. Loose source route : Code is 1 00 00011; control. Timestamp: Code is 0 10 00100; debugging
  • 52.
  • 53. Figure 8-22 Checksum concept
  • 54. Figure 8-23 Checksum in one’s complement arithmetic
  • 55. Figure 8-24 Example of checksum calculation in binary
  • 56. Figure 8-25 Example of checksum calculation in hexadecimal
  • 57. Check Appendix C for a detailed description of checksum calculation and the handling of carries.
  • 59. Figure 8-26 IP components
  • 60. Figure 8-27 MTU table
  • 61. Figure 8-28 Reassembly table