Evaluation of Metaheuristic Algorithms for TAS Scheduling in Time-Sensitive Networking
- Authors
- Min, J.; Oh, M.; Kim, W.; Seo, H.; Paek, Jeongyeup
- Issue Date
- Oct-2022
- Publisher
- IEEE Computer Society
- Keywords
- Flow scheduling; IEEE 802.1Q; IEEE 802.1Qbv; MEALPY; Metaheuristic; Time-Sensitive Network (TSN)
- Citation
- International Conference on ICT Convergence, v.2022-October, pp 809 - 812
- Pages
- 4
- Journal Title
- International Conference on ICT Convergence
- Volume
- 2022-October
- Start Page
- 809
- End Page
- 812
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/59738
- DOI
- 10.1109/ICTC55196.2022.9952760
- ISSN
- 2162-1233
- Abstract
- Time Sensitive Networking (TSN) is an emerging technology for providing deterministic ultra low-latency network based on Ethernet. It is designed for application domains such as industrial automation where guaranteed latency is required to meet the hard deadlines of flows. TSN achieves this by carefully scheduling the transmissions of frames through the IEEE 802.1Qbv standard, also known as time-aware shaper (TAS). However, TAS scheduling problem is classified as NP-hard. To overcome this challenge, we explore various metaheuristic approaches using MEALPY, a state-of-the-art meta-heuristic algorithm module of Python. We evaluate the meta-heuristic algorithms for TAS scheduling optimization problem through TSN simulations and provide observations for future directions. © 2022 IEEE.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/59738)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.