Abstract

To tackle the network congestion problem caused by ground gateway stations arranged within a limited area in low earth orbit (LEO) satellite networks, a routing algorithm based on segment routing for traffic return is proposed. Light and heavy load zones are dynamically divided according to the relative position relationship between gateways and the reverse slot. The pre-balancing shortest path algorithm is used in the light load zone, and the minimum weight path defined by congestion index is the routing rule in the heavy load zone. Then, the consistent forwarding is performed referring to segment routing in all zones. Simulation conditions are different sizes of heavy load zone, different traffic density distributions, and different traffic demands. Simulation results confirm that the load-balancing performance is improved significantly with the extension of the heavy load zone size in terms of the average rejection ratio, the average relative throughput, the maximum link utilization, and the average delay. The proposed algorithm is an alternative solution and guidance for routing strategy in LEO satellite networks.

Highlights

  • Low earth orbit (LEO) satellite networks, represented by Iridium [1] and Starlink [2], are designed to supply global coverage and real-time services, and contribute to the development of space-ground integrated communication systems [3]

  • The load-balancing routing algorithm based on segment routing is proposed for LEO satellite networks

  • The network congestion caused by gateways arranged within a limited area is improved

Read more

Summary

INTRODUCTION

Low earth orbit (LEO) satellite networks, represented by Iridium [1] and Starlink [2], are designed to supply global coverage and real-time services, and contribute to the development of space-ground integrated communication systems [3]. The load-balancing routing algorithm based on segment routing (SR) is proposed for the LSN traffic return under the centralized distribution of gateways. A SR end-to-end routing algorithm in SDN uses betweenness centrality and congestion index to define the link weight, and obtains the forwarding path which improve network throughput [16]. Another SR routing algorithm in SDN combines the multiple objective particle swarm optimization algorithm and builds a three-layer evaluation model of key performance evaluation index, business scheme, and evaluation results [17]. Communication channels are considered ideal channels, regardless of attenuation, multipath, and so on, and mobility management is simplified as an ideal way without abnormal addressing

TRAFFIC TRANSMISSION MODEL
PROBLEM DEFINITION
TIME COMPLEXITY
SIMULATION RESULT
Findings
CONCLUSION
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.