Skip to Main Content
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.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.