A Backtracking Ensemble Pruning Based Reconfiguration Method for Time-Triggered Flows in TTEthernet

Li, Ji; Li, Qiao; Huagang, Xiong

doi:10.1109/access.2021.3129252

Cited by 5 publications

(4 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the use of SMT solvers requires the routing of flows to be determined in advance, while the selection of different routes can have a significant impact on the scheduling success rate and network performance metrics. Sequential solving makes online recon-figuration challenging to solve and optimize, as poorly designed routes lead to solving failures and backtracking to new routes, which repeatedly increases solving time and reduces solving efficiency [24]. Therefore, it is more sensible to solve traffic routing and scheduling as a single optimization problem with joint routing and scheduling techniques, whereby ILP is a more widely adopted design approach [17,[25][26][27].…”

Section: Related Workmentioning

confidence: 99%

“…For example, if p A = 8, p B = 12 and l A = l B = 1, thus lcm = 24 and gcd = 4. When the time-slots occupied by TT flow A are predetermined to be [1,9,17], there are gcd−1 gcd × p B = 4−1 4 × 12 = 9 number of scenarios in which TT flow B can be scheduled, namely [2,14], [3,15], [4,16], [6,18], [7,19], [8,20], [10,22], [11,23], [12,24].…”

Section: Scheduling Compatibility (Sc)mentioning

confidence: 99%

“…× 12 = 3 number of scenarios in which TT flow B can be scheduled, namely [2,3,4,14,15,16], [6,7,8,18,19,20], [10,11,12,22,23,24].…”

Section: Scheduling Compatibility (Sc)mentioning

confidence: 99%

See 2 more Smart Citations

Run-Time Reconfiguration Strategy and Implementation of Time-Triggered Networks

Huagang

et al. 2022

Electronics

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Scheduling Compatibility (Sc)mentioning

confidence: 99%

See 1 more Smart Citation

Run-Time Reconfiguration Strategy and Implementation of Time-Triggered Networks

Huagang

et al. 2022

Electronics

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, the current conflict graph-based approach only supports zero-queuing scheduling, which limits its scalability to the general case. Our previous research extended the application scenario of network layer reconfiguration by combining the application migration decision problem with routing and scheduling [13]. Moreover, we optimized the reconfiguration routing algorithm by incorporating scheduling compatibility, which explored the trade-off between reconfiguration solution success rate, efficiency, and quality under different redundant resource states of the network [14].…”

Section: Introductionmentioning

confidence: 99%

Enhancing low‐priority traffic reconfiguration designs in mixed‐critical avionics networks

Xiong

2023

IET Communications

Self Cite

View full text Add to dashboard Cite

In avionics system networking, mixed‐critical networks are commonly used to integrate system applications with different levels of guarantees for various traffic classes on a shared resource platform, effectively addressing issues such as cabling, cost, weight, volume, power consumption, etc. However, current fault recovery and reconfiguration techniques mainly focus on high‐priority time‐triggered (TT) traffic, often neglecting the impact of TT traffic reconfiguration on low‐priority traffic. This paper proposes an avionics mixed‐critical networking approach based on the IEEE 802.1CB protocol, which is shown to be more effective for the post‐failure recovery of Rate‐Constrained (RC) traffic (a typical type of low‐priority traffic in TT networks). Furthermore, an elastic reconfiguration algorithm is presented to ensure quality of service for RC traffic during and after reconfiguration, preventing arbitrary application and traffic shutdown triggered by TT traffic reconfiguration. Simulations demonstrate that the proposed approach and algorithm can significantly improve the post‐failure recovery ratio of RC traffic, as well as guarantee quality of service and network throughput of RC traffic during and after reconfiguration to a certain extent.

show abstract