Efficient deadlock-free routing

This paper deals with store-and-forward deadlocks in communication networks. The goal is to design deadlock-free routing schemes with small overhead in communication and space. Our main contribution is designing efficient protocols that are superior to existing ones in terms of their performance.