TY - GEN
T1 - Multi-hop Coflow Routing for LEO Distributed Computation Satellite Networks
AU - Zhang, Zhikai
AU - Gu, Shushi
AU - Li, Shumao
AU - Yang, Yi
AU - Zhang, Qinyu
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - The low earth satellite networks are envisioned to be an indispensable part of next-generation network due to the seamless Internet access. Deploying distributed computation into LEO satellite networks can decrease the latency of transmitting satellite-terrestrial computing jobs, which is crucial to expanding the service capability. Distributed computation depends on the exchange of data flows between worker nodes, as a type of concurrent and interrelated flows called coflow. However, the mesh-shaped topologies of LEO satellite networks make coflows prone to bandwidth competition on multi-hop links, which impedes the efficiency of distributed computation. In this paper, we formulated the multi-hop coflow scheduling process in LEO satellite networks as a routing and bandwidth allocation problem. Then, we simplified the problem to a coflow routing problem, and proposed the coflow routing greedy scheduling (CRGS) algorithm on the basis of the characteristics of multi-hop networks. Finally, we simulated in an SDN environment, where CRGS was deployed in an SDN controller. Compared with several existing algorithms, the CRGS algorithm is proved to reduce the coflow completion time (CCT) more effectively.
AB - The low earth satellite networks are envisioned to be an indispensable part of next-generation network due to the seamless Internet access. Deploying distributed computation into LEO satellite networks can decrease the latency of transmitting satellite-terrestrial computing jobs, which is crucial to expanding the service capability. Distributed computation depends on the exchange of data flows between worker nodes, as a type of concurrent and interrelated flows called coflow. However, the mesh-shaped topologies of LEO satellite networks make coflows prone to bandwidth competition on multi-hop links, which impedes the efficiency of distributed computation. In this paper, we formulated the multi-hop coflow scheduling process in LEO satellite networks as a routing and bandwidth allocation problem. Then, we simplified the problem to a coflow routing problem, and proposed the coflow routing greedy scheduling (CRGS) algorithm on the basis of the characteristics of multi-hop networks. Finally, we simulated in an SDN environment, where CRGS was deployed in an SDN controller. Compared with several existing algorithms, the CRGS algorithm is proved to reduce the coflow completion time (CCT) more effectively.
KW - LEO satellite network
KW - SDN controller
KW - bandwidth competition
KW - coflow routing
KW - distributed computation
UR - https://www.scopus.com/pages/publications/85147009658
U2 - 10.1109/VTC2022-Fall57202.2022.10012814
DO - 10.1109/VTC2022-Fall57202.2022.10012814
M3 - 会议稿件
AN - SCOPUS:85147009658
T3 - IEEE Vehicular Technology Conference
BT - 2022 IEEE 96th Vehicular Technology Conference, VTC 2022-Fall 2022 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 96th IEEE Vehicular Technology Conference, VTC 2022-Fall 2022
Y2 - 26 September 2022 through 29 September 2022
ER -