TY - GEN
T1 - Time-varying resource graph based resource model for space-terrestrial integrated networks
AU - Chen, Long
AU - Tang, Feilong
AU - Li, Zhetao
AU - Yang, Laurence T.
AU - Yu, Jiadi
AU - Yao, Bin
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/5/10
Y1 - 2021/5/10
N2 - It is critical but difficult to efficiently model re-sources in space-terrestrial integrated networks (STINs). Existing work is not applicable to STINs because they lack the joint consideration of different movement patterns and fluctuating loads. In this paper, we propose the time-varying resource graph (TVRG) to model STINs from the resource perspective. Firstly, we propose the STIN mobility model to uniformly model different movement patterns in STINs. Then, we propose a layered Resource Modeling and Abstraction (RMA) approach, where evolutions of node resources are modeled as Markov processes, by encoding predictable topologies and influences of fluctuating loads as states. Besides, we propose the low-complexity domain resource abstraction algorithm by defining two mobility-based and load-aware partial orders on resource abilities. Finally, we propose an efficient TVRG-based Resource Scheduling (TRS) algorithm for time-sensitive and bandwidth-intensive data flows, with the multi-level on-demand scheduling ability. Comprehensive simulation results demonstrate that the RMA-TRS outperforms related schemes in terms of throughput, end-to-end delay and flow completion time.
AB - It is critical but difficult to efficiently model re-sources in space-terrestrial integrated networks (STINs). Existing work is not applicable to STINs because they lack the joint consideration of different movement patterns and fluctuating loads. In this paper, we propose the time-varying resource graph (TVRG) to model STINs from the resource perspective. Firstly, we propose the STIN mobility model to uniformly model different movement patterns in STINs. Then, we propose a layered Resource Modeling and Abstraction (RMA) approach, where evolutions of node resources are modeled as Markov processes, by encoding predictable topologies and influences of fluctuating loads as states. Besides, we propose the low-complexity domain resource abstraction algorithm by defining two mobility-based and load-aware partial orders on resource abilities. Finally, we propose an efficient TVRG-based Resource Scheduling (TRS) algorithm for time-sensitive and bandwidth-intensive data flows, with the multi-level on-demand scheduling ability. Comprehensive simulation results demonstrate that the RMA-TRS outperforms related schemes in terms of throughput, end-to-end delay and flow completion time.
UR - https://www.scopus.com/pages/publications/85111939908
U2 - 10.1109/INFOCOM42981.2021.9488855
DO - 10.1109/INFOCOM42981.2021.9488855
M3 - 会议稿件
AN - SCOPUS:85111939908
T3 - Proceedings - IEEE INFOCOM
BT - INFOCOM 2021 - IEEE Conference on Computer Communications
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 40th IEEE Conference on Computer Communications, INFOCOM 2021
Y2 - 10 May 2021 through 13 May 2021
ER -