On-Line Algorithms for Path Selection in a Nonblocking Network

DOI10.1137/S0097539791221499zbMATH Open0852.68004MaRDI QIDQ4887019FDOQ4887019

Authors: Bruce M. Maggs, F. Thomson Leighton, Sanjeev Arora 

Publication date: 26 November 1996

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Recommendations

• Parallel algorithms for routing in nonblocking networks
• On-line routing of random calls in networks
• A fast parallel algorithm for routing in permutation networks
• Distributed and on-line routing on tori
• scientific article; zbMATH DE number 1305091

zbMATH Keywords

multibutterfly networknonblocking networkmulti-Beneš network

Mathematics Subject Classification ID

Distributed algorithms (68W15) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Cited In (8)

• OptORAMa: optimal oblivious RAM
• OptORAMa: Optimal oblivious RAM
• Real-time emulations of bounded-degree networks
• Parallel algorithms for routing in nonblocking networks
• Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
• A framework for solving VLSI graph layout problems
• Expander graphs and their applications
• Sorting Short Keys in Circuits of Size ${o(n \log n)}$

This page was built for publication: On-Line Algorithms for Path Selection in a Nonblocking Network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887019)