Prevention of Store-and-Forward Deadlock in Computer Networks

Much previous work has been done on the prevention of store-and-forward deadlock in computer networks using buffer reservation. The emphasis has been on reducing the number of reserved buffers necessary in each node. In this paper, we propose a scheme that, for most networks, will guarantee deadlock freedom for any arbitrary routing with a third fewer reserved buffers than the best previously proposed scheme.