Incremental Flow Scheduling and Routing in Time-Sensitive Software-Defined Networks

Several networking architectures have been developed atop IEEE 802.3 networks to provide real-time communication guarantees for time-sensitive applications in industrial automation systems. The basic principle underlying these technologies is the precise transmission scheduling of time-triggered tra...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on industrial informatics Vol. 14; no. 5; pp. 2066 - 2075
Main Authors: Nayak, Naresh Ganesh, Durr, Frank, Rothermel, Kurt
Format: Journal Article
Language:English
Published: Piscataway IEEE 01.05.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Computing time
Delays
Industrial applications
Industrial Internet of Things
Industrial networks
Industry 4.0
integer linear programming
Jitter
Job shop scheduling
Network latency
Processor scheduling
Real time
Real-time systems
Routing
Schedules
Scheduling
Software
Software-defined networking
ISSN:1551-3203, 1941-0050
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Several networking architectures have been developed atop IEEE 802.3 networks to provide real-time communication guarantees for time-sensitive applications in industrial automation systems. The basic principle underlying these technologies is the precise transmission scheduling of time-triggered traffic through the network for providing deterministic and bounded latency and jitter. These transmission schedules are typically synthesized offline (computational time in the order of hours) and remain fixed thereafter, making it difficult to dynamically add or remove network applications. This paper presents algorithms for incrementally adding time-triggered flows in a time-sensitive software-defined network (TSSDN). The TSSDN is a network architecture based on software-defined networking, which provides real-time guarantees for time-triggered flows by scheduling their transmissions on the hosts (network edge) only. These algorithms exploit the global view of the control plane on the data plane to schedule and route time-triggered flows needed for the dynamic applications in the Industrial Internet of Things (Industry 4.0). The evaluations show that these algorithms can compute incremental schedules for time-triggered flows in subseconds with an average relative optimality of 68%.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1551-3203
1941-0050
DOI:10.1109/TII.2017.2782235