On Achieving the Shortest-Path Routing in 2-D Meshes

11 years 20 days ago
On Achieving the Shortest-Path Routing in 2-D Meshes
In this paper, we present a fully distributed process to collect and distribute the minimal connected component (MCC) fault information so that the shortest-path between a source and its destination can always be found in the corresponding information-based routing via routing decisions made at each intermediate node. Considering the communication cost in the above information distribution, a more practical implementation is provided with a low number of nodes involved in the information propagation. The experimental results show substantial improvement of our approach in terms of the success rate in finding the shortest-path and the average path length.
Zhen Jiang, Jie Wu
Added 03 Jun 2010
Updated 03 Jun 2010
Type Conference
Year 2007
Where IPPS
Authors Zhen Jiang, Jie Wu
Comments (0)