Journal of Northeastern University ›› 2011, Vol. 32 ›› Issue (6): 795-797+801.DOI: -

• OriginalPaper • Previous Articles     Next Articles

A multipath routing algorithm for space information networks

Liu, Jun (1); Liu, Xiang-Jun (2); Ye, Ning (1); Sha, Yi (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110819, China; (2) China National Software and Service Co., Ltd., Beijing 100081, China
  • Received:2013-06-19 Revised:2013-06-19 Published:2013-04-04
  • Contact: Liu, J.
  • About author:-
  • Supported by:
    -

Abstract: A multipath routing algorithm is proposed for space information networks on the basis of a deep interview to its characteristics. In the algorithm, a space information network topology is divided into backbone and non-backbone. Since the motions of backbone nodes are periodic and predictive, routs between them are statically configured. In the static configuration, each node is assigned a selection factor that indicates the probability to be selected in a certain route, which effectively avoids network bottleneck. Routs containing non-backbone nodes as a part are generated on demand for dramatic change of non-backbone topology, which makes overhead of rout maintaining under tight control. Multipath routing is constructed adaptively according to network environment, and a load balance mechanism is also designed to balance load among multipath. Rout maintaining automatically operates on the change of topology, which improves autonomous ability of the network. Simulation results show that the proposed algorithm has a fast convergence speed with little cost, and improves network processing ability, which indicates the algorithm well suits space information networks.

CLC Number: