Explain the structural, functional, and logical properties of the fragmentation and reassembly modules in detail. A pseudocode and an example must be included in your explanation. To demonstrate, consider the following example: A datagram with a data size of 4000 bytes is fragmented into three pieces (assuming the highest allowable MTU size for this purpose is 1400 bytes) and transferred at the data link layer using Ethernet as the protocol.

Explain the structural, functional, and logical properties of the fragmentation and reassembly modules in detail. A pseudocode and an example must be included in your explanation. To demonstrate, consider the following example: A datagram with a data size of 4000 bytes is fragmented into three pieces (assuming the highest allowable MTU size for this purpose is 1400 bytes) and transferred at the data link layer using Ethernet as the protocol.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter9: Computer Networks

Section: Chapter Questions

Problem 3VE

See similar textbooks

Similar questions

Explain clearly the structural, functional, and logical characteristics of the fragmentation and reassembly modules. Your explanation must include a pseudocode and an example. Use the following example to explain: a datagram with a data size of 4000 bytes is fragmented into 3 fragments (assume the maximum available MTU size for this purpose is 1400 bytes) and transmitted using the Ethernet as the protocol at the data link layer.
For the following two (2) questions, assume that the link layer uses the flag bits with bit stuffing approach for framing, with the following details: The beginning and end of a data frame are indicated by the special flag bits 01111110 (i.e., 0x7E). To handle accidental occurrence of the flag bits within the data, a 0 bit is stuffed every time 5 consecutive 1s are found in the data. For simplicity, assume that no other header/trailer information is added to the data. 1. The following bit stream represents data that needs to be framed by the link layer on the sender’s side. Derive the resultant bit stream by adding necessary flag bits and performing bits stuffing. 0111110001010011111111100101111111111110 2. The following bit stream represents data received by the link layer of a computer. For simplicity, assume that there are no errors in the bit stream. Retrieve the original data from this received bit stream. 01111110010111101111101100101001111101101111110
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?
Problem 1- IP Fragmentation Consider sending a 3500-byte datagram into a link that has an MTU of 1000 bytes. How many fragments are generated? What are their characteristics (i.e. what are the flags and offset values for each and start and ending of data bytes of each fragment (Assume that the DF flag was not set : )Solution: Assume that no optional fields of the IP header are in use (i.e. IP header is 20 bytes)
Q: What is principal of locality, for example if Level-1 can be accessed in 0.1 microseconds and Level-2 in 1 microsecond how we can access 1000 bytes in short time.
How does Protocol Buffers (protobuf) differ from traditional object serialization methods, and what are its advantages in terms of performance and efficiency?
Describe a cache protocol in a few sentences.
Give a brief summary of one of the cache-related protocols.
Explain why collision is an issue in a random-access protocol but not in reservation or channel partitioning protocols.
Consider a system with 36-bit addresses that employs both segmentation and paging. Assume each PTE and STE is 4-bytes in size Assume the largest possible segment table is 213 bytes and the largest possible page table is 216 bytes. How large is a page? How large in bytes is the largest possible segment? please explain and don't paste the quizlet picture
The hardware components of a symmetric block cypher may be summarised as follows: The two major varieties of it act in different ways; what are the distinctions between them?
A paging scheme uses a Translation Look-aside Buffer (TLB). A TLB-access takes 10 ns and a main memory access takes 50 ns. The effective access time(in ns) is_?(if the TLB hit ratio is 90% and there is no page-fault)