Ji Li’s research while affiliated with Beihang University and other places

The existing research on time‐triggered network reconfiguration neglects redundant traffic states, posing a challenge in effectively balancing traffic performance and reconfiguration efficiency in practical deployments. In response to these limitations, a novel joint optimization approach is introduced for reconfiguration and traffic planning. Initially, the efficiency of reconfiguration solutions is enhanced by sacrificing the delay performance of redundant flows and prioritizing compressed yet tailored constraints. Subsequently, a tabu‐based optimization algorithm is employed to provide more flexible enhancements to the delay performance of network‐wide traffic. The outcomes demonstrate that the proposed method significantly outperforms incremental reconfiguration, improving the solution efficiency of the reconfiguration recovery phase by over 75.38%. Furthermore, through multiple rounds of reconfiguration, the approach achieves an 8.38% improvement in the average delay performance of all flows, even with redundant flows sacrificed.

Time-triggered networks are deployed in avionics and astronautics because they provide deterministic and low-latency communications. Remapping of partitions and the applications that reside in them that are executing on the failed core and the resulting re-routing and re-scheduling are conducted when a permanent end-system core failure occurs and local resources are insufficient. We present a network-wide reconfiguration strategy as well as an implementation scheme, and propose an Integer Linear Programming based joint mapping, routing, and scheduling reconfiguration method (JILP) for global reconfiguration. Based on scheduling compatibility, a novel heuristic algorithm (SCA) for mapping and routing is proposed to reduce the reconfiguration time. Experimentally, JILP achieved a higher success rate compared to mapping-then-routing-and-scheduling algorithms. In addition, relative to JILP, SCA/ILP was 50-fold faster and with a minimal impact on reconfiguration success rate. SCA achieved a higher reconfiguration success rate compared to shortest path routing and load-balanced routing. In addition, scheduling compatibility plays a guiding role in ILP-based optimization objectives and ‘reconfigurable depth’, which is a metric proposed in this paper for the determination of the reconfiguration potential of a TT network.

In time-triggered ethernet (TTEthernet), when an end system node (ES) permanently fails, the affected TT flows should be reconfigured (known as reconfigured TT flows) with ESs, routings and an updated scheduling table while maintaining the scheduling scheme of unaffected TT flows (referred as original TT flows) during runtime. This paper presents a reconfiguration method with backtracking ensemble pruning as the core solution algorithm for solving tree search models which are built with network topology and idle link slots. The model comprises a two-step strategy to reduce solution space scale of the search tree. The first step involved use of a backtracking ensemble pruning algorithm for each reconfigured TT flow (BEPA-S) where only the constraints of the original TT flows for each reconfigured TT flow are considered. The second step involved elimination of possible conflicts between reconfigured TT flows in which a modified BEPA algorithm (ModBEPA) was used to preferentially search scheduling schemes with smaller end-to-end delay. Dynamic pruning was performed based on the conflict information obtained during the depth-first search. Simulation results indicated that the time consumed in generation of scheduling scheme was further reduced without reducing its success rate because ESs, routings and TT scheduling tables were considered simultaneously (instead of calculating alternative ESs, routings and TT scheduling table separately through black box combinational optimization solver performed in traditional methods). Verification of the three different network scales showed that the efficiency acceleration ratio of BEPA based reconfiguration method was significantly better compared with that of the traditional method.

Due to current information transmission and interaction capabilities of the satellite main bus are difficult to meet the intelligent development trend. An integrated design based on the time-triggered Ethernet protocol is proposed. A method for fast generation and verification of CRC in the case of cut-through transmission is designed to further ensure communication quality. The network scheduling difference between variable length frame and fixed length frame forward communication is compared by SMT modeling and calculation, which show this design method has improved the network scheduling capability. In addition, this paper proposes further ideas on the issue of health monitoring under the Time-Triggered Ethernet protocol and cut-through switching.