Heuristic Redundant Routing and Scheduling Algorithm Based on MCQF

Frame replication and elimination for reliability (FRER) and cyclic queuing and forwarding(CQF), as two important mechanisms in Time-Sensitive Networking (TSN), provide technical support for TSN to achieve reliable and deterministic transmission. The redundant routing and scheduling mechanism integrating FRER and CQF can effectively improve network performance. However, existing research lacks efficient and practical routing and scheduling methods. In this paper, we improve the redundant routing and scheduling mechanism from the two aspects of routing and scheduling respectively. We first jointly consider load balancing and path length, proposes a redundant routing optimization metric (RROM). Moreover, a tabu search routing algorithm based on RROM (TS-RROM) is designed. According to the routing results, a heuristic redundant routing scheduling algorithm based on multiple CQF (HRSOM) is proposed to jointly improve the network performance. Additionally, experimental results demonstrate that the proposed HRSOM outperforms both the CQF-based Mapping Score Scheduling (MSS) algorithm and the SMT algorithm with a timeout of 60 minutes in scheduling success rate by at least 2.3 %, while reducing jitters and running times.