Message Scheduling Table’s Generation Algorithm In Time-triggered Fibre Channel Avionics Networks

Time-triggered Ethernet（TTE）brings advantages of hard real-time assurance and high reliability to traditional Ethernet,making it widely applied in the field of industrial control.With avionics networks developing,Fibre Channel（FC）,a high-speed data transmission protocol,has gradually replaced the traditional avionics data bus.The timetriggered protocol（TTP）has been combined with the FC network recently named TT-FC,dividing messages into time-triggered（TT）ones and event-triggered（ET）ones.ET messages are those from traditional Ethernet,and the transmission of TT messages relies on static schedule tables to ensure the real-time feature.Static schedule tables specify the time points for TT messages to be sent,forwarded and received,avoiding conflicts in the network.This thesis mainly discusses the static schedule tables’ generation algorithms in the avionics TT-FC networks,and the main contributions are as follows:1.Transform the scheduling process into mathematical models after the problem of generation of static schedule tables has been studied,and the constraints have been quantified to facilitate the subsequent verification.The common algorithms for static schedule tables have been studied,especially the typical ones such as sequence sorting algorithm and the particle swarm optimization（PSO）algorithm with simulations performed.Results show that sequence sorting brings high delays of ET messages while PSO algorithm cannot apply to networks with multiple messages or complicated topology.2.The grouped sifting algorithm and sifting algorithm with varied step have been proposed aiming to solve the scheduling problems of TT messages,with performance compared in terms of delays of TT and ET messages in the network with and without ET messages.Simulations show that lower delay of ET messages has been achieved.3.The bin-packing problem（BPP）has been studied and combined with the scheduling problem of TT messages.Existing algorithms for BPP have been researched and innovated for static schedule tables.The schedule results have been optimized with the hole-packing method and the across-slot utilization method.Simulations show lower delays of ET messages have been achieved.