An optimal shortest-path routing policy for network computers with regular mesh-connected topologies

DOI10.1109/12.35831zbMath1395.68023OpenAlexW2105643862MaRDI QIDQ5375492

Sunil Podar, Hussein Badr

Publication date: 14 September 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.35831

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (4)

Greedy hot-potato routing on the two-dimensional mesh ⋮ Optimal routing in toroidal networks ⋮ Analysis of minimal path routing schemes in the presence of faults ⋮ There is no optimal routing policy for the torus.

This page was built for publication: An optimal shortest-path routing policy for network computers with regular mesh-connected topologies