Deterministic routing with bounded buffers: turning offline into online protocols

DOI10.1007/S004930170007zbMath1107.68529OpenAlexW2159070578MaRDI QIDQ873651

Christian Scheideler, Friedhelm Meyer auf der Heide

Publication date: 29 March 2007

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

routingbuffersmultibutterfly network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Related Items (1)

The complexity of shortest path and dilation bounded interval routing

This page was built for publication: Deterministic routing with bounded buffers: turning offline into online protocols