Artículo
On route table computation strategies in Delay-Tolerant Satellite Networks
Fecha de publicación:
11/2018
Editorial:
Elsevier Science
Revista:
Ad Hoc Networks
ISSN:
1570-8705
Idioma:
Inglés
Tipo de recurso:
Artículo publicado
Clasificación temática:
Resumen
Delay-Tolerant Networking (DTN) has been proposed for satellite networks with no expectation of continuous or instantaneous end-to-end connectivity, which are known as Delay-Tolerant Satellite Networks (DTSNs). Path computation over large and highly-dynamic yet predictable topologies of such networks requires complex algorithms such as Contact Graph Routing (CGR) to calculate route tables, which can become extremely large and limit forwarding performance if all possible routes are considered. In this work, we discuss these issues in the context of CGR and propose alternatives to the existing route computation scheme: first-ending, first-depleted, one-route, and per-neighbor strategies. Simulation results over realistic DTSN constellation scenarios show that network flow metrics and overall calculation effort can be significantly improved by adopting these novel route table computation strategies.
Archivos asociados
Licencia
Identificadores
Colecciones
Articulos(IDIT)
Articulos de INSTITUTO DE ESTUDIOS AVANZADOS EN INGENIERIA Y TECNOLOGIA
Articulos de INSTITUTO DE ESTUDIOS AVANZADOS EN INGENIERIA Y TECNOLOGIA
Citación
Fraire, Juan Andres; Madoery, Pablo Gustavo; Charif, Amir (EXT); Finochietto, Jorge Manuel; On route table computation strategies in Delay-Tolerant Satellite Networks; Elsevier Science; Ad Hoc Networks; 80; 11-2018; 31-40
Compartir
Altmétricas