Flow Scheduling for Conflict-Free Network Updates in Time-Sensitive Software-Defined Networks

The digital transformation of industry requires industrial control networks provide high flexibility and determinacy. Time-sensitive software-defined networking that combines time-sensitive networking and software-defined networking is a new network paradigm which provides both real-time transmissio...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on industrial informatics Vol. 17; no. 3; pp. 1668 - 1678
Main Authors: Pang, Zaiyu, Huang, Xiao, Li, Zonghui, Zhang, Sukun, Xu, Yanfen, Wan, Hai, Zhao, Xibin
Format: Journal Article
Language:English
Published: Piscataway IEEE 01.03.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Flexibility
Informatics
Integer linear programming (ILP)-based scheduling
Job shop scheduling
Network topology
network updates
Networks
Processor scheduling
Real-time systems
Schedules
Software-defined networking
time-sensitive networking (TSN)
time-triggered (TT) networks
ISSN:1551-3203, 1941-0050
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The digital transformation of industry requires industrial control networks provide high flexibility and determinacy. Time-sensitive software-defined networking that combines time-sensitive networking and software-defined networking is a new network paradigm which provides both real-time transmission feature and network flexibility. During network updates, the transmission consistency needs to be maintained. However, previous mechanisms mostly target on the proper schedule transition, which cannot guarantee no frame loss and also introduces extra update overhead. The article proposes a novel flow schedule generation model which guarantees no frame loss during network updates even with the basic two-phase update mechanism and introduces no extra update overhead. Two algorithms are designed for the model to adapt to different application scenarios: the offline algorithm poses better schedulability, whereas the online one consumes less time with slightly decreased schedulability. The experiments on two real-world industrial networks demonstrate our mechanism achieves zero frame loss without extra update overhead compared to existing methods, and the online algorithm saves 40% execution time with at most 10% schedulability decrease when the bandwidth utilization is less than 50%.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1551-3203
1941-0050
DOI:10.1109/TII.2020.2998224