Scalable no-wait scheduling with flow-aware model conversion in time-sensitive networking
GLOBECOM 2022-2022 IEEE Global Communications Conference, 2022•ieeexplore.ieee.org
The development of the Industrial Internet of Things (1IoT) has given rise to massive
information from the networked controllers, sensors and actuators, leading to the increasing
demands for real-time and reliable transmission. Time-Sensitive Networking (TSN) provides
the deterministic mechanism guar-antee for these demands, but with an open scheduling
problem. For the low-latency and low-jitter traffic, it is hard to schedule in a scalable way, that
is, increasing the scheduling speed under the Quality-of-Service (QoS) requirements …
information from the networked controllers, sensors and actuators, leading to the increasing
demands for real-time and reliable transmission. Time-Sensitive Networking (TSN) provides
the deterministic mechanism guar-antee for these demands, but with an open scheduling
problem. For the low-latency and low-jitter traffic, it is hard to schedule in a scalable way, that
is, increasing the scheduling speed under the Quality-of-Service (QoS) requirements …
The development of the Industrial Internet of Things (1IoT) has given rise to massive information from the networked controllers, sensors and actuators, leading to the increasing demands for real-time and reliable transmission. Time-Sensitive Networking (TSN) provides the deterministic mechanism guar-antee for these demands, but with an open scheduling problem. For the low-latency and low-jitter traffic, it is hard to schedule in a scalable way, that is, increasing the scheduling speed under the Quality-of-Service (QoS) requirements. Therefore, this paper constructs a no-wait forwarding (NW-TAS) model with a time-aware shaper to eliminate the queuing delay and jitter, and further converts it into a flow-aware model by divisibility theory for scheduling simplification. With the converted model, an interval transformation-based method is proposed to get the analytical expression of feasible scheduling for each flow. Then, a flow-aware NW- TAS scheduling algorithm (FANS) with cyclic interval searching is designed to compress invalid search spaces. The evaluation results show that our method decreases the transmission latency of 1000 flows by more than 23 % while increasing the scheduling speed by 43x than the existing works.
ieeexplore.ieee.org
Showing the best result for this search. See all results