Yunxiao Ning
Research Subjects
Yunxiao Ning has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Yongli Zhao
Beijing University of Posts and Telecommunications
3 shared publications - Jie Zhang
State Key Laboratory of Information Photonics and Optical Communication, Beijing University of Posts and Telecommunications, Beijing, China
2 shared publications Avishek Nag
University College Dublin
1 shared publication- Hua Wang
Nanjing Tech University
1 shared publication - Huibin Zhang
State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing, China
1 shared publication Jie Zhang
Beijing Univ Posts & Telecommun, State Key Lab Informat Photon & Opt Commun, Beijing 100876, Peoples R China
1 shared publication
Latest Publications
- 24 April 2024
- Published by Optica Publishing Group in Journal of Optical Communications and Networking
- Vol. 16 (5) , 553-564
Biphase routing scheme for optimal throughput in large-scale optical satellite networks
In the large-scale optical satellite network (LS-OSN), hundreds to thousands of low Earth orbit (LEO) satellites will be interconnected via laser links, offering global coverage characterized by high throughput and low latency. LS-OSNs present an attractive strategy to cultivate a comprehensively connected, intelligent world. However, the dynamic nature of the satellites, as they orbit the Earth, results in frequent changes in the LS-OSN topology. Thus, there is a pressing need for efficient routing algorithms that not only cater to massive traffic demands but also swiftly adapt to these constant topological changes. Traditional routing algorithms for services with specific bandwidth requirements often compromise on either computational speed or throughput efficiency. In response, this study introduces a routing scheme based on flow optimization and decomposition (FOND). This seeks to shorten the computation time while preserving optimal network throughput. Expanding upon the FOND scheme, we further devised two heuristic algorithms: the flow-based greedy path (FGP) and the flow-based greedy width (FGW). Simulation results from a 288-satellite constellation network indicate that both the FGP and FGW outpace contemporary methods in terms of the routing computation time while maintaining a consistent throughput equal to 100% of the network capacity. Notably, the FGP has exhibited an impressive capability, reducing the routing computation time to 0.23% compared to the baseline incremental-widest-path (IWP) algorithm, which operates on Dijkstra’s algorithm principles.
- 24 April 2024
- Published by Optica Publishing Group in Journal of Optical Communications and Networking
- Vol. 16 (5) , 553-564
Biphase routing scheme for optimal throughput in large-scale optical satellite networks
In the large-scale optical satellite network (LS-OSN), hundreds to thousands of low Earth orbit (LEO) satellites will be interconnected via laser links, offering global coverage characterized by high throughput and low latency. LS-OSNs present an attractive strategy to cultivate a comprehensively connected, intelligent world. However, the dynamic nature of the satellites, as they orbit the Earth, results in frequent changes in the LS-OSN topology. Thus, there is a pressing need for efficient routing algorithms that not only cater to massive traffic demands but also swiftly adapt to these constant topological changes. Traditional routing algorithms for services with specific bandwidth requirements often compromise on either computational speed or throughput efficiency. In response, this study introduces a routing scheme based on flow optimization and decomposition (FOND). This seeks to shorten the computation time while preserving optimal network throughput. Expanding upon the FOND scheme, we further devised two heuristic algorithms: the flow-based greedy path (FGP) and the flow-based greedy width (FGW). Simulation results from a 288-satellite constellation network indicate that both the FGP and FGW outpace contemporary methods in terms of the routing computation time while maintaining a consistent throughput equal to 100% of the network capacity. Notably, the FGP has exhibited an impressive capability, reducing the routing computation time to 0.23% compared to the baseline incremental-widest-path (IWP) algorithm, which operates on Dijkstra’s algorithm principles.
- 31 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-3
A Fast Routing Algorithm with Maximum Throughput in Dynamic LEO Optical Satellite Networks
A novel routing algorithm is proposed to reduce the routing computation time in dynamic LEO optical satellite networks. Simulations prove that our proposed algorithm can significantly fasten the computation while maintaining the maximum throughput.
- 31 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-3
A Fast Routing Algorithm with Maximum Throughput in Dynamic LEO Optical Satellite Networks
A novel routing algorithm is proposed to reduce the routing computation time in dynamic LEO optical satellite networks. Simulations prove that our proposed algorithm can significantly fasten the computation while maintaining the maximum throughput.
- 1 January 2022
- Published by Optica Publishing Group
- p. W2A.22
Load-Balancing Routing Algorithm Against Inter-Satellite Link Congestion in LEO Satellite Optical Networks
A novel load-balancing routing algorithm based on satellite-ground cooperation is proposed to reduce the impact of inter-satellite link congestion in LEO satellite optical networks. Simulations prove that our proposal can significantly improve the network throughput.
- 1 January 2022
- Published by Optica Publishing Group
- p. W2A.22
Load-Balancing Routing Algorithm Against Inter-Satellite Link Congestion in LEO Satellite Optical Networks
A novel load-balancing routing algorithm based on satellite-ground cooperation is proposed to reduce the impact of inter-satellite link congestion in LEO satellite optical networks. Simulations prove that our proposal can significantly improve the network throughput.