Assessing DTN architecture reliability for distributed satellite constellations: Preliminary results from a case study

Fraire, Juan A.; Ferreyra, P.

doi:10.1109/argencon.2014.6868551

Cited by 11 publications

(10 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One is caused by uncertain effects of external radiation on the satellite-carried hardware, in which a single event-upset phenomenon can be modeled of a Poisson distribution with a fault parameter λ [13] . Another is the link delay jitter.…”

Section: Dealing With the Exceptionmentioning

confidence: 99%

A Novel DTN Routing Algorithm in the GEO-Relaying Satellite Network

Yang

Zhang

2015

2015 11th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)

View full text Add to dashboard Cite

Disruption-Tolerant Networks provides store-andforward enabled routing strategies for the satellite networks with frequently intermittent links. However, current dynamic route selection algorithm (DRSA), including Contact Graph Routing (CGR) algorithm, could not find an end-to-end route over a serial of link segments with time-disjointed contacts. In this paper, we proposed a novel routing algorithm as expanding range route selection (ERRS), which could find the EDT-optimal route by searching at each snapshot of time-varying topology. The proposed algorithm is compared with DRSA on the Linuxbased experimental platform with built-in ION (Interplanetary Overlay Networks) software. The results show our algorithm has less delivery time and the obviously improved throughput of the network.

show abstract

Section: Dealing With the Exceptionmentioning

confidence: 99%

A Novel DTN Routing Algorithm in the GEO-Relaying Satellite Network

Yang

Zhang

2015

2015 11th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)

View full text Add to dashboard Cite

show abstract

“…Supposedly, there is no benefit in tracking the rest of the hops in the route path as the forwarding decision is not necessarily deterministic in the following nodes. Despite this congestion mitigation mechanism resulted a reasonable approach for initial CGR evaluations, it does not consider the complete path capacity nor storage limitation of intermediate nodes, leading to unwanted traffic‐bouncing effects in several scenarios as reported in Fraire et al Moreover, the latter effect becomes more severe when traffic scheduled by remote nodes is also expected to flow through these congested links or buffers.…”

Section: Introductionmentioning

confidence: 99%

Congestion management techniques for disruption‐tolerant satellite networks

Madoery

Fraire

Finochietto

2017

Satell Commun Network

Self Cite

View full text Add to dashboard Cite

Delay and disruption-tolerant networks are becoming an appealing solution for extending Internet boundaries toward challenged environments where end-to-end connectivity cannot be guaranteed. In particular, satellite networks can take advantage of a priori trajectory estimations of nodes to make efficient routing decisions. Despite this knowledge is already used in routing schemes such as contact graph routing, it might derive in congestion problems because of capacity overbooking of forthcoming connections (contacts). In this work, we initially extend contact graph routing to provide enhanced congestion mitigation capabilities by taking advantage of the local traffic information available at each node. However, since satellite networks data generation is generally managed by a mission operation center, a global view of the traffic can also be exploited to further improve the latter scheme. As a result, we present a novel strategy to avoid congestion in predictable delay-and disruption-tolerant network systems by means of individual contact plans. Finally, we evaluate and compare the performance improvement of these mechanisms in a typical low Earth orbit satellite constellation. KEYWORDScontact graph routing, congestion management, delay and disruption tolerant networks, satellite networks INTRODUCTIONTraditionally, Earth observation satellites have been designed to periodically gather data from large ground areas. However, the increasing need of timely and on-demand data (images, videos, etc) is demanding a paradigm shift toward better acquisition rates and improved data delivery. To this end, recent research has shown that low Earth orbit (LEO) satellite networks can meet these requirements by significantly enhancing both coverage and revisit time among other benefits. 1 In particular, this spatial diversity not only allows for unprecedented applications by combining sensors for wider aperture, better footprint, or sensing diversity but also presents additional opportunities for data downlink to ground stations. 2 Indeed, by relying on intersatellite links (ISLs) among the orbiting assets, traffic can flow through multiple hops toward its destination on Earth improving both system capacity and data delivery time. However, maintaining a persistent end-to-end connection between the origin of the data and its destination in orbiting constellations demands strict flight-formation requirements 3 and might require prohibitive amounts of communication resources. 4 As a result, embracing delay-and disruption-tolerant networks (DTNs) 5 as the underlying communications architecture has recently been recognized as an alternative solution for building future satellite applications. 6Originally studied to develop a network architecture for the interplanetary Internet, 7 DTN has been specified as a communication architecture for environments where communications can be challenged by either latency, bandwidth, errors, or stability issues. 8 In particular, to overcome disruption, DTN nodes implement a temporary storage where d...

show abstract

“…In [43], the reliability of opportunistic DTNs was studied, but their results do not apply to the space domain where communications are deterministic. More recently, authors have presented preliminary results on a reliability assessment of DTN for space applications [44]. However, the provided simulation analysis was based on simplistic satellite networks without a comprehensive analysis on the behavior of the underlying routing algorithm.…”

Section: Introductionmentioning

confidence: 99%

“…In this work, we tackle the weaknesses of [44] by providing an extensive fault injection analysis based on two appealing and realistic case studies of delay-tolerant satellite constellations previously presented in [10]. An initial performance comparison of these topologies is one of the contributions of this work.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations

Fraire

Madoery

Burleigh

et al. 2017

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

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.

show abstract

Assessing DTN architecture reliability for distributed satellite constellations: Preliminary results from a case study

Cited by 11 publications

References 15 publications

A Novel DTN Routing Algorithm in the GEO-Relaying Satellite Network

A Novel DTN Routing Algorithm in the GEO-Relaying Satellite Network

Congestion management techniques for disruption‐tolerant satellite networks

Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations

Contact Info

Product

Resources

About