EDWF-MTTF-based heuristic scheduling algorithm in time-sensitive networks
With the rapid integration and development of industrial control and information networks, time-sensitive networks based on ethernet have received widespread attention.In these networks, time-triggered communication scheduling is adopted to ensure the determinacy of data transmission.However, existi...
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2024-02-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| Online Access: | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2024009/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841533904180215808 |
|---|---|
| author | Chuanhuang LI Junhu LIAO Jiadong XUAN Qi XU Huifeng ZHANG Jun ZHU Tao ZOU Ruyun ZHANG |
| author_facet | Chuanhuang LI Junhu LIAO Jiadong XUAN Qi XU Huifeng ZHANG Jun ZHU Tao ZOU Ruyun ZHANG |
| author_sort | Chuanhuang LI |
| collection | DOAJ |
| description | With the rapid integration and development of industrial control and information networks, time-sensitive networks based on ethernet have received widespread attention.In these networks, time-triggered communication scheduling is adopted to ensure the determinacy of data transmission.However, existing scheduling algorithms have struggled to rapidly calculate the scheduling tables for large-scale periodic traffic.Therefore, a heuristic scheduling algorithm based on the earliest deadline with weight first-maximum transfer time first was designed.This algorithm, by flexibly adapting traffic sorting weights and enhancing backtracking methods, could resolve the scheduling issues of large-scale traffic in industrial automation scenarios in a relatively short time.Experimental results show that compared to the classic integer linear programming method, the earliest deadline with weight first-maximum transfer time first heuristic scheduling algorithm is able to calculate a more optimal solution for the scheduling table of large-scale periodic traffic more swiftly. |
| format | Article |
| id | doaj-art-77e624a75f634c3ba720fd9e53315c75 |
| institution | Kabale University |
| issn | 1000-0801 |
| language | zho |
| publishDate | 2024-02-01 |
| publisher | Beijing Xintong Media Co., Ltd |
| record_format | Article |
| series | Dianxin kexue |
| spelling | doaj-art-77e624a75f634c3ba720fd9e53315c752025-01-15T02:48:33ZzhoBeijing Xintong Media Co., LtdDianxin kexue1000-08012024-02-0140223759555631EDWF-MTTF-based heuristic scheduling algorithm in time-sensitive networksChuanhuang LIJunhu LIAOJiadong XUANQi XUHuifeng ZHANGJun ZHUTao ZOURuyun ZHANGWith the rapid integration and development of industrial control and information networks, time-sensitive networks based on ethernet have received widespread attention.In these networks, time-triggered communication scheduling is adopted to ensure the determinacy of data transmission.However, existing scheduling algorithms have struggled to rapidly calculate the scheduling tables for large-scale periodic traffic.Therefore, a heuristic scheduling algorithm based on the earliest deadline with weight first-maximum transfer time first was designed.This algorithm, by flexibly adapting traffic sorting weights and enhancing backtracking methods, could resolve the scheduling issues of large-scale traffic in industrial automation scenarios in a relatively short time.Experimental results show that compared to the classic integer linear programming method, the earliest deadline with weight first-maximum transfer time first heuristic scheduling algorithm is able to calculate a more optimal solution for the scheduling table of large-scale periodic traffic more swiftly.http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2024009/time-sensitive networkperiodic traffictraffic schedulingheuristic algorithmbacktracking algorithm |
| spellingShingle | Chuanhuang LI Junhu LIAO Jiadong XUAN Qi XU Huifeng ZHANG Jun ZHU Tao ZOU Ruyun ZHANG EDWF-MTTF-based heuristic scheduling algorithm in time-sensitive networks Dianxin kexue time-sensitive network periodic traffic traffic scheduling heuristic algorithm backtracking algorithm |
| title | EDWF-MTTF-based heuristic scheduling algorithm in time-sensitive networks |
| title_full | EDWF-MTTF-based heuristic scheduling algorithm in time-sensitive networks |
| title_fullStr | EDWF-MTTF-based heuristic scheduling algorithm in time-sensitive networks |
| title_full_unstemmed | EDWF-MTTF-based heuristic scheduling algorithm in time-sensitive networks |
| title_short | EDWF-MTTF-based heuristic scheduling algorithm in time-sensitive networks |
| title_sort | edwf mttf based heuristic scheduling algorithm in time sensitive networks |
| topic | time-sensitive network periodic traffic traffic scheduling heuristic algorithm backtracking algorithm |
| url | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2024009/ |
| work_keys_str_mv | AT chuanhuangli edwfmttfbasedheuristicschedulingalgorithmintimesensitivenetworks AT junhuliao edwfmttfbasedheuristicschedulingalgorithmintimesensitivenetworks AT jiadongxuan edwfmttfbasedheuristicschedulingalgorithmintimesensitivenetworks AT qixu edwfmttfbasedheuristicschedulingalgorithmintimesensitivenetworks AT huifengzhang edwfmttfbasedheuristicschedulingalgorithmintimesensitivenetworks AT junzhu edwfmttfbasedheuristicschedulingalgorithmintimesensitivenetworks AT taozou edwfmttfbasedheuristicschedulingalgorithmintimesensitivenetworks AT ruyunzhang edwfmttfbasedheuristicschedulingalgorithmintimesensitivenetworks |