Research on Time-Sensitive Network Scheduling Based on Substation Service Flow

With the development of new power systems, the problem of large delay and large jitter in the transmission of time-sensitive data streams in power systems has put forward higher network performance requirements. This paper proposes a time-sensitive network scheduling method for substation traffic transmission problem for substation service flow. The method starts from two aspects, path and scheduling, path this paper uses genetics algorithm to optimize on the basis of K shortest path, and scheduling this paper combines the content of bandwidth reservation technology in the TSN standard protocol to schedule the substation traffic and solves it by SMT modelling using Z3 solver. The experimental results compare the scheduling method proposed in this paper with the heuristic list scheduling algorithm (HLS) and greedy adaptive search algorithm (GRASP), in which the end-to-end delay of the traffic is reduced by about 15% and the packet loss rate is reduced by about 17%.