Routing on asynchronous processor networks

DOI10.1007/BFB0002741MaRDI QIDQ4536936zbMATH OpenFDO

Authors Efstratios Karaivazoglou, Friedhelm Meyer auf der Heide

Publication date 25 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0002741

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies and applications (68U99)

Recommendations

• A packet routing protocol for arbitrary networks
• An optimal time bound for oblivious routing
• Packet Routing on grids of processors
• scientific article; zbMATH DE number 1173684
• scientific article; zbMATH DE number 1305398

Cited in

(3)

• Asynchronous throughput-optimal routing in malicious networks
• Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times
• Asynchronous Networks

This page was built for publication: Routing on asynchronous processor networks

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