A Minimum Task-Based End-to-end Delivery Delay Routing Strategy With Updated Discrete Graph for Satellite Disruption-Tolerant Networks

Recently, a variety of time-varying graphs, such as space-time graph and event-driven graph, are widely employed for modelling the dynamic topologies of satellite Disruption-Tolerant Networking (DTN) network with periodic orbital motions of satellite platforms. As the major criterion of delivering a file of targeted data, however, Task-based End-to-end Delivery Delay (TEDD) is hardly evaluated by using the current methods of graphs due to their intrinsic incapability in precision. In this paper, a topology-driven Updated Discrete Graph (UDG) is proposed for confining the low bound of TEDD with a given delivery task by using a tailored edges capacity. In particular, a Minimum TEDD Routing Strategy (MTRS) is designed through solving a correspondingly integral Min-Max optimization problem. The simulation results verifies the advantage of MTRS for TEDD compared with two typical graph algorithms under a group of specific satellite network scenarios.