A Fast Routing Algorithm with Maximum Throughput in Dynamic LEO Optical Satellite Networks
- 31 July 2023
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-3
Abstract
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.Keywords
Funding Information
- National Key Research and Development Program of China
- National Natural Science Foundation of China
This publication has 10 references indexed in Scilit:
- SpaceRTC: Unleashing the Low-latency Potential of Mega-constellations for Real-Time Communications2022
- Load-Balancing Routing Algorithm Against Inter-Satellite Link Congestion in LEO Satellite Optical Networks2022
- An Updated Comparison of Four Low Earth Orbit Satellite Constellation Systems to Provide Global Broadband2021
- A Load Balancing Routing Strategy for LEO Satellite NetworkIEEE Access, 2020
- Comparison of Routing Algorithms With Static and Dynamic Link Cost in Software Defined Networking (SDN)IEEE Access, 2019
- How to split a flow?2012
- Simple bounds and greedy algorithms for decomposing a flow into a minimal set of pathsEuropean Journal of Operational Research, 2008
- An experimental comparison of min-cut/max- flow algorithms for energy minimization in visionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2004
- Routing in LEO-based satellite networks2003
- A dynamic routing concept for ATM-based satellite personal communication networksIEEE Journal on Selected Areas in Communications, 1997