IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i5p1232-d1086446.html
   My bibliography  Save this article

Dynamic Network Resource Autonomy Management and Task Scheduling Method

Author

Listed:
  • Xiuhong Li

    (College of Information Science and Engineering (School of Cyber Science and Engineering), XinJiang University, Urmuqi 830046, China)

  • Jiale Yang

    (College of Information Science and Engineering (School of Cyber Science and Engineering), XinJiang University, Urmuqi 830046, China)

  • Huilong Fan

    (School of Computer Science and Engineering, Central South University, Changsha 410075, China)

Abstract

Satellite network resource management and scheduling technology are significant to constructing integrated information networks in heaven and earth. The difficulty in realizing this technology lies in improving resource utilization efficiency while ensuring the service quality of satellites and efficiently coordinating complex satellite network systems and services. This paper proposes a model, A Dynamic task scheduling method based on a UNified resource Management architecture(DUNM), based on the designed resource management architecture supported by dynamic scheduling algorithms to address the problems of low resource utilization, resource allocation, and task completion rate. First, with sufficient resources, the task execution time to complete a task is calculated based on the number of resources, task transmission time, task waiting time, etc. Secondly, based on the tasks assigned to satellites, the execution time of all functions with different transmission rates of communication links between satellites is calculated, and the total sum of all time consumption is analyzed. Finally, after simulation experiments and comparison with various baseline algorithms, about a 40% reduction in time to complete scheduled tasks and an almost 25% reduction in the average cost to finish a scheduling task, our method has higher scheduling efficiency and lower task completion revenue. It also guarantees a higher task completion rate while completing the tasks. Our approach attained a nearly 100% completion rate for scheduling tasks, which means that our algorithm can achieve the scheduling tasks faster and at high task revenue, thus improving the efficiency and economic efficiency of the whole system. Therefore, it validates the advantages of our method, such as high efficiency and high revenue.

Suggested Citation

  • Xiuhong Li & Jiale Yang & Huilong Fan, 2023. "Dynamic Network Resource Autonomy Management and Task Scheduling Method," Mathematics, MDPI, vol. 11(5), pages 1-19, March.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:5:p:1232-:d:1086446
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/5/1232/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/5/1232/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Huilong Fan & Zhan Yang & Shimin Wu & Xi Zhang & Jun Long & Limin Liu, 2021. "An Efficient Satellite Resource Cooperative Scheduling Method on Spatial Information Networks," Mathematics, MDPI, vol. 9(24), pages 1-23, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jun Long & Shangpeng Wang & Yakun Huo & Limin Liu & Huilong Fan, 2024. "Dynamic Merging for Optimal Onboard Resource Utilization: Innovating Mission Queue Constructing Method in Multi-Satellite Spatial Information Networks," Mathematics, MDPI, vol. 12(7), pages 1-16, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:5:p:1232-:d:1086446. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.