The Delay‐/Disruption‐Tolerant Networking (DTN) architecture was designed to cope with challenges such as long delays and intermittent connectivity. To exploit the a priori knowledge of contacts, typical of space networks, NASA‐JPL designed and included in ION (its DTN protocol suite) the Contact Graph Routing (CGR) algorithm. This paper studies the latest version, recently standardized as Schedule‐Aware Bundle Routing (SABR) within the Consultative Committee for Space Data Systems (CCSDS). The first part of the paper is devoted to the algorithm analysis, which distinguishes three logical phases to examine sequentially. Following this comprehensive study, three enhancements are proposed, which aim to improve SABR accuracy and resistance against possible loops. They are studied on a simple but challenging DTN topology, implemented on a virtual GNU/Linux testbed. Tests are performed by running the latest version of ION and an independent implementation of SABR developed by the authors, Unibo‐CGR. The numerical results are then examined in detail to highlight both SABR mechanisms and the advantages offered by the proposed enhancements.

中文翻译：

---

Schedule-Aware捆绑路由：分析和增强

延迟/中断容忍网络（DTN）架构旨在应对诸如长延迟和间歇性连接之类的挑战。为了利用空间网络典型的联系方式的先验知识，NASA-JPL设计并在ION（其DTN协议套件）中包括了联系图路由（CGR）算法。本文研究了最新版本，最近在空间数据系统协商委员会（CCSDS）中被标准化为“计划感知的捆绑路由（SABR）”。本文的第一部分致力于算法分析，它区分了三个逻辑阶段以进行顺序检查。在进行了这项全面研究之后，提出了三项增强措施，旨在提高SABR的精度和抵抗可能出现的环路的能力。他们是在简单但具有挑战性的DTN拓扑上进行研究的，在虚拟GNU / Linux测试平台上实现。通过运行最新版本的ION和作者Unibo-CGR开发的SABR的独立实现来执行测试。然后详细检查数值结果，以突出显示SABR机制和建议的增强功能所提供的优点。