Scheme for Reversal Deadlock Avoidance in Store and Forward Networks
Original Publication Date: 1978-Apr-01
Included in the Prior Art Database: 2005-Feb-20
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 finite set of normal routes in which the messages travel free of store and forward deadlock. Each route consists of a finite sequence of nodes and communication channels from the source node to the destination node.