Yunxiao Ning

Yunxiao Ning

Auto-generated profile, based on publicly available information

Yunxiao Ning

Beijing Univ Posts & Telecommun, State Key Lab Informat Photon & Opt Commun, Beijing 100876, Peoples R China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 April 2024 in Journal of Optical Communications and Networking
Verified
Journal Article
Closed access
YNYunxiao Ning
Yunxiao Ning
Yongli ZhaoYongli Zhao
Yongli Zhao
ANAvishek Nag
Avishek Nag
HWHua Wang
Hua Wang
JZJie Zhang
Jie Zhang
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.

1 January 2022
Verified
Conference Paper
Closed access
PDF file
YNYunxiao Ning
Yunxiao Ning
Yongli ZhaoYongli Zhao
Yongli Zhao
XLXin Li
Xin Li
SRSabidur Rahman
Sabidur Rahman
HZHuibin Zhang
Huibin Zhang
JZJie Zhang
Jie Zhang
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.

31 July 2023
Verified
Conference Paper
Closed access
YNYunxiao Ning
Yunxiao Ning
Yongli ZhaoYongli Zhao
Yongli Zhao
LYLongteng Yi
Longteng Yi
JZJie Zhang
Jie Zhang
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.