Sciweavers

Share
CAL
2008

Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks

11 years 1 months ago
Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks
Abstract-- This letter presents a new oblivious routing algorithm for 3D mesh networks called Randomized PartiallyMinimal (RPM) routing that provably achieves optimal worstcase throughput for 3D meshes when the network radix k is even and within a factor of 1/k2 of optimal when k is odd. Although this optimality result has been achieved with the minimal routing algorithm O1TURN [9] for the 2D case, the worst-case throughput of O1TURN degrades tremendously in higher dimensions. Other existing routing algorithms suffer from either poor worst-case throughput (DOR [10], ROMM [8]) or poor latency (VAL [14]). RPM on the other hand achieves near optimal worst-case and good average-case throughput as well as good latency performance.
Rohit Sunkam Ramanujam, Bill Lin
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CAL
Authors Rohit Sunkam Ramanujam, Bill Lin
Comments (0)
books