Routing Heterogeneous Traffic in Delay Tolerant Satellite Networks

Abstract

Delay-tolerant networking (DTN) offers a novel architecture that can be used to enhance store-carry-forward routing in satellite networks. Since these networks can take advantage of scheduled contact plans, distributed algorithms like the Contact Graph Routing (CGR) can be utilized to optimize data delivery performance. However, despite the numerous improvements made to CGR, there is a lack of proposals to prioritize traffic with distinct quality of service (QoS) requirements. This study presents adaptations to CGR to improve QoScompliant delivery ratio when transmitting traffic with different latency constraints, along with an integer linear programming optimization model that serves as a performance upper bound. The extensive results obtained by simulating different scenarios show that the proposed algorithms can effectively improve the delivery ratio and energy efficiency while meeting latency constraints.

Routing Heterogeneous Traffic in Delay-Tolerant Satellite Networks

“…Second, we model the problem using a integer linear programming optimization model that provides a performance upper bound. This paper is an extended version of [20] and includes additional contributions such as an improved description of the CGR-Hops routing scheme, a new multi-objective routing scheme called CGR-MO, and new performance metrics for evaluation. In addition, we have extensively evaluated a realistic Walker-Delta constellation scenario and our numerical results demonstrate improvements in delivery ratio and energy efficiency while meeting maximum delay requirements.…”