{"title":"大规模低地轨道星座路由的末跳协作调度策略","authors":"","doi":"10.1016/j.comnet.2024.110760","DOIUrl":null,"url":null,"abstract":"<div><p>The transmission of data packets from satellites to Earth Stations (ESs) is the last hop of satellite network routing. As the final stage of packet transmission, the use of different scheduling strategies directly affects the throughput of the satellite network. Traditionally, researchers have attempted to enhance network performance by investigating inter-satellite routing protocols or inter-satellite data offloading strategies. However, these approaches have failed to address scheduling issues in the last hop of large-scale Low Earth Orbit (LEO) constellations. In this paper, we present the first Cooperative Last-Hop Scheduling (CLHS) strategy for routing in large-scale LEO constellations based on a bidirectional communication domain. In this strategy, we first utilize the bidirectional communication domain to determine the communication ranges of satellites and ESs. Subsequently, an information flow is established to interact with ESs and satellites. The ESs receive and reconstruct the Information Matrix (IM) from the information flow. Moreover, we propose the Maximum Decision Value Priority (MDVP) algorithm, which takes the reconstructed IM as input and computes the scheduling commands for satellites within the communication range of the ESs. To address the issue of multiple ESs simultaneously scheduling the same satellite, we introduce the Collision Avoidance Algorithm (CAA). Finally, to enhance the data packet transmission efficiency of the scheduled satellites, we propose the Weighted First-In-First-Out (WFIFO) algorithm, which is specifically designed for satellite packet dequeuing. We validate the CLHS through simulations on two satellite constellations: the first-generation Starlink constellation with 4409 satellites and the GW-2 constellation with 6912 satellites. The results show that CLHS can achieve better network throughput than traditional strategies. CLHS provides a novel method of scheduling the last hop in large-scale satellite constellations.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4000,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Collaborative last-hop scheduling strategy for large-scale LEO constellation routing\",\"authors\":\"\",\"doi\":\"10.1016/j.comnet.2024.110760\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The transmission of data packets from satellites to Earth Stations (ESs) is the last hop of satellite network routing. As the final stage of packet transmission, the use of different scheduling strategies directly affects the throughput of the satellite network. Traditionally, researchers have attempted to enhance network performance by investigating inter-satellite routing protocols or inter-satellite data offloading strategies. However, these approaches have failed to address scheduling issues in the last hop of large-scale Low Earth Orbit (LEO) constellations. In this paper, we present the first Cooperative Last-Hop Scheduling (CLHS) strategy for routing in large-scale LEO constellations based on a bidirectional communication domain. In this strategy, we first utilize the bidirectional communication domain to determine the communication ranges of satellites and ESs. Subsequently, an information flow is established to interact with ESs and satellites. The ESs receive and reconstruct the Information Matrix (IM) from the information flow. Moreover, we propose the Maximum Decision Value Priority (MDVP) algorithm, which takes the reconstructed IM as input and computes the scheduling commands for satellites within the communication range of the ESs. To address the issue of multiple ESs simultaneously scheduling the same satellite, we introduce the Collision Avoidance Algorithm (CAA). Finally, to enhance the data packet transmission efficiency of the scheduled satellites, we propose the Weighted First-In-First-Out (WFIFO) algorithm, which is specifically designed for satellite packet dequeuing. We validate the CLHS through simulations on two satellite constellations: the first-generation Starlink constellation with 4409 satellites and the GW-2 constellation with 6912 satellites. The results show that CLHS can achieve better network throughput than traditional strategies. CLHS provides a novel method of scheduling the last hop in large-scale satellite constellations.</p></div>\",\"PeriodicalId\":50637,\"journal\":{\"name\":\"Computer Networks\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2024-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1389128624005929\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128624005929","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
摘要
从卫星向地面站(ES)传输数据包是卫星网络路由的最后一跳。作为数据包传输的最后阶段,不同调度策略的使用会直接影响卫星网络的吞吐量。传统上,研究人员试图通过研究卫星间路由协议或卫星间数据卸载策略来提高网络性能。然而,这些方法都未能解决大规模低地轨道(LEO)星座最后一跳的调度问题。在本文中,我们首次提出了基于双向通信域的大规模低地轨道星座路由合作最后一跳调度(CLHS)策略。在该策略中,我们首先利用双向通信域确定卫星和 ES 的通信范围。随后,建立信息流,与 ES 和卫星进行交互。ES 从信息流中接收并重建信息矩阵 (IM)。此外,我们还提出了最大决策值优先(MDVP)算法,该算法以重建的信息矩阵为输入,计算 ES 通信范围内卫星的调度指令。为解决多个 ES 同时调度同一卫星的问题,我们引入了碰撞避免算法(CAA)。最后,为了提高已调度卫星的数据包传输效率,我们提出了加权先进先出算法(WFIFO),该算法专门用于卫星数据包的排序。我们在两个卫星星座上模拟验证了 CLHS:第一代 Starlink 卫星星座(有 4409 颗卫星)和 GW-2 卫星星座(有 6912 颗卫星)。结果表明,与传统策略相比,CLHS 可以实现更好的网络吞吐量。CLHS为大规模卫星星座的最后一跳调度提供了一种新方法。
Collaborative last-hop scheduling strategy for large-scale LEO constellation routing
The transmission of data packets from satellites to Earth Stations (ESs) is the last hop of satellite network routing. As the final stage of packet transmission, the use of different scheduling strategies directly affects the throughput of the satellite network. Traditionally, researchers have attempted to enhance network performance by investigating inter-satellite routing protocols or inter-satellite data offloading strategies. However, these approaches have failed to address scheduling issues in the last hop of large-scale Low Earth Orbit (LEO) constellations. In this paper, we present the first Cooperative Last-Hop Scheduling (CLHS) strategy for routing in large-scale LEO constellations based on a bidirectional communication domain. In this strategy, we first utilize the bidirectional communication domain to determine the communication ranges of satellites and ESs. Subsequently, an information flow is established to interact with ESs and satellites. The ESs receive and reconstruct the Information Matrix (IM) from the information flow. Moreover, we propose the Maximum Decision Value Priority (MDVP) algorithm, which takes the reconstructed IM as input and computes the scheduling commands for satellites within the communication range of the ESs. To address the issue of multiple ESs simultaneously scheduling the same satellite, we introduce the Collision Avoidance Algorithm (CAA). Finally, to enhance the data packet transmission efficiency of the scheduled satellites, we propose the Weighted First-In-First-Out (WFIFO) algorithm, which is specifically designed for satellite packet dequeuing. We validate the CLHS through simulations on two satellite constellations: the first-generation Starlink constellation with 4409 satellites and the GW-2 constellation with 6912 satellites. The results show that CLHS can achieve better network throughput than traditional strategies. CLHS provides a novel method of scheduling the last hop in large-scale satellite constellations.
期刊介绍:
Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.