By Topic

An Oblivious Routing Algorithm for 3D Mesh Networks to Achieve a New Worst-Case Throughput Bound

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Guang Sun ; Tsinghua Univ., Beijing, China ; Chia-Wei Chang ; Bill Lin ; Lieguang Zeng

1/2 network capacity is often believed to be the limit of worst-case throughput for three-dimension (3D) mesh networks. However, this paper provides a new worst-case throughput bound, which is higher than 1/2 network capacity, for odd radix 3D mesh networks. In addition, we propose a routing algorithm called uniform solo-minimal (USM) routing that can achieve this new worst-case throughput bound in odd radix mesh networks. For the even radix case, we prove that USM achieves the optimal worst-case throughput, namely, half of network capacity. USM considers all routing paths with at most one dimensional minimal-distance routing and distributes the traffic loads uniformly to other two left dimensions. Theoretical analysis and simulation results show that USM outperforms existing routing algorithms in worst-case throughput. Moreover, USM achieves good average-throughput and performs very well under different traffic matrices at the expense of (5/3)× minimal average hop count.

Published in:

Embedded Systems Letters, IEEE  (Volume:4 ,  Issue: 4 )