Routing-aware fair contact plan design for predictable delay tolerant networks
- Autores
- Fraire, Juan Andres; Finochietto, Jorge Manuel
- Año de publicación
- 2014
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- Delay tolerant networks (DTNs) have become a promising solution for extending Internet boundaries to challenged environments such as satellite constellations. In this context, strategies to exploit scarce communication opportunities, while still considering device and application constraints, are still to be investigated to enable the actual deployment of these networks. In particular, the Contact Graph Routing (CGR) scheme has been proposed as it takes advantage of the contact plan, which comprises all future contacts among nodes. However, resource constraints can forbid the totality of these contacts to belong to the contact plan; thus, only those which together meet an overall goal shall be selected. In this article, we consider the problem of designing a contact plan that can provide fairness in link assignment and minimal all-to-all route delay; therefore, achieving equal contact opportunities while favoring end-to-end traffic latency. We formalize this by means of a multi-objective optimization model that can be computationally intractable for large topologies; thus, heuristic algorithms are proposed to compute the contact plan in practice. Finally, we analyze general results from these routines and discuss how they can used to provision valuable contact plans for real networks.
Fil: Fraire, Juan Andres. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba; Argentina
Fil: Finochietto, Jorge Manuel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba; Argentina - Materia
-
Delay Tolerant Networks
Dtn
Contact Plan Design
Satellite Constellations - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Consejo Nacional de Investigaciones Científicas y Técnicas
- OAI Identificador
- oai:ri.conicet.gov.ar:11336/34071
Ver los metadatos del registro completo
id |
CONICETDig_6e778b84b1f5998bc91722b8309d76d4 |
---|---|
oai_identifier_str |
oai:ri.conicet.gov.ar:11336/34071 |
network_acronym_str |
CONICETDig |
repository_id_str |
3498 |
network_name_str |
CONICET Digital (CONICET) |
spelling |
Routing-aware fair contact plan design for predictable delay tolerant networksFraire, Juan AndresFinochietto, Jorge ManuelDelay Tolerant NetworksDtnContact Plan DesignSatellite Constellationshttps://purl.org/becyt/ford/2.2https://purl.org/becyt/ford/2Delay tolerant networks (DTNs) have become a promising solution for extending Internet boundaries to challenged environments such as satellite constellations. In this context, strategies to exploit scarce communication opportunities, while still considering device and application constraints, are still to be investigated to enable the actual deployment of these networks. In particular, the Contact Graph Routing (CGR) scheme has been proposed as it takes advantage of the contact plan, which comprises all future contacts among nodes. However, resource constraints can forbid the totality of these contacts to belong to the contact plan; thus, only those which together meet an overall goal shall be selected. In this article, we consider the problem of designing a contact plan that can provide fairness in link assignment and minimal all-to-all route delay; therefore, achieving equal contact opportunities while favoring end-to-end traffic latency. We formalize this by means of a multi-objective optimization model that can be computationally intractable for large topologies; thus, heuristic algorithms are proposed to compute the contact plan in practice. Finally, we analyze general results from these routines and discuss how they can used to provision valuable contact plans for real networks.Fil: Fraire, Juan Andres. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba; ArgentinaFil: Finochietto, Jorge Manuel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba; ArgentinaElsevier Science2014-06info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/34071Fraire, Juan Andres; Finochietto, Jorge Manuel; Routing-aware fair contact plan design for predictable delay tolerant networks; Elsevier Science; Ad Hoc Networks; 25; B; 6-2014; 303-3131570-8705CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.adhoc.2014.07.006info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S1570870514001371info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-10T13:05:20Zoai:ri.conicet.gov.ar:11336/34071instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-10 13:05:20.672CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse |
dc.title.none.fl_str_mv |
Routing-aware fair contact plan design for predictable delay tolerant networks |
title |
Routing-aware fair contact plan design for predictable delay tolerant networks |
spellingShingle |
Routing-aware fair contact plan design for predictable delay tolerant networks Fraire, Juan Andres Delay Tolerant Networks Dtn Contact Plan Design Satellite Constellations |
title_short |
Routing-aware fair contact plan design for predictable delay tolerant networks |
title_full |
Routing-aware fair contact plan design for predictable delay tolerant networks |
title_fullStr |
Routing-aware fair contact plan design for predictable delay tolerant networks |
title_full_unstemmed |
Routing-aware fair contact plan design for predictable delay tolerant networks |
title_sort |
Routing-aware fair contact plan design for predictable delay tolerant networks |
dc.creator.none.fl_str_mv |
Fraire, Juan Andres Finochietto, Jorge Manuel |
author |
Fraire, Juan Andres |
author_facet |
Fraire, Juan Andres Finochietto, Jorge Manuel |
author_role |
author |
author2 |
Finochietto, Jorge Manuel |
author2_role |
author |
dc.subject.none.fl_str_mv |
Delay Tolerant Networks Dtn Contact Plan Design Satellite Constellations |
topic |
Delay Tolerant Networks Dtn Contact Plan Design Satellite Constellations |
purl_subject.fl_str_mv |
https://purl.org/becyt/ford/2.2 https://purl.org/becyt/ford/2 |
dc.description.none.fl_txt_mv |
Delay tolerant networks (DTNs) have become a promising solution for extending Internet boundaries to challenged environments such as satellite constellations. In this context, strategies to exploit scarce communication opportunities, while still considering device and application constraints, are still to be investigated to enable the actual deployment of these networks. In particular, the Contact Graph Routing (CGR) scheme has been proposed as it takes advantage of the contact plan, which comprises all future contacts among nodes. However, resource constraints can forbid the totality of these contacts to belong to the contact plan; thus, only those which together meet an overall goal shall be selected. In this article, we consider the problem of designing a contact plan that can provide fairness in link assignment and minimal all-to-all route delay; therefore, achieving equal contact opportunities while favoring end-to-end traffic latency. We formalize this by means of a multi-objective optimization model that can be computationally intractable for large topologies; thus, heuristic algorithms are proposed to compute the contact plan in practice. Finally, we analyze general results from these routines and discuss how they can used to provision valuable contact plans for real networks. Fil: Fraire, Juan Andres. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba; Argentina Fil: Finochietto, Jorge Manuel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba; Argentina |
description |
Delay tolerant networks (DTNs) have become a promising solution for extending Internet boundaries to challenged environments such as satellite constellations. In this context, strategies to exploit scarce communication opportunities, while still considering device and application constraints, are still to be investigated to enable the actual deployment of these networks. In particular, the Contact Graph Routing (CGR) scheme has been proposed as it takes advantage of the contact plan, which comprises all future contacts among nodes. However, resource constraints can forbid the totality of these contacts to belong to the contact plan; thus, only those which together meet an overall goal shall be selected. In this article, we consider the problem of designing a contact plan that can provide fairness in link assignment and minimal all-to-all route delay; therefore, achieving equal contact opportunities while favoring end-to-end traffic latency. We formalize this by means of a multi-objective optimization model that can be computationally intractable for large topologies; thus, heuristic algorithms are proposed to compute the contact plan in practice. Finally, we analyze general results from these routines and discuss how they can used to provision valuable contact plans for real networks. |
publishDate |
2014 |
dc.date.none.fl_str_mv |
2014-06 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
format |
article |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://hdl.handle.net/11336/34071 Fraire, Juan Andres; Finochietto, Jorge Manuel; Routing-aware fair contact plan design for predictable delay tolerant networks; Elsevier Science; Ad Hoc Networks; 25; B; 6-2014; 303-313 1570-8705 CONICET Digital CONICET |
url |
http://hdl.handle.net/11336/34071 |
identifier_str_mv |
Fraire, Juan Andres; Finochietto, Jorge Manuel; Routing-aware fair contact plan design for predictable delay tolerant networks; Elsevier Science; Ad Hoc Networks; 25; B; 6-2014; 303-313 1570-8705 CONICET Digital CONICET |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.adhoc.2014.07.006 info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S1570870514001371 |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/ |
dc.format.none.fl_str_mv |
application/pdf application/pdf application/pdf application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier Science |
publisher.none.fl_str_mv |
Elsevier Science |
dc.source.none.fl_str_mv |
reponame:CONICET Digital (CONICET) instname:Consejo Nacional de Investigaciones Científicas y Técnicas |
reponame_str |
CONICET Digital (CONICET) |
collection |
CONICET Digital (CONICET) |
instname_str |
Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.name.fl_str_mv |
CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas |
repository.mail.fl_str_mv |
dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar |
_version_ |
1842980193944207360 |
score |
12.993085 |