The invention relates to a time-sensitive
network routing and scheduling method based on a conflict graph, and belongs to the technical field of industrial
automation communication. The method comprises the following steps: firstly, reading
network topology, node
processing delay, traffic period, traffic frame length, source node and destination node information, and carrying out initialization representation on the TSN
network topology; then, according to the configuration information of the data flow and the
network topology, generating candidate paths meeting
delay, bandwidth and load balancing constraints; then, establishing a conflict graph by taking the configuration of routing and phase and the color as vertexes and taking the space-time conflict of any frame in a period on any shared link as an edge; and solving the maximum independent polychromatic set in the conflict graph, namely, distributing proper transmission starting time for each flow in the network. According to the method, the scheduling constraint is mapped into the conflict graph, and the independent set solving
algorithm is combined, so that a rapid and low-memory-occupation scheduling scheme is generated, the link
utilization rate and the
system adaptability are improved, and meanwhile, strict
delay and bandwidth constraints are met.