Method 0f Avoiding Reassembly Deadlock In Store-And-Forward Networks
Original Publication Date: 1979-Mar-01
Included in the Prior Art Database: 2005-Feb-20
Reassembly Deadlock: Suppose one is given a store-and-forward network with prescribed nodes prescribed bidirectional communication channels between some pairs of nodes, a prescribed finite set of buffers at each node, and a prescribed set of routes for the possible packets. Large messages are broken into several packets at the source node. Packets of a single message may arrive out of sequence at the destination node, for example, if different packets travel on different routes or if a packet is delayed by link retransmission after a link error. The packets of a given message are reassembled at the destination node before being turned over to the user. Reassembly Deadlock appears as follows: 1. All buffers at the destination node are occupied by partially reassembled messages. 2.