Skip to main content

Multi-service Routing with Guaranteed Load Balancing for LEO Satellite Networks

  • Conference paper
  • First Online:
  • 1196 Accesses

Abstract

Low Earth Orbit (LEO) Satellite Networks (SN) offers communication services with low delay, low overhead, and flexible networking. As service types and traffic demands increase, the multi-service routing algorithms play an important role in ensuring users’ Quality of Service (QoS) requirements in LEO-SN. However, the multi-service routing algorithm only considers the link QoS information, ignoring the uneven distribution of ground users, causing satellite link or node congestion, increasing the packet transmission delay, and packet loss rate. In order to solve the above problems, we propose a Multi-Service Routing with Guaranteed Load Balancing (MSR-GLB) algorithm which balances the network load while satisfying multi-service QoS requirements. Firstly, the Geographic Location Information Factors (GLIF) are defined to balance the network load by scheduling the ISLs with lower loads. Then, the optimization objective function is constructed by considering delay, remaining bandwidth, packet loss rate, and GLIF in order to characterize the routing problems caused by multi-service and load balancing. Following this, we propose an MSR-GLB algorithm that includes the state transition rule and the pheromone update rule. Among them, the state transition rule is based on QoS information and link GLIF, and the pheromone update rule has the characteristics of positive and negative feedback mechanism. The simulation results show that the MSR-GLB algorithm can well meet the QoS requirements of different services, balance the network load compared to Cross-layer design and Ant-colony optimization based Load-balancing routing algorithm in LEO Satellite Network (CAL-LSN) and Multi-service On-demand Routing (MOR) algorithm.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    The ACO algorithm was proposed by the famous Italian scholar Dorigo [19] in 1991. The algorithm simulates that ants will leave a pheromone on the path when they are foraging. The concentration of the pheromone is inversely proportional to the path length and will volatilize as time passed. More specifically, the shorter path owns such more pheromone that it attracts a larger number of ants going along itself. After a period, the shortest path will always be selected.

References

  1. Radhakrishnan, R., Edmonson, W.W., Afghah, F., Rodriguez-Osorio, R.M., Pinto, F., Burleigh, S.C.: Survey of inter-satellite communication for small satellite systems: physical layer to network layer view. IEEE Commun. Surv. Tutorials 18(4), 2442–2473 (2016)

    Article  Google Scholar 

  2. Choi, J.P., Chang, S., Chan, V.W.S.: Cross-layer routing and scheduling for onboard processing satellites with phased array antenna. IEEE Trans. Wireless Commun. 16(1), 180–192 (2017)

    Article  Google Scholar 

  3. Werner, M.: A dynamic routing concept for ATM-based satellite personal communication networks. IEEE J. Sel. Areas Commun. 15(8), 1636–1648 (1997)

    Article  Google Scholar 

  4. Mauger, R., Rosenberg, C.: QoS guarantees for multimedia services on a TDMA-based satellite network. IEEE Commun. Mag. 35(7), 56–65 (1997)

    Article  Google Scholar 

  5. Hashimoto, Y., Sarikaya, B.: Design of IP-based routing in a LEO satellite network. In: Third International Workshop on Satellite-based Information Services, pp. 81–88 (1998)

    Google Scholar 

  6. Tan, H., Zhu, L.L.: A novel routing algorithm based on virtual topology snapshot in LEO satellite networks. In: IEEE 17th International Conference on Computational Science and Engineering, pp. 357–361 (2014)

    Google Scholar 

  7. Liu, Y., Zhu, L.: A suboptimal routing algorithm for massive LEO satellite networks. In: International Symposium on Networks, Computers and Communications (ISNCC), pp. 1–5 (2018)

    Google Scholar 

  8. Karapantazis, S., Papapetrou, E., Pavlidou, F.-N.: Multiservice on-demand routing in LEO satellite networks. In: IEEE Transactions on Wireless Communications, vol. 8, no. 1, pp. 107–112 (2009)

    Google Scholar 

  9. Jiang, W., Zong, P.: QoS routing algorithm based on traffic classification in LEO satellite networks. In: Eighth International Conference on Wireless and Optical Communications Networks, pp. 1–5 (2011)

    Google Scholar 

  10. Jiang, W., Zong, P.: A mew constellation network multi-service QoS routing algorithm. J. Jiangsu Univ. (Nat. Sci. Ed.) 34(4), 428–434 (2013)

    Google Scholar 

  11. Yang, L., Sun, J., Pan, C.: LEO multi-service routing algorithm based on multi-objective decision making. J. Commun. 37(10), 25–32 (2016)

    Google Scholar 

  12. Song, G., Chao, M., Yang, B., Zheng, Y.: TLR: a traffic-light-based intelligent routing strategy for NGEO satellite IP networks. IEEE Trans. Wireless Commun. 13(6), 3380–3393 (2014)

    Article  Google Scholar 

  13. Wang, H., Zhang, Q., Xin, X., Tao, Y., Liu, N.: Cross-layer design and ant-colony optimization based routing algorithm for low earth orbit satellite networks. China Commun. 10(10), 37–46 (2013)

    Article  Google Scholar 

  14. Liu, Z., Li, J., Wang, Y., Li, X., Chen, S.: HGL: a hybrid global-local load balancing routing scheme for the Internet of Things through satellite networks. Int. J. Distrib. Sens. Netw. 13(3) (2017)

    Google Scholar 

  15. Maine, K., Devieux, C., Swan, P.: Overview of IRIDIUM satellite network. In: WESCON 1995, p. 483 (1995)

    Google Scholar 

  16. Wood, L., Clerget, A., Andrikopoulos, I., Pavlou, G., Dabbous, W.: IP routing issues in satellite constellation networks. Int. J. Satell. Commun. 19(1), 69–92 (2001)

    Article  Google Scholar 

  17. Rao, Y., et al.: Agent-based multi-service routing for polar-orbit LEO broadband satellite networks. Ad Hoc Netw. 13(1), 575–597 (2014)

    Article  Google Scholar 

  18. Dai, Z.: Research on QoS routing under service classification system. Nanjing University of Posts and Telecommunications (2013)

    Google Scholar 

  19. Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 26(1), 29–41 (1996)

    Article  Google Scholar 

  20. Mouhcine, E., Khalifa, M., Mohamed, Y.: Route optimization for school bus scheduling problem based on a distributed ant colony system algorithm. In: 2017 Intelligent Systems and Computer Vision (ISCV), pp. 1–8 (2017)

    Google Scholar 

  21. Wen, G., et al.: Cross-layer design based ant colony optimization for routing and wavelength assignment in an optical satellite network. In: 2016 15th International Conference on Optical Communications and Networks (ICOCN), pp. 1–3 (2016)

    Google Scholar 

Download references

Acknowledgment

This work was jointly supported by the National Natural Science Foundation in China (61601075), the Natural Science Foundation Project of CQUPT (A2019-40).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cui-Qin Dai .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dai, CQ., Liao, G., Mathiopoulos, P.T., Chen, Q. (2020). Multi-service Routing with Guaranteed Load Balancing for LEO Satellite Networks. In: Gao, H., Feng, Z., Yu, J., Wu, J. (eds) Communications and Networking. ChinaCom 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 312. Springer, Cham. https://doi.org/10.1007/978-3-030-41114-5_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-41114-5_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-41113-8

  • Online ISBN: 978-3-030-41114-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics