Exploring Practical Limitations of Joint Routing and Scheduling for TSN with ILP

IEEE 802.1Q networks with extensions for time-sensitive networking aim to enable converged networks. Converged networks support hard-real time communication services in addition to the currently supported services classes. Real-time communication in these networks requires routes and schedules for the real-time transmissions. We present a formulation in the integer linear programming (ILP) framework which models the joint routing and scheduling problem for flows of periodic real-time transmissions in converged TSN networks. In the joint routing and scheduling problem, both routes and schedules for real-time transmissions are computed in one step, i.e. we do not schedule over predefined routes. We explore the practical limitations of this approach by evaluating the runtime of problem instances with widely varying parameters with a state-of-the-art ILP solver. The observed solver runtimes indicate the qualitative impact of the number of real-time flows, the size of the network, the transmission frequency of real-time transmissions, and the network topology.

[1]  Derek de Solla Price,et al.  A general theory of bibliometric and other cumulative advantage processes , 1976, J. Am. Soc. Inf. Sci..

[2]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[3]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[4]  Kang Lee,et al.  IEEE 1588 standard for a precision clock synchronization protocol for networked measurement and control systems , 2002, 2nd ISA/IEEE Sensors for Industry Conference,.

[5]  Virtual Bridged,et al.  IEEE Standards for Local and Metropolitan Area Networks: Specification for 802.3 Full Duplex Operation , 1997, IEEE Std 802.3x-1997 and IEEE Std 802.3y-1997 (Supplement to ISO/IEC 8802-3: 1996/ANSI/IEEE Std 802.3, 1996 Edition).

[6]  Thorsten Koch,et al.  Rapid mathematical programming , 2005 .

[7]  Wilfried Steiner,et al.  An Evaluation of SMT-Based Schedule Synthesis for Time-Triggered Multi-hop Networks , 2010, 2010 31st IEEE Real-Time Systems Symposium.

[8]  Wilfried Steiner.  Synthesis of Static Communication Schedules for Mixed-Criticality Systems , 2011, 2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops.

[9]  Tiago P. Peixoto,et al.  The graph-tool python library , 2014 .

[10]  Frank Dürr,et al.  Time-sensitive Software-defined Network (TSSDN) for Real-time Applications , 2016, RTNS.

[11]  Silviu S. Craciunas,et al.  Design optimisation of cyber-physical distributed systems using IEEE time-sensitive networks , 2016, IET Cyper-Phys. Syst.: Theory & Appl..

[12]  Frank Dürr,et al.  No-wait Packet Scheduling for IEEE Time-sensitive Networks (TSN) , 2016, RTNS.

[13]  Hans A. Hansson,et al.  Period-Aware Segmented Synthesis of Schedules for Multi-hop Time-Triggered Networks , 2016, 2016 IEEE 22nd International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA).

[14]  Matteo Fischetti,et al.  On handling indicator constraints in mixed integer programming , 2016, Comput. Optim. Appl..

[15]  Silviu S. Craciunas,et al.  Scheduling Real-Time Communication in IEEE 802.1Qbv Time Sensitive Networks , 2016, RTNS.

[16]  Michael Glaß,et al.  Optimizing message routing and scheduling in automotive mixed-criticality time-triggered networks , 2017, 2017 54th ACM/EDAC/IEEE Design Automation Conference (DAC).

[17]  Dirk Timmermann,et al.  ILP-based joint routing and scheduling for time-triggered networks , 2017, RTNS.

[18]  Frank Dürr,et al.  Incremental Flow Scheduling and Routing in Time-Sensitive Software-Defined Networks , 2018, IEEE Transactions on Industrial Informatics.