The routing algorithm will be the key issue in LEO satellite constellation with rapid development of the inter satellite links, especially for the space-based IOT networks. In this paper, a load-balancing strategy for routing technology based on historical traffic of satellite links was proposed. On the basis of the traditional snapshot-based satellite routing algorithm, the past traffic of each link is involved in calculating the optimal path, and the distributed of traffic load in the whole constellation network was considered to optimize. The network congestion and packet loss that caused by high traffic load burden in the some hot area of satellite network was alleviated significantly by the proposed algorithm. The simulation results show that this method can effectively improve the delay performance degradation caused by the unbalanced traffic load of the network under high load conditions, which also reduces the packet loss rate and optimizes the delay stability of the service.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A load balancing routing method based on real time traffic in LEO satellite constellation space networks


    Contributors:
    Liming, Hou (author) / Shaoli, Kang (author) / Shaohui, Sun (author) / Deshan, Miao (author) / Bo, Han (author) / Meiting, Zhang (author)


    Publication date :

    2022-06-01


    Size :

    447436 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Maximum Persistence Routing in Satellite Constellation Networks

    Donner, Anton / Zamorano, Raul / Costache, Mihai | AIAA | 2004


    MPLS Traffic Engineering for LEO Satellite Constellation Networks

    Berioli, Matteo / Donner, Anton / Menichelli, Riccardo et al. | AIAA | 2003


    Internet Traffic Evaluation over LEO Satellite constellation networks

    Zong, P. / Cruickshank, H. / Sun, Z. et al. | British Library Conference Proceedings | 2001