Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations

ZERGAINOH, N.; FELDMANN, M.; FRAIRE, J. A.; CHARIF, A.; BURLEIGH, S.; VELAZCO, R.; FINOCHIETTO, J.; MADOERY, P.; ZERGAINOH, N.; FELDMANN, M.; FRAIRE, J. A.; CHARIF, A.; BURLEIGH, S.; VELAZCO, R.; FINOCHIETTO, J.; MADOERY, P.

Journal of Computer Networks and Communications

HINDAWI

Año: 2017 vol. 2017 p. 1 - 18

2090-7141

Existing Internet protocols assume persistent end-to-end connectivity, which cannot be guaranteed in disruptive and high-latencyspace environments. To operate over these challenging networks, a store-carry-and-forward communication architecture calledDelay/Disruption Tolerant Networking (DTN) has been proposed. This work provides the first examination of the performanceand robustness of Contact Graph Routing (CGR) algorithm, the state-of-the-art routing scheme for space-based DTNs. To this end,after a thorough description of CGR, two appealing satellite constellations are proposed and evaluated by means of simulations.Indeed, the DtnSim simulator is introduced as another relevant contribution of this work. Results enabled the authors to identifyexisting CGR weaknesses and enhancement opportunities.