A Switching Scheduling Algorithm Based on Time Triggered Fibre Channel Network

In this paper, a data exchange scheduling algorithm based on time trigger fibre channel network is proposed. Based on variable-length priority round Robin matching (vp-RRM), a traffic adaptive mechanism is added. The algorithm queues and caches the transmission data in the fibre channel network according to the service types such as time trigger (TT), rate-constrained (RC) and best-effort (BE), and correlates the queue length with the priority of switching scheduling, which can significantly improve the switching scheduling efficiency of non-uniform service flow. Through simulation and experimental verification, the throughput performance of the algorithm is significantly improved compared with VP-RRM under non-uniform traffic flow, and it is more suitable for the exchange scheduling of event triggered services in time trigger fiber channel (TTFC) network.