A Hybrid Machine Learning and Schedulability Analysis Method for the Verification of TSN Networks

Abstract

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.