物联网学报2025，Vol.9Issue(3)：48-59,12.DOI:10.11959/j.issn.2096-3750.2025.00431
面向车载时间敏感网络的时间感知最大匹配流量调度算法
Time-aware traffic scheduling algorithm based on maximum matching for in-vehicle time-sensitive networks
摘要
Abstract
With the application of the Internet of vehicles,the real-time,deterministic,and reliable data transmission for the in-vehicle networks become crucial.In response to the issues of untimely data forwarding,high packet transmission delay,and high complexity of scheduling algorithms in-vehicle time-sensitive networks,a time-aware traffic scheduling algorithm based on maximum matching was proposed.This algorithm transformed the input queuing scheduling problem into a maxi-mum flow matching problem with deadline guarantees and achieved maximum weight matching scheduling on a per-slot ba-sis.In scheduling sets containing tasks with two or more deadlines,idle link and slot resources were fully utilized to pre-push packets with larger deadlines.This effectively improved the throughput of the switching system and reduced the average packet delay.Simulation results demonstrate that compared with traditional scheduling algorithms,the proposed algorithm achieves 5%～15%throughput performance improvement and 15%～46%average packet delay performance improvement.关键词
车载时间敏感网络/输入排队系统/截止期保障/最大匹配/流量调度Key words
in-vehicle time-sensitive network/input queuing system/deadline guarantee/maximum matching/traffic scheduling分类
信息技术与安全科学引用本文复制引用
郑凌,魏国栋,潘伟涛,张科遥,褚宏云..面向车载时间敏感网络的时间感知最大匹配流量调度算法[J].物联网学报,2025,9(3):48-59,12.基金项目
国家自然科学基金资助项目(No.62102314) （No.62102314）
陕西省自然科学基础研究计划项目(No.2021JQ-708,No.2022JQ-635)The National Natural Science Foundation of China(No.62102314),Natural Science Basic Research Program of Shaanxi Province(No.2021JQ-708,No.2022JQ-635) （No.2021JQ-708,No.2022JQ-635）
