2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA) 2018
DOI: 10.1109/etfa.2018.8502515
|View full text |Cite
|
Sign up to set email alerts
|

Genetic Algorithm for Scheduling Time-Triggered Traffic in Time-Sensitive Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
23
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 79 publications
(23 citation statements)
references
References 6 publications
0
23
0
Order By: Relevance
“…If the network is involved, both the network and the task schedules have to be coordinated. One solution to address task and TSN network scheduling has already been investigated in [ 54 ]. In future works, we will elaborate on the subject matter in more detail.…”
Section: Binding Implementation For Real-time Systemsmentioning
confidence: 99%
“…If the network is involved, both the network and the task schedules have to be coordinated. One solution to address task and TSN network scheduling has already been investigated in [ 54 ]. In future works, we will elaborate on the subject matter in more detail.…”
Section: Binding Implementation For Real-time Systemsmentioning
confidence: 99%
“…A heuristic list scheduler for joint communication scheduling and network routing is proposed in [54], where multi-cast traffic and application distribution are allowed, and bandwidth is optimized. The same problem is addressed in [55] where a genetic algorithm is employed and in [23], where multiple traffic types are considered.…”
Section: Related Workmentioning
confidence: 99%
“…The work in [25] proposes a K-shortest path heuristic and a meta-heuristic randomized adaptive search procedure to solve the joint routing and scheduling problem for time-triggered traffic, and at the same time reduce the end-to-end delays of audio-video-bridging traffic. The work in [26] develops two algorithms to schedule multicast time-triggered flows: the first algorithm is based on genetic algorithm and generates schedules under real-time constraints; the second one is based on fixed routings and implemented as a list scheduler. The work in [27] presents a heuristic incremental scheduling algorithm to minimize the impact of reconfiguring schedules on existing flows.…”
Section: Related Workmentioning
confidence: 99%