Message Reassembly Times in a Packet Network

This paper addresses the problem of computing the reassembly time of a multipacket message. All packets from a single message are assumed to flow in sequence along the same physical path. The analysis includes the effects of contention between messages in the network on the delay time at each station along the path and its impact on message reassembly time.