Research and Design of a SpaceWire Network Dynamic Reconfiguration Method Based on Dijkstra Algorithm
Rui Du, Haidong Fei, Weigong Zhang, Xingyou Wang · 2016
SpaceWire is a full-duplex, point-to-point, high-speed serial data transfer standard which is intended for use in further on-board spacecraft, space missions and applications. However, space environment is harsh and complex which requires a communication network with high reliability. It is inevitable that SpaceWire network link fault or SpaceWire equipment damage is able to change the SpaceWire network status. Therefore, traditional static routing configuration cannot efficiently solve the network fault recovery problem. In this paper, our research is divided into three parts. First of all, we design a simulation and test platform for SpaceWire network by using 7 SpaceWire communication nodes and 3 SpaceWire routers. This SpaceWire network platform is the foundation for the next work. Secondly, we introduce the SpaceWire routing protocol and Dijkstra algorithm principle. Thirdly, in order to improve the reliability of SpaceWire network and restore communication fault, we propose a SpaceWire network dynamic reconfiguration method based on Dijkstra algorithm. By analyzing the check information from SpaceWire router ports and communication nodes, it dynamically calculates optimal routing paths and reconfigures the SpaceWire network routers when there is a fault on SpaceWire network. Based on the simulation and test platform for SpaceWire network, we complete the software design and implementation of this method. Verification result demonstrates that the method can perform real-time network reconfiguration and path optimization when a SpaceWire network fault occurs, improve the ability of self-adaptive of SpaceWire network and enhance the reliability and transmit efficiency as well.