How much can hardware help routing?

DOI10.1145/265910.265922MaRDI QIDQ4377594zbMATH OpenOpenAlexFDO

Authors Allan Borodin, Prabhakar Raghavan, Baruch Schieber, Eli Upfal

Publication date 17 February 1998

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/jacm/1997-44/

zbMATH Keywords

adaptive routingoblivious routing

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

Recommendations

• scientific article; zbMATH DE number 1173684
• Tight bounds for oblivious routing in the hypercube
• An optimal time bound for oblivious routing
• A Time-Randomness Trade-Off for Oblivious Routing

This page was built for publication: How much can hardware help routing?

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