Parth Anand: Routing Optimization for MCQF in TSN
Routing Optimization for MCQF (Multiple Cyclic Queuing and Forwarding) in Time-Sensitive Networking
- https://www.inet.haw-hamburg.de/events/inet-seminar/parth-anand-routing-optimization-for-mcqf-in-tsn
- Parth Anand: Routing Optimization for MCQF in TSN
- 2024-09-16T14:00:00+02:00
- 2024-09-16T15:00:00+02:00
- Routing Optimization for MCQF (Multiple Cyclic Queuing and Forwarding) in Time-Sensitive Networking
Sep 16, 2024 from 02:00 PM to 03:00 PM (Europe/Berlin / UTC200)
As industrial networks become increasingly complex and real-time IoT applications proliferate, ensuring deterministic communication is crucial. The Time-Sensitive Networking (TSN) standards, developed by the IEEE 802.1 Task Group, address this need by introducing traffic scheduling mechanisms such as the Time-Aware Shaper (TAS) and Multiple Cyclic Queuing and Forwarding (MCQF). However, while much research has focused on traffic scheduling, the impact of routing algorithms on flow schedulability remains underexplored. Improving flow schedulability in this context means reducing bandwidth and deadline violations. This work introduces an enhanced load-balancing routing algorithm specifically designed for TSN networks using MCQF traffic shaping. The proposed algorithm optimizes load distribution and introduces deadline-aware path filtering to improve the schedulability of time-sensitive flows. Additionally, custom flow-sorting techniques are employed to prioritize routing decisions based on flow characteristics such as size, period, and deadline. The integration of this routing algorithm into an existing MCQF codebase demonstrates an increase in the percentage of schedulable flows, resulting in fewer deadline and bandwidth violations compared to the traditional Shortest Path routing method.