Using Barrier Graphs for Deadlock Prevention in Communication Networks

Based on the theoretical framework given by Gunther [1], this paper provides a method which permits designing deadlock-free communication networks with a tradeoff between routing constraints and the number of resource classes. This tradeoff may be adapted for specific network requirements like availability, throughput, and cost. The graph-theoretical basis of this "barrier graph" approach allows easy implementation and has low execution time overhead.