Results 1-3 of 3.
((uid:50031808))

Bookmark and Share    
Full Text
Peer Reviewed
See detailA Hybrid Machine Learning and Schedulability Method for the Verification of TSN Networks
Mai, Tieu Long UL; Navet, Nicolas UL; Migge, Jörn

in 15th IEEE International Workshop on Factory Communication Systems (WFCS2019) (2019, March)

Machine learning (ML), and supervised learning in particular, can be used to learn what makes it hard for a network to be feasible and try to predict whether a network configuration will be feasible ... [more ▼]

Machine learning (ML), and supervised learning in particular, can be used to learn what makes it hard for a network to be feasible and try to predict whether a network configuration will be feasible without executing a conventional schedulability analysis. A disadvantage of ML-based timing verification with respect to schedulability analysis is the possibility of "false positives": configurations deemed feasible while they are not. In this work, in order to minimize the rate of false positives, we propose the use of a measure of the uncertainty of the prediction to drop it when the uncertainty is too high, and rely instead on schedulability analysis. In this hybrid verification strategy, the clear-cut decisions are taken by ML, while the more difficult ones are taken by a conventional schedulability analysis. Importantly, the trade-off achieved between prediction accuracy and computing time can be controlled. We apply this hybrid verification method to Ethernet TSN networks and obtain, for instance in the case of priority scheduling with 8 traffic classes, a 99% prediction accuracy with a speedup factor of 5.7 with respect to conventional schedulability analysis and a reduction of 46% of the false positives compared to ML alone. [less ▲]

Detailed reference viewed: 131 (19 UL)
Full Text
See detailUsing Machine Learning to Speed Up the Design Space Exploration of Ethernet TSN networks
Navet, Nicolas UL; Mai, Tieu Long UL; Migge, Jörn

Report (2019)

In this work, we ask if Machine Learning (ML) can provide a viable alternative to conventional schedulability analysis to determine whether a real-time Ethernet network meets a set of timing constraints ... [more ▼]

In this work, we ask if Machine Learning (ML) can provide a viable alternative to conventional schedulability analysis to determine whether a real-time Ethernet network meets a set of timing constraints. Otherwise said, can an algorithm learn what makes it difficult for a system to be feasible and predict whether a configuration will be feasible without executing a schedulability analysis? In this study, we apply standard supervised and unsupervised ML techniques and compare them, in terms of their accuracy and running times, with precise and approximate schedulability analyses in Network-Calculus. We show that ML techniques are efficient at predicting the feasibility of realistic TSN networks and offer new trade-offs between accuracy and computation time especially interesting for design-space exploration algorithms. [less ▲]

Detailed reference viewed: 206 (36 UL)
Full Text
Peer Reviewed
See detailOn the use of supervised machine learning for assessing schedulability: application to Ethernet TSN
Mai, Tieu Long UL; Navet, Nicolas UL; Migge, Jörn

in 27th International Conference on Real-Time Networks and Systems (RTNS 2019) (2019)

In this work, we ask if Machine Learning (ML) can provide a viable alternative to conventional schedulability analysis to determine whether a real-time Ethernet network meets a set of timing constraints ... [more ▼]

In this work, we ask if Machine Learning (ML) can provide a viable alternative to conventional schedulability analysis to determine whether a real-time Ethernet network meets a set of timing constraints. Otherwise said, can an algorithm learn what makes it difficult for a system to be feasible and predict whether a configuration will be feasible without executing a schedulability analysis? To get insights into this question, we apply a standard supervised ML technique, k-nearest neighbors (k-NN), and compare its accuracy and running times against precise and approximate schedulability analyses developed in Network-Calculus. The experiments consider different TSN scheduling solutions based on priority levels combined for one of them with traffic shaping. The results obtained on an automotive network topology suggest that k-NN is efficient at predicting the feasibility of realistic TSN networks, with an accuracy ranging from 91.8% to 95.9% depending on the exact TSN scheduling mechanism and a speedup of 190 over schedulability analysis for 10^6 configurations. Unlike schedulability analysis, ML leads however to a certain rate "false positives'' (i.e., configurations deemed feasible while they are not). Nonetheless ML-based feasibility assessment techniques offer new trade-offs between accuracy and computation time that are especially interesting in contexts such as design-space exploration where false positives can be tolerated during the exploration process. [less ▲]

Detailed reference viewed: 13 (1 UL)