Research on delay upper bound analysis based on network calculus for LEO satellite network
It’s essential to achieve reliable transmission by accurately characterizing the delay upper bound in space-air-ground integrated network (SAGIN). Based on deterministic network calculus and time-aware shaping (TAS) mechanism in time-sensitive networking (TSN), a delay upper bound analysis model for...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2025-04-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2025074/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | It’s essential to achieve reliable transmission by accurately characterizing the delay upper bound in space-air-ground integrated network (SAGIN). Based on deterministic network calculus and time-aware shaping (TAS) mechanism in time-sensitive networking (TSN), a delay upper bound analysis model for low earth orbit (LEO) satellites was constructed. Firstly, a delay upper bound guarantee architecture for LEO satellite network (DGA-LEO) was developed using network calculus within the context of SAGIN. Next, a traffic model was formulated based on leaky bucket model, considering the worst-case impact of interference from different priorities, and then the service curve for a satellite node was established. For the same-priority interference, a new left-over service curve calculation method was proposed, and based on the convolution theory in min-plus algebra, an improved network calculus algorithm was developed. Finally, the proposed algorithm was tested under a defined LEO satellite network and traffic model, and the comparative analysis was conducted with three traditional algebraic network calculus algorithms. Experimental results demonstrate that the proposed algorithm achieves more accurate delay upper bounds while significantly reducing computation time. |
|---|---|
| ISSN: | 1000-436X |