A Novel Multi-service QoS Routing Algorithm for Inclined Low-orbit Constellations

The development of multimedia services and satellite networks has been rapid. While there is extensive research on multi-service QoS routing algorithms for terrestrial networks, there is little research on such algorithms for satellite networks. This paper presents a novel multi-service QoS routing algorithm designed for inclined low-orbit constellations. By employing multi-path routing pre-computation, congestion detection mechanisms, and customized distributed forwarding strategies for different services, the algorithm effectively meets diverse QoS requirements and mitigates network congestion. The algorithm's strengths lie in its low overhead, reduced processing delay, and simplicity, coupled with its ability to flexibly adapt to changing load conditions. Simulation results demonstrate the average packet loss rate of the loss-sensitive service is about 10% lower than that of Dijkstra. The average end-to-end delay of delay-sensitive service is about 40ms lower than that of Dijkstra.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/icct62411.2024.10946437
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Novel Multi-service QoS Routing Algorithm for Inclined Low-orbit Constellations

Jiaxue Wang, Kanglian Zhao, Wenfeng Li
Satellite Communication Systems
article

A Novel Multi-service QoS Routing Algorithm for Inclined Low-orbit Constellations

Jiaxue Wang, Kanglian Zhao, Wenfeng Li
article en

Abstract

The development of multimedia services and satellite networks has been rapid. While there is extensive research on multi-service QoS routing algorithms for terrestrial networks, there is little research on such algorithms for satellite networks. This paper presents a novel multi-service QoS routing algorithm designed for inclined low-orbit constellations. By employing multi-path routing pre-computation, congestion detection mechanisms, and customized distributed forwarding strategies for different services, the algorithm effectively meets diverse QoS requirements and mitigates network congestion. The algorithm's strengths lie in its low overhead, reduced processing delay, and simplicity, coupled with its ability to flexibly adapt to changing load conditions. Simulation results demonstrate the average packet loss rate of the loss-sensitive service is about 10% lower than that of Dijkstra. The average end-to-end delay of delay-sensitive service is about 40ms lower than that of Dijkstra.

Nanjing University (CN)
Openalex Percentile: Top 52%
Satellite Communication Systems
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.