Answers are grounded in this paper and cite their sources.
Remote-sensing satellite–terrestrial networks (RSTNs) with mobile edge computing (MEC) support the processing of Earth-observation data submitted by ground terminals. However, when these applications comprise multiple subtasks with strict data dependencies, their concurrent execution over satellites with limited buffers and an unreliable inter-satellite link (ISL) introduces severe risks of system deadlocks and task non-completion. A robust deadlock avoidance policy (robust DAP) for dependent task offloading in RSTNs with an unreliable ISL and limited buffers (RSTN-UILB) is developed in this study to address this issue. Specifically, a Petri net is constructed to characterize task dependencies, buffer constraints, and autonomous ISL disruption and recovery. Based on this model, robust-completable states and robust DAPs are defined, and a necessary and sufficient condition for preserving a permitted task-only completion path from every controlled reachable state is established. A robust modified banker’s algorithm (RMBA) is designed to certify robust completability. Leveraging the RMBA, a robust DAP is synthesized to preserve robust nonblocking with initial RMBA certification, with polynomial evaluation complexity. Extensive simulations show near-optimal mean robust permissiveness on fully enumerated test instances at substantially lower average certification cost than exhaustive search. Experiments demonstrate broader observed permission than conservative admission and completion across diverse network scales and heterogeneous buffers.
No takes yet. Share an insight, caveat, or question.
Yang et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: