Routing and Wavelength Assignment Algorithm for LEO Satellite Based on Path Weight

Mai Yang, Ying Tao*, Qi Zhang, Xiangjun Xin, Dong Chen, Qinghua Tian, Feng Tian, Jinxi Qian, Chendi Feng, Rongzhen Xie

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

Routing and wavelength assignment algorithms for Low Earth Orbit (LEO) satellite communication are studied in this paper. Based on intersatellite hops and wavelength utilization, the calculation model of path weight is established. In order to achieve the optimal allocation of routing and wavelength resources in Software Defined Network (SDN) network architecture, path selection and wavelength allocation are completed from the perspective of path weight. Finally, the proposed algorithm is compared with the existing algorithms. The simulation results show that the proposed algorithm can reduce the blocking rate and improve the wavelength utilization.

Original languageEnglish
Title of host publication2021 19th International Conference on Optical Communications and Networks, ICOCN 2021
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781665424462
DOIs
Publication statusPublished - 2021
Externally publishedYes
Event19th International Conference on Optical Communications and Networks, ICOCN 2021 - Qufu, China
Duration: 23 Aug 202127 Aug 2021

Publication series

Name2021 19th International Conference on Optical Communications and Networks, ICOCN 2021

Conference

Conference19th International Conference on Optical Communications and Networks, ICOCN 2021
Country/TerritoryChina
CityQufu
Period23/08/2127/08/21

Keywords

  • Path weight
  • Routing and wavelength assignment(RWA)
  • Routing hops
  • Satellite optical network
  • Utilization of wavelength

Fingerprint

Dive into the research topics of 'Routing and Wavelength Assignment Algorithm for LEO Satellite Based on Path Weight'. Together they form a unique fingerprint.

Cite this