Towards Deterministic-Delay Data Delivery Using Multi-Criteria Routing over Satellite Networks

The satellite Internet can cover up to 70% of the surface of our planet Earth to provide network services for nearly 3 billion people. As such, it is promising to become the building block of future 6G networks. The satellite Internet is capable of providing uniform communication capacity to every part of the Earth’s surface, due to its uniform and symmetrical constellation structure, while the uneven distribution of ground populations leads to globally uneven traffic delivery requests, incurring a mismatch between the capacity and traffic transmission demands. As such, traditional single-criteria (e.g., shortest delay) routing algorithms can lead to severe network congestion and cannot provision delay-deterministic data delivery. To overcome this bottleneck, we propose a multi-criteria routing and scheduling scheme to redirect time-tolerant data, thus preventing congestion for time-sensitive data, based on the spatiotemporal distribution of data traffic. First, we construct a traffic spatiotemporal distribution model, to indicate the network load status. Next, we model the satellite network multi-criteria routing problem as an integer linear programming one, which is NP-hard and challenging to solve within polynomial time. A novel link weight design based on both the link delay and load is introduced, transforming the mathematical programming problem into a routing optimization problem. The proposed correlation scheduling algorithm fully utilizes idle network link resources, significantly improving network resource utilization and eliminating resource competition between non-time-sensitive and time-sensitive services. Simulation results show that compared with traditional algorithms, the proposed method can increase the throughput of time-sensitive data by up to 20.8% and reduce the packet loss rate of time-sensitive services by up to 76.8%.

Authors

Institutions

Publication Details

Journal
Electronics
Published
2024-12-06
DOI
https://doi.org/10.3390/electronics13234822
Citations
1
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
1.30

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Towards Deterministic-Delay Data Delivery Using Multi-Criteria Routing over Satellite Networks

Han Ma, Yaoxu He, Hongyan Li, Xiaogang Li
1 citations
Electronics
Satellite Communication Systems
1.30
article

Towards Deterministic-Delay Data Delivery Using Multi-Criteria Routing over Satellite Networks

Han Ma, Yaoxu He, Hongyan Li, Xiaogang Li
article en
1 citations

Abstract

The satellite Internet can cover up to 70% of the surface of our planet Earth to provide network services for nearly 3 billion people. As such, it is promising to become the building block of future 6G networks. The satellite Internet is capable of providing uniform communication capacity to every part of the Earth’s surface, due to its uniform and symmetrical constellation structure, while the uneven distribution of ground populations leads to globally uneven traffic delivery requests, incurring a mismatch between the capacity and traffic transmission demands. As such, traditional single-criteria (e.g., shortest delay) routing algorithms can lead to severe network congestion and cannot provision delay-deterministic data delivery. To overcome this bottleneck, we propose a multi-criteria routing and scheduling scheme to redirect time-tolerant data, thus preventing congestion for time-sensitive data, based on the spatiotemporal distribution of data traffic. First, we construct a traffic spatiotemporal distribution model, to indicate the network load status. Next, we model the satellite network multi-criteria routing problem as an integer linear programming one, which is NP-hard and challenging to solve within polynomial time. A novel link weight design based on both the link delay and load is introduced, transforming the mathematical programming problem into a routing optimization problem. The proposed correlation scheduling algorithm fully utilizes idle network link resources, significantly improving network resource utilization and eliminating resource competition between non-time-sensitive and time-sensitive services. Simulation results show that compared with traditional algorithms, the proposed method can increase the throughput of time-sensitive data by up to 20.8% and reduce the packet loss rate of time-sensitive services by up to 76.8%.

ElectronicsVol. 13(23)
Xidian University (CN)
National Natural Science Foundation of China
Decent work and economic growth
Openalex Percentile: Top 11%
Satellite Communication Systems
1.30
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.