Time-Stamp Approach to Prevention of Different Deadlock Types in Store-and-Forward Networks

Instytut Automatyki, Technical Univ. of Poznań, Poznań, Poland
IEEE Transactions on Communications (Impact Factor: 1.75). 06/1987; DOI: 10.1109/TCOM.1987.1096798
Source: IEEE Xplore

ABSTRACT This correspondence is concerned with the prevention of four types of deadlock in store-and-forward networks, i.e., progeny, copy-release, reassembly, and resequence deadlocks. The approach presented makes use of time stamping of all messages and generalizes the method of store-and-forward deadlock prevention.

  • [Show abstract] [Hide abstract]
    ABSTRACT: The store-and-forward deadlock problem in packet switching networks is considered. Most of the previous work addressed this issue using reserved buffers, and most algorithms, with the exception of that given by J. Blazewicz et al. (1987) (the BBG algorithm), use more reserved buffers than necessary, implying that each node does not have the maximum flexibility in message routing. It is shown that the BBG deadlock prevention algorithm can generate an unbounded number of backtracked messages. A deadlock detection and resolution algorithm that allows a minimum number of buffers to be reserved and minimizes the number of backtracked messages at the end of each detection and resolution is presented. It is shown that in the worst case, only O (| E |) backtracked messages can be generated as a result of this algorithm, and that each backtracked message is backtracked only one hop
    INFOCOM '93. Proceedings.Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking: Foundation for the Future. IEEE; 02/1993