Problem 9:6 Points (why?) Most IP datagram reassembly algorithms have a timer to avoid having a l...
Problem 9:6 Points (why?) 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 six fragments. The first and second fragments arrive, then the fifth and sixth ones arrive, but the third and fourth ones are delayed. Eventually, the timer goes off and the six fragments in the receiver's memory are discarded. A little later, the third and fourth fragments stumble in. What should be done with them?
Problem 9:6 Points (why?) 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 six fragments. The first and second fragments arrive, then the fifth and sixth ones arrive, but the third and fourth ones are delayed. Eventually, the timer goes off and the six fragments in the receiver's memory are discarded. A little later, the third and fourth fragments stumble in. What should be done with them?