An implementation of F-Channels for possibly cyclic networks

The authors modify an earlier implementation of F-Channels that uses selective flooding such that the modified implementation works (unlike the earlier implementation) even if the underlying network is cyclic. To prevent the occurrence of deadlocks that may occur due to cycles in the underlying network, a timeout technique is applied at each switch node. Theorems that establish the correctness of the implementation are listed