Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1109/ETFA.2019.8869365guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
research-article

Integration of SMT-based Scheduling with RC Network Calculus Analysis in TTEthernet Networks

Published: 01 September 2019 Publication History

Abstract

In mixed-criticality Ethernet-based time-triggered networks, like TTEthernet, time-triggered communication (TT) coexists with rate-constrained (RC) and best-effort (BE) traffic. A global communication scheme, i.e., a schedule, establishes contention-free transmission times for TT flows ensuring guaranteed low latency and minimal jitter. Current approaches use Satisfiability Modulo Theories (SMT) to formulate the scheduling constraints and solve the resulting problem. However, these approaches do not take into consideration the impact of the TT schedule on RC traffic. Hence, the resulting TT schedule may cause the worst-case latency requirements of RC traffic not to be fulfilled anymore.In this paper, we present a novel method for including an RC analysis in state-of-the-art SMT-based schedule synthesis algorithms via a feedback loop in order to maintain the optimality properties of the SMT-based approaches while also being able to improve the RC traffic delays. Our method is designed in such a way that it can be readily integrated into existing SMT- or MiP-based solutions. We evaluate our approach using variants derived from a realistic use-case and present methods to further improve the efficiency of our feedback-based approach.

References

[1]
J. Grieu, “ Analyse et évaluation de techniques de commutation Ethernet pour l’interconnexion des systèmes avioniques,” Ph.D. dissertation , INPT, 2004 .
[2]
F. Frances, C. Fraboul, and J. Grieu, “ Using network calculus to optimize the AFDX network,” in Proc. ERTS, 2006 .
[3]
J. Diemer, D. Thiele, and R. Ernst, “ Formal worst-case timing analysis of Ethernet topologies with strict-priority and AVB switching,” in Proc. SIES . IEEE Computer Society, 2012 .
[4]
D. Thiele, P. Axer, and R. Ernst, “ Improving formal timing analysis of switched Ethernet by exploiting FIFO scheduling,” in Proceedings of the 52nd Annual Design Automation Conference . ACM, 2015, p. 41 .
[5]
Airlines Electronic Engineering Committee, “ Aircraft Data Network Part 7, Avionics Full Duplex Switched Ethernet (AFDX) Network, ARINC Specification 664 .” Aeronautical Radio , 2002 .
[6]
SAE International, “ SAE AS6802 Time-Triggered Ethernet ,” http://standards.sae.org/as6802/, 2011 .
[7]
W. Steiner, G. Bauer, B. Hall, and M. Paulitsch, “ TTEthernet: Time-Triggered Ethernet,” in Time-Triggered Communication , R. Obermaisser, Ed. CRC Press, Aug 2011 .
[8]
D. Tamas-Selicean, P. Pop, and W. Steiner, “ Synthesis of communication schedules for TTEthernet-based mixed-criticality systems,” in Proc. CODES+ISSS . ACM, 2012 .
[9]
W. Steiner, “ An evaluation of SMT-based schedule synthesis for time-triggered multi-hop networks,” in Proc. RTSS . IEEE, 2010 .
[10]
S. S. Craciunas and R. Serna Oliver, “ Combined task- and network-level scheduling for distributed time-triggered systems,” Real-Time Systems , vol. 52, no. 2, 2016 .
[11]
H. Kopetz, A. Ademaj, P. Grillinger, and K. Steinhammer, “ The Time-Triggered Ethernet (TTE) Design,” Proc. ISORC, 2005 .
[12]
R. Serna Oliver, S. S. Craciunas, and W. Steiner, “ IEEE 802.1Qbv Gate Control List Synthesis using Array Theory Encoding,” in Proc. RTAS . IEEE, 2018 .
[13]
C. Barrett, R. Sebastiani, S. Seshia, and C. Tinelli, “ Satisfiability modulo theories,” in Handbook of Satisfiability . IOS Press, 2009, vol. 185 .
[14]
R. Sebastiani, “ Lazy satisfiability modulo theories,” JSAT , vol. 3, no. 3–4, pp. 141 – 224, 2007 .
[15]
N. Bjørner, A. Phan, and L. Fleckenstein, “ νz - an optimizing SMT solver,” in Proc. TACAS . Springer, 2015 .
[16]
L. Zhao, P. Pop, Z. Zheng, and Q. Li, “ Timing analysis of AVB traffic in TSN networks using network calculus,” in Proc. RTAS, 2018 .
[17]
J. Le Boudec and P. Thiran, Network calculus: a theory of deterministic queuing systems for the internet . Springer-Verlag, 2001 .
[18]
A. Bouillard, L. Jouhet, and E. Thierry, “ Service curves in Network Calculus: dos and don’ts,” INRIA, Research Report , 2009 .
[19]
M. Boyer, J. Migge, and N. Navet, “ An efficient and simple class of functions to model arrival curve of packetised flows,” in Proc. WCTT, 2011 .
[20]
L. Zhao, P. Pop, Q. Li, J. Chen, and H. Xiong, “ Timing analysis of rate-constrained traffic in TTEthernet using network calculus,” Real-Time Systems , vol. 53, no. 2, pp. 254 – 287, 2017 .
[21]
L. X. Zhao, H. G. Xiong, Z. Zheng, and Q. Li, “ Improving worst-case latency analysis for rate-constrained traffic in the time-triggered ethernet network,” IEEE Communications Letters , vol. 18, no. 11, 2014 .
[22]
M. Boyer, H. Daigmorte, N. Navet, and J. Migge, “ Performance impact of the interactions between time-triggered and rate-constrained transmissions in TTEthernet,” in Proc. ERTS, 2016 .
[23]
T. P. Baker and A. Shaw, “ The cyclic executive model and Ada,” Real-Time Systems , vol. 1, no. 1, pp. 7 – 25, 1989 .
[24]
S. S. Craciunas and R. Serna Oliver, “ SMT-based task- and network-level static schedule generation for time-triggered networked systems,” in Proc. RTNS . ACM, 2014 .
[25]
L. Zhang, D. Goswami, R. Schneider, and S. Chakraborty, “ Task- and network-level schedule co-synthesis of Ethernet-based time-triggered systems,” in Proc. ASP-DAC . IEEE Computer Society, 2014 .
[26]
W. Steiner, “ Synthesis of static communication schedules for mixed-criticality systems,” in Proc. ISORCW . IEEE Computer Society, 2011 .
[27]
M. Abuteir and R. Obermaisser, “ Scheduling of rate-constrained and time-triggered traffic in multi-cluster TTEthernet systems,” in Proc. INDIN, 2015 .
[28]
F. Heilmann and G. Fohler, “ Impact of time-triggered transmission window placement on rate-constrained traffic in TTEthernet networks,” SIGBED Rev. , vol. 15, no. 3, pp. 7 – 12, Aug. 2018 .

