4 June 2025 in IEEE Transactions on Network and Service Management
Time-Triggered Ethernet (TTEthernet) has been widely applied in many scenarios such as industrial internet, automotive electronics, and aerospace, where offline routing and scheduling for TTEthernet has been largely investigated. However, predetermined routes and schedules cannot meet the demands in some agile scenarios, such as smart factories, autonomous driving, and satellite network switching, where the transmission requests join in and leave the network frequently. Thus, we study the online joint routing and scheduling problem for TTEthernet. However, balancing efficient and effective routing and scheduling in an online environment can be quite challenging. To ensure high-quality and fast routing and scheduling, we first design a time-slot expanded graph (TSEG) to model the available resources of TTEthernet over time. The fine-grained representation of TSEG allows us to select a time slot via selecting an edge, thus transforming the scheduling problem into a simple routing problem. Next, we design a dynamic weighting method for each edge in TSEG and further propose an algorithm to co-optimize the routing and scheduling. Our scheme enhances the TTEthernet throughput by co-optimizing the routing and scheduling to eliminate potential conflicts among flow requests, as compared to existing methods. The extensive simulation results show that our scheme runs >400 times faster than standard solutions (i.e., ILP solver), while the gap is only 2% to the optimally scheduled number of flow requests. Besides, as compared to existing schemes, our method can improve the successfully scheduled number of flows by more than 18%.
25 November 2025 in IEEE Communications Letters
The low cost, compact design, and flexible mission capabilities of microsatellites have accelerated the growth of the microsatellite industry. However, their limited weight and volume budgets constrain the number of available onboard transceivers, posing a fundamental challenge known as the Contact Plan Design (CPD) problem, which involves scheduling inter-satellite communications. While several approaches, such as MILP and heuristic methods, have been proposed to address the CPD problem, these methods either incur high computational complexity or suffer from suboptimal end-to-end delay, making them unsuitable for online, time-critical missions in microsatellite networks. To overcome these limitations, we propose an efficient graph-based online contact plan design scheme. We first construct a novel graph representation, referred to as the contact plan graph, that unifies the modeling of transceiver availability and constraints, as well as storage and communication resources in the satellite network. This formulation transforms the online CPD into a pathfinding problem, significantly reducing computational overhead. Building on this, a customized shortest-path algorithm is developed, tailored to transceiver constraints such as half-duplex operation and single transceiver limitation. Simulation results under realistic satellite network settings demonstrate that our method achieves substantial improvements of up to 29% in end-to-end delay and over $6400\times $ in runtime compared to state-of-the-art baselines.