Deterministic routing with bounded buffers: turning offline into online protocols

DOI10.1007/S004930170007zbMATH Open1107.68529OpenAlexW2159070578MaRDI QIDQ873651FDOQ873651

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

buffersroutingmultibutterfly network

Mathematics Subject Classification ID

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

Cited In (4)

• Title not available (Why is that?)
• The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels
• The network as a storage device: dynamic routing with bounded buffers
• The complexity of shortest path and dilation bounded interval routing

   Recommendations

• Title not available (Why is that?) 👍 👎
• Simple Algorithms for Routing on Butterfly Networks with Bounded Queues 👍 👎
• An O (log N ) deterministic packet-routing scheme 👍 👎
• Deterministic Permutation Routing on Meshes 👍 👎
• Routing with bounded buffers and hot-potato routing in vertex-symmetric networks 👍 👎

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

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