Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks

Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minimal amount of resources. We model a computer communication system by representing the underlying topology by a connected graph. Let G = (V, E) be an undirected connected graph and C be a cycle of edges in G, containing (not necessarily all

• Type: Journal
• Year: 2010
• Where: TPDS
• Authors: Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa
• Keywords: Connected Graph, Livelock-free Routing, TPDS 2010, Undirected Connected Graph