Routing with bounded buffers and hot-potato routing in vertex-symmetric networks

DOI10.1007/3-540-60313-1_154zbMath1512.68020OpenAlexW1526838153MaRDI QIDQ6102312

Friedhelm Meyer auf der Heide, Christian Scheideler

Publication date: 8 May 2023

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

Full work available at URL: https://doi.org/10.1007/3-540-60313-1_154

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to emulate shared memory
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
• Deflection routing in hypercube networks
• An O (log N ) deterministic packet-routing scheme
• Randomized Routing and Sorting on Fixed-Connection Networks
• A packet routing protocol for arbitrary networks