Paper Info
Title
Optimal routing and scheduling of complemental flows in converged networks
Abstract
Converged networks support applications with completely different (real-time) requirements. The communication paradigms offered in converged networks are predominantly treated as separate entities from the perspective of traffic engineering, e.g., time-triggered traffic for closed-loop control systems, shaped traffic for multimedia-streaming applications, and best-effort traffic for non-time-critical IT applications. However, there are scenarios where applications benefit from considering time-triggered messages and non-time-triggered messages as complemental components of a single traffic flow. These applications have the property that time-triggered transmissions guarantee basic functionality (e.g., stability of a control system), and additional non-time-triggered transmissions improve the application's performance. We present how to model these so-called complemental traffic flows for this type of application using a traffic metric for the description of the non-time-triggered traffic part. Furthermore, we show that complemental flows are suitable for traffic engineering by presenting two different approaches for the problem of optimized joint routing and scheduling in converged networks with mixed integer linear programming. In our evaluations, we use an exemplary min-max objective for the joint routing and scheduling problem which yields an average reduction of the peak value of the traffic metric by 20-30% over constraint-based approaches.
Year
DOI
Venue
2019
10.1145/3356401.3356415
Proceedings of the 27th International Conference on Real-Time Networks and Systems
Field
DocType
ISBN
Computer science,Scheduling (computing),Distributed computing
Conference
978-1-4503-7223-7
Citations 
PageRank 
References 
2
0.37
0
Authors
6
Name
Order
Citations
PageRank
Jonathan Falk1132.11
Frank Dürr250043.83
Steffen Linsenmayer320.37
Stefan Wildhagen431.40
Ben Carabelli520.37
Kurt Rothermel62806450.84