Real-Time Message Routing and Scheduling

DOI10.1007/978-3-642-03685-9_17zbMath1255.68047OpenAlexW1489990451MaRDI QIDQ3638880

Britta Peis, Andreas Wiese, Ronald Koch

Publication date: 28 October 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15674

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Universal Packet Routing with Arbitrary Bandwidths and Transit Times ⋮ Approximation Algorithms for Generalized Path Scheduling ⋮ Bounding Residence Times for Atomic Dynamic Routings

This page was built for publication: Real-Time Message Routing and Scheduling