Consider the following diagram. A datagram of 4,020 bytes (20 bytes of IP header plus 4,000 bytes of IP payload) arrives at a router and must be forwarded to a link with an MTU of 1,500 bytes. The diagram shows three fragments. Show the sizes of the fragments (in bytes) along with the offset values associated with each fragment with a chart. Explain how it is done with your own words. fragmentation: in: one large datagram out: 3 smaller datagrams reassembly

Consider the following diagram. A datagram of 4,020 bytes (20 bytes of IP header plus 4,000 bytes of IP payload) arrives at a router and must be forwarded to a link with an MTU of 1,500 bytes. The diagram shows three fragments. Show the sizes of the fragments (in bytes) along with the offset values associated with each fragment with a chart. Explain how it is done with your own words. fragmentation: in: one large datagram out: 3 smaller datagrams reassembly

Principles of Information Security (MindTap Course List)

6th Edition

ISBN:9781337102063

Author:Michael E. Whitman, Herbert J. Mattord

Publisher:Michael E. Whitman, Herbert J. Mattord

Chapter6: Security Technology: Access Controls, Firewalls, And Vpns

Section: Chapter Questions

Problem 2RQ

See similar textbooks

Similar questions

b) Consider a scenario where fragmentation may take place in packet transfer. Discuss how such fragmentation may be reassembled at the destination. Now consider in such scenario, a datagram is fragmented into five fragments. The first four fragments arrive, but the last one is delayed. Eventually, the timer goes off and the four fragments in the receiver’s memory are discarded. A little later, the last fragment arrives. What should be done with it?
Network and Communication question. Consider sending a 4,000 byte datagram into a link which has an MTU of 550 bytes. Suppose the original datagram is stamped with the identification number 433. How many fragments are generated? Write down the value of Identification, Total length, Flag, Fragmentation offset fields of each fragment.
P14. Consider sending a 2400-byte datagram into a link that has an MTU of 700 bytes. Suppose the original datagram is stamped with the identification number 422. How many fragments are generated? What are the values in the various fields in the IP datagram(s) generated related to fragmentation?
P5. Consider a datagram network using 32-bit host addresses. Suppose a router has four links, numbered 0 through 3, and packets are to be forwarded to the link interfaces as follows: (refer to first image) a. Provide a forwarding table that has five entries, uses longest prefix matching, and forwards packets to the correct link interfaces. b. Describe how your forwarding table determines the appropriate link interface for datagrams with destination addresses: (refer to second image)
14.3. What is the header overhead in the IP protocol? 14.5. Because of fragmentation, an IP datagram can arrive in several pieces, not necessarily in the correct order. The IP entity at the receiving end system must accumulate these fragments until the original datagram is reconstituted. Consider that the IP entity creates a buffer for assembling the data field in the original datagram. As assembly proceeds, the buffer will contain blocks of data and “holes” between the data blocks. Describe an algorithm for reassembly based on this concept. For the algorithm in part (a), it is necessary to keep track of the holes. Describe a simple mechanism for doing this. 14.13. Provide the following parameter values for each of the network classes A, B, and C. Be sure to consider any special or reserved addresses in your calculations. Number of bits in network portion of address Number of bits in host portion of address Number of distinct networks allowed Number of distinct hosts per network…
A file of size 20 KiloBytes is transmitted to a destination over a 10 Megabit/s network link (1 Mega = 10^6, 1 Kilo = 10^3, 1 byte = 8 bits). The propagation delay to the destination is 40 milliseconds (1 milli = 10^−3). Assume the queueing delay encountered by packets of the file is negligible. What is the total delay (in milliseconds) for the file to get to its destination?
Provide short answers to the following: How do you determine whether an IP address is a multicast address?==solve What is the TTL field in the IP header used for?==solve What is the maximum length of options bytes that can be carried in an IPv4 header?==solve Why do we have to multiply the offset field of an IP datagram by eight to obtain the real offset for the first byte of the datagram?====need to solve this question
To begin, what is an IP address and how does it work? Is there a reason to use mnemonic addresses? How many domains can be represented in a 32-bit representation? Exists a limit to the size of a domain in terms of the number of computers it can hold?
Use again the network architecture provided in the figure above, were Rs, Rc and Ri for i = {1,2,3,4}, the transmission rates of the server link, client link and intermediate network links. Consider a message that is 60 · 106 bits long that is to be sent from client to server. Ignore propagation, queuing, and processing delays. c.How long does it take to move the file from source host to destination host when message segmentation is used and both path R1, R2 and path R3, R4 are used? How many packages should be routed from path R1, R2 and how many from path R3, R4 in order to maximize the use of the network? d.What is the end to end throughput if path R1, R2 is used, and what if path R3, R4 is used? What is the total throughput from client to server (if both paths are being used at the same time)?
Consider an Infrastructure BSS with an Access Point and two Mobile Stations, and let’s use AP, M1, and M2 to denote their MAC addresses. Both M1 and M2 are associated with the AP. Suppose M1 wants to send a data frame to M2. When this data frame is relayed by the AP, explain how the AP shall update the four address fields of the data frame.
Consider the following scenario in which host A is sending a file to host B over a TCP connection. Assuming that the sequence number of the first data byte sent by A is 0 and every segment always includes 1000 bytes of data, excluding the TCP header. At some point of time, bytes up to 6400 have been written into the sender’s buffer. Bytes up to 4999 have been sent out but the segment which contains bytes 2000~2999 has not arrived at host B yet. At the receiver’s side, all bytes up to 3999 have been received except for bytes 2000~2999. Bytes up to 499 have been read from the buffer by the application. Assume that the maximum size of the sender’s buffer is large enough. Consider the sliding window algorithm in TCP and answer the following questions. 1) What are the values for LastByteAcked, LastByteSent, and LastByteWritten? 2) What are the values for LastByteRead, NextByteExpected, and LastByteRcvd? 3) Assuming that the maximum size of the receiver’s buffer is 4000 byte, what would…
Data collision is caused when many senders access the same medium at the same time; which protocol(s) and at what layer(s) are available to handle this problem? Is a transfer without collisions guaranteed by using these protocols? In the event that this is not the case, what other possibilities exist for finding a solution to the issue?