Logic Path Identified Hierarchical Routing for Large-Scale LEO Satellite Networks

被引:6
作者
Yan, Fei [1 ]
Wang, Zhiyuan [1 ,2 ,3 ]
Zhang, Shan [1 ,2 ,4 ]
Meng, Qingkai [5 ]
Luo, Hongbin [1 ,4 ]
机构
[1] Beihang Univ, Sch Comp Sci & Engn, Beijing 100191, Peoples R China
[2] Zhongguancun Lab, Beijing 102206, Peoples R China
[3] State Key Lab Virtual Real Technol & Syst, Beijing 100191, Peoples R China
[4] State Key Lab Software Dev Environm, Beijing 100191, Peoples R China
[5] Beihang Univ, Inst Artificial Intelligence, Beijing 100191, Peoples R China
来源
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING | 2024年 / 11卷 / 04期
基金
中国国家自然科学基金;
关键词
Routing; Satellites; Topology; Network topology; Low earth orbit satellites; Traffic control; Laboratories; Satellite networks; routing; logic path identifier; satellite grouping; hierarchical information-centric delivery; CHALLENGES; ALGORITHM; SYSTEM;
D O I
10.1109/TNSE.2024.3384452
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Low earth orbit (LEO) constellations equipped with inter-satellite links (ISLs) have the potential to provide global Internet services. However, the mobility of LEO satellites renders the routing problem of large-scale constellations highly challenging. This paper proposes a Logic Path Identified Hierarchical (LPIH) routing to overcome the challenge. Specifically, LPIH partitions the constellation into multiple satellite groups and identifies the logic path between adjacent groups via the path identifier (PID). Accordingly, LPIH detects and disseminates ISL state changes within the group, achieving fast routing convergence with little overhead. Furthermore, LIPH decouples inner-group routing from inter-group routing based on the PID. The inter-group routing is information-centric and pull-based, which relies on the in-packet PID to specify the inter-group forwarding path. This improves the reliability of inter-group forwarding since a PID corresponds to multiple ISLs. The inner-group routing is host-centric and push-based, which relies on the in-packet PID to specify the inner-group destination. Such hierarchical content retrieval allows LPIH to harness the benefits of information-centric and host-centric routing. We develop a simulation platform for satellite networks based on OMNeT++ and conduct extensive packet-level experiments. The results show that LPIH increases the packet delivery ratio up to 105.3% compared to state-of-the-art routing mechanisms.
引用
收藏
页码:3731 / 3746
页数:16
相关论文
共 43 条
[1]   MLSR: A novel routing algorithm for multilayered satellite IP networks [J].
Akyildiz, IF ;
Ekici, E ;
Bender, MD .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2002, 10 (03) :411-424
[2]  
[Anonymous], 2009, P 5 INT C EM NETW EX, DOI DOI 10.1145/1658939.1658941
[3]  
Bai JJ, 2005, 2005 WORKSHOP ON HIGH PERFORMANCE SWITCHING AND ROUTING, P386
[4]   Software Defined Networking and Virtualization for Broadband Satellite Networks [J].
Bertaux, Lionel ;
Medjiah, Samir ;
Berthou, Pascal ;
Abdellatif, Slim ;
Hakiri, Akram ;
Gelard, Patrick ;
Planchou, Fabrice ;
Bruyere, Marc .
IEEE COMMUNICATIONS MAGAZINE, 2015, 53 (03) :54-60
[5]   Vision, Requirements, and Technology Trend of 6G: How to Tackle the Challenges of System Coverage, Capacity, User Data-Rate and Movement Speed [J].
Chen, Shanzhi ;
Liang, Ying-Chang ;
Sun, Shaohui ;
Kang, Shaoli ;
Chen, Wenchi ;
Peng, Mugen .
IEEE WIRELESS COMMUNICATIONS, 2020, 27 (02) :218-228
[6]  
China Telecom Satellite Communications, 2020, GW-A59
[7]  
Detti A, 2012, 2012 IEEE FIRST AESS EUROPEAN CONFERENCE ON SATELLITE TELECOMMUNICATIONS (ESTEL)
[8]   A distributed routing algorithm for datagram traffic in LEO satellite networks [J].
Ekici, E ;
Akyildiz, IF ;
Bender, MD .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2001, 9 (02) :137-147
[9]   Predictable Mobile Routing for Spacecraft Networks [J].
Fischer, Daniel ;
Basin, David ;
Eckstein, Knut ;
Engel, Thomas .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2013, 12 (06) :1174-1187
[10]   Internet Backbones in Space [J].
Giuliari, Giacomo ;
Klenze, Tobias ;
Legner, Markus ;
Basin, David ;
Perrig, Adrian ;
Singla, Ankit .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2020, 50 (01) :26-37