Most IP datagram reassembly algorithms have a timer to avoid having a lost fragment tie up reassembly buffers forever. Suppose that a datagram is fragmented into four fragments. The first three fragments arrive, but the last one is delayed. Eventually, the timer goes off and the three fragments in the receiver's memory are discarded. A little later, the last fragment stumbles in. What should be done with it?

Most IP datagram reassembly algorithms have a timer to avoid having a lost fragment tie up reassembly buffers forever. Suppose that a datagram is fragmented into four fragments. The first three fragments arrive, but the last one is delayed. Eventually, the timer goes off and the three fragments in the receiver's memory are discarded. A little later, the last fragment stumbles in. What should be done with it?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider a TCP connection betweek two hosts between A and B. The first data byte sent by A is numbered 1. The LastByteRcvd at B is 500. Then, the range of values SendBase at A may take is from to 500
Suppose you have following two bytes data (although UDP uses a 16-bit word but we use 8-bit here for the sake of simplicity) Byte1: 00110100 Byte2: 01101001 Compute the checksum (this checksum is sent by the sender in UDP header) In flight (over the network), least significant bit is corrupted to 1 for Byte1, and least significant bit is corrupted to 0 for Byte2. With this data, what checksum will be computed at the receiver side If UDP receiver computes the Internet checksum for the received UDP segment and finds that it matches the value carried in the checksum field, can the receiver be absolutely certain that no bit error have occurred? Explain.
Network & Data Communcations
SInternet Check sum Consider the figure below (simplex communication scenario). The TCP sender sends an initial window of 4 segments. Suppose the initial value of the sender ན༽)། sequence number, SEQ1, is 100 and the first 4 segments each contain 400 bytes of payload. As you can see ACK 3 is lost. What is the SEQ number (SEQ2, SEQ3, SEQ4, SEQ5) from the Sender and ACK Number (ACK1, ACK2, ACK3, ACK4, ACK5) from the receiver for each segment? Sender Seq1 Seq2 Seq3 Seg4 ACK1 ACK2 ACK3 ACK4 Seq5 ACK5 Receiver
With persistent communication, a receiver generally has its own local buffer where messages can be stored when the receiver is not executing. To create such a buffer, we may need to specify its size. Give an argument why this is preferable, as well as one against specification of the size.
If there is wide variation in the TCP segment size , it is natural to organize the buffers as a pool of fixed-sized buffers, with one segment per buffer TRUE OR FALSE
Consider a simple application-level protocol built on top of UDP that allows a client to retrieve a file from a remote server residing at a well-known address. The client first sends a request with file name, and the server responds with a sequence of data packets containing different parts of the requested file. To ensure reliability and sequenced delivery, client and server use a stop-and-wait protocol. Ignoring the obvious performance issue, do you see a problem with this protocol? Think carefully about the possibility of processes crashing.
7.1 In IEEE 802.11, open system authentication is accomplished via a simple two-way communication. The client requests authentication, which includes the station ID, which is provided by the server (typically the MAC address). A successful or unsuccessful authentication response from the AP/router is received in response to the previous request from the client. For instance, if the client's MAC address has been expressly omitted from the AP/router setup, a failure may occur.a. What are the advantages of using this kind of authentication scheme?b. What are the security flaws in this authentication method and how may they be mitigated?
This question concerns block cipher padding. Suppose the block cipher has a block size of 16 bytes. A certain message ends with a block which is 16 bytes. We must reversibly pad out the message to use some block cipher modes, such as CBC (even if the last block is full, which it is in this case). Consider the following padding strategy. Append a single byte with value 128, and then as many zero bytes as required to make the overall length a multiple of 16. Suppose the final (possibly partial) block of the message is "Ox000102030405060708090a0b0c hехad mal. Write out the complete hal block in hexadecimal. Please do not put a leading Ox as this has been written already. Because the last block is actually full, the block you add will need to be a completely new block. Ох
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?
h. The technique of temporarily delaying outgoing acknowledgements so that they can be hooked onto the next outgoing data frame is called
With persistent communication, a receiver generally has its own local buffer where messages can be stored when the receiver is not executing. To create such a buffer, we may need to specify its size. Give an argument why this is preferable, as well as one against specification of the size.