Real-Time Message Routing and Scheduling

DOI10.1007/978-3-642-03685-9_17MaRDI QIDQ3638880zbMATH OpenOpenAlexFDO

Authors Ronald Koch, Britta Peis, Andreas Wiese, Martin Skutella

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)

Recommendations

• Scheduling time-constrained communication in linear networks
• Minimum-delay schedules in layered networks
• OPTIMUM SCHEDULE PROBLEMS IN STORE AND FORWARD NETWORKS
• Policies for periodic packet routing
• Optimal scheduling with deadline constraints in tree networks

Cited in

(5)

• Bounding Residence Times for Atomic Dynamic Routings
• Universal packet routing with arbitrary bandwidths and transit times
• A combinatorial algorithm for message scheduling on controller area networks
• INTEGER FORMULATIONS FOR THE MESSAGE SCHEDULING PROBLEM ON CONTROLLER AREA NETWORKS
• Approximation Algorithms for Generalized Path Scheduling

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

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