The progress of modern industry has given rise to great requirements for network transmission latency and reliability in domains such as smart grid and intelligent driving.To address these challenges,the concept of Ti...The progress of modern industry has given rise to great requirements for network transmission latency and reliability in domains such as smart grid and intelligent driving.To address these challenges,the concept of Time-sensitive networking(TSN)is proposed by IEEE 802.1TSN working group.In order to achieve low latency,Cyclic queuing and forwarding(CQF)mechanism is introduced to schedule Timetriggered(TT)flows.In this paper,we construct a TSN model based on CQF and formulate the flow scheduling problem as an optimization problem aimed at maximizing the success rate of flow scheduling.The problem is tackled by a novel algorithm that makes full use of the characteristics and the relationship between the flows.Firstly,by K-means algorithm,the flows are initially partitioned into subsets based on their correlations.Subsequently,the flows within each subset are sorted by a new special criteria extracted from multiple features of flow.Finally,a flow offset selecting method based on load balance is used for resource mapping,so as to complete the process of flow scheduling.Experimental results demonstrate that the proposed algorithm exhibits significant advantages in terms of scheduling success rate and time efficiency.展开更多
基金supported by Science and Technology Project of State Grid Corporation Headquarters under Grant 5108-202218280A-2-170-XG(Development and Application of Power Time-Sensitive Network Switching Chip。
文摘The progress of modern industry has given rise to great requirements for network transmission latency and reliability in domains such as smart grid and intelligent driving.To address these challenges,the concept of Time-sensitive networking(TSN)is proposed by IEEE 802.1TSN working group.In order to achieve low latency,Cyclic queuing and forwarding(CQF)mechanism is introduced to schedule Timetriggered(TT)flows.In this paper,we construct a TSN model based on CQF and formulate the flow scheduling problem as an optimization problem aimed at maximizing the success rate of flow scheduling.The problem is tackled by a novel algorithm that makes full use of the characteristics and the relationship between the flows.Firstly,by K-means algorithm,the flows are initially partitioned into subsets based on their correlations.Subsequently,the flows within each subset are sorted by a new special criteria extracted from multiple features of flow.Finally,a flow offset selecting method based on load balance is used for resource mapping,so as to complete the process of flow scheduling.Experimental results demonstrate that the proposed algorithm exhibits significant advantages in terms of scheduling success rate and time efficiency.
