A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Oblivious routing design for mesh networks to achieve a new worst-case throughput bound
2012
2012 IEEE 30th International Conference on Computer Design (ICCD)
1/2 network capacity is often believed to be the limit of worst-case throughput for mesh networks. However, this paper provides a new worst-case throughput bound, which is higher than 1/2 network capacity, for odd radix two-dimensional mesh networks. In addition, we propose a routing algorithm called U2TURN that can achieve this worstcase throughput bound for odd radix meshes. For even radix meshes, we prove that U2TURN achieves the optimal worst-case throughput, namely, half of network
doi:10.1109/iccd.2012.6378674
dblp:conf/iccd/SunCLZ12
fatcat:cljv6w3wzbcafavatm4wzn4fbe