Font Size: a A A

Research On Time-Triggered Messages Scheduling Algorithms In Time-Triggered Ethernet

Posted on:2020-08-21Degree:MasterType:Thesis
Country:ChinaCandidate:B Q LuanFull Text:PDF
GTID:2428330602952492Subject:Communication and Information System
Abstract/Summary:PDF Full Text Request
With the continuous development of information technology,new network systems such as vehicle networking,Internet of things and avionics network emerge as the times require.They have put forward higher requirements for the timeliness,accuracy and security of the network.In order to better meet the requirements of the new network system,time-triggered Ethernet with time-triggered mechanism can well meet the development requirements of the above network,and is one of its ideal network technologies.For time-triggered Ethernet,how to schedule its business directly affects the stability and communication performance of the system.In this paper,the scheduling strategy of time-triggered message is mainly studied,and we also compare the performance of different types of messages' delay.In order to reduce queuing delay of event-triggered messages,a scheduling algorithm based on two-dimensional packing algorithm is proposed in this paper.The problem is optimized by transforming scheduling problem into bin packing problem.Finally,the correctness of the proposed performance analysis and the feasibility of scheduling algorithm are verified by simulation.Compared with the traditional SMT scheduling method,the proposed method not only greatly reduces the complexity of the algorithm,so that this method can be applied to the static and dynamic scheduling hybrid scheduling scenarios,and also improves the performance of the scheduling table,reduces the queuing delay of event-triggered messages,improves the network delay performance,and reduces the delay jitter.The stability of the system is guaranteed.In order to solve the jitter problem caused by the excessive accumulation of time-triggered messages in the existing scheduling methods,an improved version of the packing scheduling method is proposed through the further study of the bin packing problem.The new algorithm increases the porosity by changing the packing strategy.The feasibility of the improved method is verified by simulation.In order to compare the performance difference between the improved method and the existing method,experiments are carried out in the same time-triggered Ethernet simulation environment.On the premise of guaranteeing no delay and accurate transmission of time-triggered messages,the experiment compares the computation time and service delay of the two methods.The simulation results show that the improved method can improve the stability and delay performance of the time-triggered Ethernet system.
Keywords/Search Tags:Time-Triggered Ethernet, Packing Problem, Messages Scheduling
PDF Full Text Request
Related items