Offloading of Atomic Tasks in Satellite Networks: A Fast Adaptive Resource Collaboration Method
With the explosive growth of multimedia services and the continuous emergence of new space tasks, the spatial task scheduling timeliness problem is of great concern. The high computational cost of existing task scheduling methods is not suitable for the time-varying scenarios of space-based networks...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-03-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/12/7/3319 |
| _version_ | 1797440556583878656 |
|---|---|
| author | Yanbing Li Wei Zhao Huilong Fan |
| author_facet | Yanbing Li Wei Zhao Huilong Fan |
| author_sort | Yanbing Li |
| collection | DOAJ |
| description | With the explosive growth of multimedia services and the continuous emergence of new space tasks, the spatial task scheduling timeliness problem is of great concern. The high computational cost of existing task scheduling methods is not suitable for the time-varying scenarios of space-based networks. This paper proposes a scheduling optimization method containing an atomic task offloading model based on maximum flow theory and a dynamic caching model. Firstly, the model calculates the task offloading upper limit in the satellite network based on the maximum flow theory to achieve the maximum volume of offloaded tasks to improve the resource utilization of idle satellites. Then, we design onboard task offloading and buffer optimization algorithms to reduce the request load of single-satellite atomic tasks. The method improves the overall computational performance and timeliness of the satellite network and reduces the waiting time of atomic tasks competing for resources. Finally, we analyze the time complexity of the proposed method and construct a simulation experiment scenario. The performance comparison results with various baseline models show that the proposed method has certain time complexity and task execution timeliness advantages. |
| first_indexed | 2024-03-09T12:09:54Z |
| format | Article |
| id | doaj.art-b24f3bcc1b6747e399fb92916121f3f5 |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-03-09T12:09:54Z |
| publishDate | 2022-03-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-b24f3bcc1b6747e399fb92916121f3f52023-11-30T22:54:05ZengMDPI AGApplied Sciences2076-34172022-03-01127331910.3390/app12073319Offloading of Atomic Tasks in Satellite Networks: A Fast Adaptive Resource Collaboration MethodYanbing Li0Wei Zhao1Huilong Fan2School of Cyber Science and Engineering, College of Information Science and Engineering, Xinjiang University, Urumqi 830046, ChinaSchool of Computer Science and Engineering, Central South University, Changsha 410075, ChinaSchool of Computer Science and Engineering, Central South University, Changsha 410075, ChinaWith the explosive growth of multimedia services and the continuous emergence of new space tasks, the spatial task scheduling timeliness problem is of great concern. The high computational cost of existing task scheduling methods is not suitable for the time-varying scenarios of space-based networks. This paper proposes a scheduling optimization method containing an atomic task offloading model based on maximum flow theory and a dynamic caching model. Firstly, the model calculates the task offloading upper limit in the satellite network based on the maximum flow theory to achieve the maximum volume of offloaded tasks to improve the resource utilization of idle satellites. Then, we design onboard task offloading and buffer optimization algorithms to reduce the request load of single-satellite atomic tasks. The method improves the overall computational performance and timeliness of the satellite network and reduces the waiting time of atomic tasks competing for resources. Finally, we analyze the time complexity of the proposed method and construct a simulation experiment scenario. The performance comparison results with various baseline models show that the proposed method has certain time complexity and task execution timeliness advantages.https://www.mdpi.com/2076-3417/12/7/3319task offloadtask cachemaximum flowsatellite networkatomic task |
| spellingShingle | Yanbing Li Wei Zhao Huilong Fan Offloading of Atomic Tasks in Satellite Networks: A Fast Adaptive Resource Collaboration Method Applied Sciences task offload task cache maximum flow satellite network atomic task |
| title | Offloading of Atomic Tasks in Satellite Networks: A Fast Adaptive Resource Collaboration Method |
| title_full | Offloading of Atomic Tasks in Satellite Networks: A Fast Adaptive Resource Collaboration Method |
| title_fullStr | Offloading of Atomic Tasks in Satellite Networks: A Fast Adaptive Resource Collaboration Method |
| title_full_unstemmed | Offloading of Atomic Tasks in Satellite Networks: A Fast Adaptive Resource Collaboration Method |
| title_short | Offloading of Atomic Tasks in Satellite Networks: A Fast Adaptive Resource Collaboration Method |
| title_sort | offloading of atomic tasks in satellite networks a fast adaptive resource collaboration method |
| topic | task offload task cache maximum flow satellite network atomic task |
| url | https://www.mdpi.com/2076-3417/12/7/3319 |
| work_keys_str_mv | AT yanbingli offloadingofatomictasksinsatellitenetworksafastadaptiveresourcecollaborationmethod AT weizhao offloadingofatomictasksinsatellitenetworksafastadaptiveresourcecollaborationmethod AT huilongfan offloadingofatomictasksinsatellitenetworksafastadaptiveresourcecollaborationmethod |