: Mobile edge services require deterministic communication across Time-Sensitive Networking (TSN) and 5G access, where the standardized integration architecture exposes the 5G System (5GS) to the TSN controller as a logical bridge. We study dynamic admission of time-triggered (TT) flows using reported 5GS bridge delay and TSN-to-5GS Quality of Service (QoS) mapping in route selection and Gate Control List (GCL) scheduling. Arrivals and departures can split available transmission time into noncontiguous windows. Online insertion preserves admitted schedules but may reduce subsequent schedulability, whereas full recomputation can restore schedulability but changes many routes and GCL entries, complicating coordinated activation. Coupling routing and GCL scheduling under timing, bridge-delay, QoS-mapping, and a bound on changes to admitted schedules yields an NP-hard problem. To address it, we propose a two-timescale scheduling mechanism. The fast timescale uses current 5GS bridge information to place arrivals without modifying admitted flows. Fragmented windows, repeated insertion failures, or changes in reported 5GS state invoke the slower timescale, which sequentially reschedules a bounded subset of admitted flows and commits only feasible improvements. At 0.95 offered load across A380, CEV, and Ring6, admission improves by 14.8–18.5 percentage points over online-only scheduling and remains within 1.7–2.2 points of full recomputation, while per-event runtime falls by over one order of magnitude with limited GCL changes.
Zhi-Hao Liu, Yi Zhang, Wei Zhang et al.· Computers, Materials & C...· 0 citations
Low Earth orbit (LEO) satellite networks exhibit rapidly changing topology and time-varying traffic hotspots, which makes hop-by-hop routing highly sensitive to local congestion and state staleness. Existing routing methods either rely on global path computation or use plain local observations, while graph-enhanced approaches often focus on generic neighborhood representation rather than direct comparison among candidate next hops. To address this issue, this paper proposes a Local Graph-Aware Routing method (LGAR) for dynamic LEO satellite networks. LGAR organizes the current node, reachable candidate neighbors, and candidate links into a local graph, and then constructs structured action representations through node encoding, relation message extraction, and attention-based context aggregation. The resulting representations are integrated into an off-policy actor-critic framework to support adaptive hop-by-hop routing decisions. Experiments under the hub-inversion setting show that LGAR achieves an average total delay of 47.64 ms and an average queueing delay of 5.81 ms while maintaining a delivery rate of 99.93%. Compared with MATMR, LGAR-NoGraph, and GRLR, LGAR reduces the average total delay by 12.38%, 12.85%, and 30.75%, respectively. Additional scenario, ablation, and scalability results further show that LGAR generalizes beyond the main setting and that its gain mainly comes from local graph modeling and relation-aware action encoding.
Wen-Xiang Zhang, Yiao Gao, Ke-Yan Bai et al.· 2026 8th International Confe...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
