Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations
Existing Internet protocols assume persistent end-to-end connectivity, which cannot be guaranteed in disruptive and high-latency space environments. To operate over these challenging networks, a store-carry-and-forward communication architecture called Delay/Disruption Tolerant Networking (DTN) has...
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-01-01
|
| Series: | Journal of Computer Networks and Communications |
| Online Access: | http://dx.doi.org/10.1155/2017/2830542 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832545448234057728 |
|---|---|
| author | J. A. Fraire P. Madoery S. Burleigh M. Feldmann J. Finochietto A. Charif N. Zergainoh R. Velazco |
| author_facet | J. A. Fraire P. Madoery S. Burleigh M. Feldmann J. Finochietto A. Charif N. Zergainoh R. Velazco |
| author_sort | J. A. Fraire |
| collection | DOAJ |
| description | Existing Internet protocols assume persistent end-to-end connectivity, which cannot be guaranteed in disruptive and high-latency space environments. To operate over these challenging networks, a store-carry-and-forward communication architecture called Delay/Disruption Tolerant Networking (DTN) has been proposed. This work provides the first examination of the performance and 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 identify existing CGR weaknesses and enhancement opportunities. |
| format | Article |
| id | doaj-art-7d7cc4e0af7a4136886ee37ce328982a |
| institution | Kabale University |
| issn | 2090-7141 2090-715X |
| language | English |
| publishDate | 2017-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Computer Networks and Communications |
| spelling | doaj-art-7d7cc4e0af7a4136886ee37ce328982a2025-02-03T07:25:50ZengWileyJournal of Computer Networks and Communications2090-71412090-715X2017-01-01201710.1155/2017/28305422830542Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite ConstellationsJ. A. Fraire0P. Madoery1S. Burleigh2M. Feldmann3J. Finochietto4A. Charif5N. Zergainoh6R. Velazco7Université Grenoble-Alpes, INPG, TIMA Laboratoires, Grenoble, FranceUniversidad Nacional de Córdoba-CONICET, Laboratorios LCD, Córdoba, ArgentinaJet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, USAFaculty of Computer Science, Technische Universität Dresden, Dresden, GermanyUniversidad Nacional de Córdoba-CONICET, Laboratorios LCD, Córdoba, ArgentinaUniversité Grenoble-Alpes, INPG, TIMA Laboratoires, Grenoble, FranceUniversité Grenoble-Alpes, INPG, TIMA Laboratoires, Grenoble, FranceUniversité Grenoble-Alpes, INPG, TIMA Laboratoires, Grenoble, FranceExisting Internet protocols assume persistent end-to-end connectivity, which cannot be guaranteed in disruptive and high-latency space environments. To operate over these challenging networks, a store-carry-and-forward communication architecture called Delay/Disruption Tolerant Networking (DTN) has been proposed. This work provides the first examination of the performance and 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 identify existing CGR weaknesses and enhancement opportunities.http://dx.doi.org/10.1155/2017/2830542 |
| spellingShingle | J. A. Fraire P. Madoery S. Burleigh M. Feldmann J. Finochietto A. Charif N. Zergainoh R. Velazco Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations Journal of Computer Networks and Communications |
| title | Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations |
| title_full | Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations |
| title_fullStr | Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations |
| title_full_unstemmed | Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations |
| title_short | Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations |
| title_sort | assessing contact graph routing performance and reliability in distributed satellite constellations |
| url | http://dx.doi.org/10.1155/2017/2830542 |
| work_keys_str_mv | AT jafraire assessingcontactgraphroutingperformanceandreliabilityindistributedsatelliteconstellations AT pmadoery assessingcontactgraphroutingperformanceandreliabilityindistributedsatelliteconstellations AT sburleigh assessingcontactgraphroutingperformanceandreliabilityindistributedsatelliteconstellations AT mfeldmann assessingcontactgraphroutingperformanceandreliabilityindistributedsatelliteconstellations AT jfinochietto assessingcontactgraphroutingperformanceandreliabilityindistributedsatelliteconstellations AT acharif assessingcontactgraphroutingperformanceandreliabilityindistributedsatelliteconstellations AT nzergainoh assessingcontactgraphroutingperformanceandreliabilityindistributedsatelliteconstellations AT rvelazco assessingcontactgraphroutingperformanceandreliabilityindistributedsatelliteconstellations |