scispace - formally typeset
Journal ArticleDOI

Dynamic Fault-Tolerant Routing Based on FSA for LEO Satellite Networks

Reads0
Chats0
TLDR
A boundary diffusion method is presented for the rectilinear-monotone orthogonal convex fault model such as the rectangular fault model and minimal-connected-component (MCC) faulty model, whereby an adaptive fault-tolerant routing algorithm, called X-Y boundary routing algorithm (X-YBRA), is present for deadlock-free fault-Tolerant adaptive routing outside the fault blocks.
Abstract
We formalize the construction of fault blocks by a state transition model based on finite state automata. Based on the model, a boundary diffusion method is presented for the rectilinear-monotone orthogonal convex fault model such as the rectangular fault model and minimal-connected-component (MCC) faulty model, whereby an adaptive fault-tolerant routing algorithm, called X-Y boundary routing algorithm (X-YBRA), is presented for deadlock-free fault-tolerant adaptive routing outside the fault blocks. To improve the network resources utilization, we put forward a routing diffusion method in the fault block, which completely solves the routing problem in the fault block. The experiment result shows that the diffusion overhead of our method is far lower than that of the traditional routing algorithms such as distance vector and link state routing algorithms with the light loss in convergence time. For the occurrence and recovery of random faults, the expansion and shrinkage of the fault block are also discussed. Accordingly, the dynamic boundary and routing updating methods are put forward to respond to these cases. Based on these methods, we develop low earth orbit satellite networks into an adaptive fault-tolerant system in routing. Our works can be also applied to other 2D mesh networks such as the interconnect multiprocessor computer systems.

read more

Citations
More filters
Journal ArticleDOI

Software-Defined Next-Generation Satellite Networks: Architecture, Challenges, and Solutions

TL;DR: A new software-defined architecture for next-generation satellite networks, called SoftSpace, is presented, which can not only reduce the capital expenditures and operational expenditures but also integrate satellite networks with terrestrial networks seamlessly, as well as can improve the interoperability of satellite network devices.
Journal ArticleDOI

Towards Energy-Efficient Routing in Satellite Networks

TL;DR: GreenSR can prolong the lifetime of satellite battery cells by more than 40%, with little increment in path length and a small link utilization ratio, and is proved that the EESR problem is NP-hard.
Proceedings ArticleDOI

Dynamically Adaptive Cooperation Transmission among Satellite-Ground Integrated Networks

TL;DR: An efficient transmission approach DEEPER (aDaptive satEllitE-ground cooPerativE tRasmission) based on dynamical cooperation among satellite and ground networks, which is network-aware and workload-driven is proposed.
Journal ArticleDOI

HGL: A hybrid global-local load balancing routing scheme for the Internet of Things through satellite networks:

TL;DR: Numerical simulations indicate that in contrast to single-strategy schemes, hybrid global-local load balancing routing scheme can more thoroughly eliminate congestion, and it performs better in measures such as packet loss rate, average queuing delay, traffic distribution, route oscillation, and communication overhead.
Journal ArticleDOI

Weighted Algebraic Connectivity Maximization for Optical Satellite Networks

TL;DR: This paper proposes two greedy heuristic methods to deal with the initialization and reconfiguration case from the relaxed solutions of heterogeneous optical satellite networks based on the perturbation theory of matrices.
References
More filters
Journal ArticleDOI

A survey of wormhole routing techniques in direct networks

TL;DR: The properties of direct networks are reviewed, and the operation and characteristics of wormhole routing are discussed in detail, along with a technique that allows multiple virtual channels to share the same physical channel.
Proceedings ArticleDOI

Planar-adaptive routing: low-cost adaptive networks for multiprocessors

TL;DR: This paper provides the simplest known support for deadlock-free adaptive routing in k-ary n-cubes of more than two dimensions (with k > 2) and restricts adaptivity reduces the hardware complexity, improving router speed or allowing additional performance-enhancing network features.
Journal ArticleDOI

A distributed routing algorithm for datagram traffic in LEO satelitte networks

TL;DR: A datagram routing algorithm for LEO satellite networks is introduced that generates minimum propagation delay paths and the performance of the algorithm is evaluated through simulations.
Journal ArticleDOI

Fault-tolerant wormhole routing algorithms for mesh networks

TL;DR: It is shown that, using just one extra virtual channel per physical channel, the well known e cube algorithm can be used to provide deadlock free routing in networks with nonoverlapping fault rings and it is proved that at most four additional virtual channels are sufficient to make fully adaptive algorithms tolerant to multiple faulty blocks in n dimensional meshes.
Journal ArticleDOI

A dynamic routing concept for ATM-based satellite personal communication networks

TL;DR: An ATM-based implementation of DT-DVTR in LEO satellite ISL networks is presented with some emphasis on the optimization alternatives, and the performance in terms of delay jitter is evaluated for an example ISL topology.
Related Papers (5)