Cited By

View all
  • (2024)An Efficient Approach for Improving Message Acceptance Rate and Link Utilization in Time-Sensitive NetworkingACM Transactions on Embedded Computing Systems10.1145/3690638Online publication date: 29-Aug-2024
  • (2022)AVB-aware Routing and Scheduling for Critical Traffic in Time-sensitive Networks with PreemptionProceedings of the 30th International Conference on Real-Time Networks and Systems10.1145/3534879.3534926(207-218)Online publication date: 7-Jun-2022
  • (2019)Breaking vs. solvingProceedings of the 27th International Conference on Real-Time Networks and Systems10.1145/3356401.3356418(101-111)Online publication date: 6-Nov-2019

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings
2019 24th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)
September 2019
1735 pages

Publisher

IEEE Press

Publication History

Published: 01 September 2019

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 13 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)An Efficient Approach for Improving Message Acceptance Rate and Link Utilization in Time-Sensitive NetworkingACM Transactions on Embedded Computing Systems10.1145/3690638Online publication date: 29-Aug-2024
  • (2022)AVB-aware Routing and Scheduling for Critical Traffic in Time-sensitive Networks with PreemptionProceedings of the 30th International Conference on Real-Time Networks and Systems10.1145/3534879.3534926(207-218)Online publication date: 7-Jun-2022
  • (2019)Breaking vs. solvingProceedings of the 27th International Conference on Real-Time Networks and Systems10.1145/3356401.3356418(101-111)Online publication date: 6-Nov-2019

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media