Sciweavers

Share
APPROX
2009
Springer

Real-Time Message Routing and Scheduling

9 years 11 months ago
Real-Time Message Routing and Scheduling
Abstract. Exchanging messages between nodes of a network (e.g., embedded computers) is a fundamental issue in real-time systems involving critical routing and scheduling decisions. In order for messages to arrive on time, one has to determine a suitable (short) origin-destination path for each message and resolve conflicts between messages whose paths share a communication link of the network. We provide efficient routing strategies yielding origin-destination paths of bounded dilation and congestion. In particular, we can give good a priori guarantees on the time required to send a given set of messages which, under certain reasonable conditions, implies that all messages can be scheduled to reach their destination on time. Our algorithm uses a path-based LP-relaxation and iterative rounding. Finally, for message routing along a directed path (which is already NP-hard), we identify a natural class of instances for which a simple scheduling heuristic yields provably optimal solutions.
Ronald Koch, Britta Peis, Martin Skutella, Andreas
Added 16 Feb 2011
Updated 16 Feb 2011
Type Journal
Year 2009
Where APPROX
Authors Ronald Koch, Britta Peis, Martin Skutella, Andreas Wiese
Comments (0)
books