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?
