Optimal oblivious routing on \(d\)-dimensional meshes

DOI10.1016/j.tcs.2004.04.016zbMath1070.68150OpenAlexW2122562276MaRDI QIDQ1770370

Andre Osterloh

Publication date: 6 April 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.04.016

zbMATH Keywords

Parallel algorithm\(d\)-dimensional meshConstant buffer sizeOblivious routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Universal continuous routing strategies
• Packet routing in fixed-connection networks: A survey
• New Bounds for Oblivious Mesh Routing
• An O(N) Oblivious Routing Algorithm for Two-Dimensional Meshes of Constant Queue-Size
• Tight bounds for oblivious routing in the hypercube

This page was built for publication: Optimal oblivious routing on \(d\)-dimensional meshes