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

Adaptive Real-Time Transmission in Large-Scale Satellite Networks Through Software-Defined-Networking-Based Domain Clustering and Random Linear Network Coding

Author

Listed:
  • Shangpeng Wang

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

  • Chenyuan Zhang

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

  • Yuchen Wu

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

  • Limin Liu

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

  • Jun Long

    (School of Computer Science and Engineering, Central South University, Changsha 410083, China
    Big Data Institute, Central South University, Changsha 410083, China)

Abstract

Network flow task management involves the efficient allocation and scheduling of data flow tasks within dynamic satellite networks, aiming to effectively address frequent changes in network topology and dynamic traffic fluctuations. Existing research primarily emphasizes traffic prediction and scheduling using spatiotemporal models and machine learning. However, these approaches often depend on extensive historical data for training, making real-time adaptation to rapidly changing network topologies and traffic patterns challenging in dynamic satellite environments. Additionally, their high computational complexity and slow convergence rates hinder their efficiency in large-scale networks. To address these issues, this paper proposes a collaborative optimization framework based on Coding Multi-Path Theory (CMPT). The framework utilizes a Nash bargaining game model to simulate resource competition among the different participants, ensuring fair resource distribution and load balancing. It also integrates real-time network state monitoring with optimization algorithms, within a multi-path scheduling strategy, enabling the dynamic selection of optimal transmission paths to accommodate frequent network topology changes and traffic variations. Experimental results indicate that the proposed method reduced resource allocation task execution time by at least 18.03% compared to traditional methods and enhanced task scheduling efficiency by at least 14.01%. Although CMPT exhibited a slightly higher task latency on certain small-scale datasets compared to some baseline algorithms, its performance remains exceptional in large-scale and high-dimensional scenarios.

Suggested Citation

  • Shangpeng Wang & Chenyuan Zhang & Yuchen Wu & Limin Liu & Jun Long, 2025. "Adaptive Real-Time Transmission in Large-Scale Satellite Networks Through Software-Defined-Networking-Based Domain Clustering and Random Linear Network Coding," Mathematics, MDPI, vol. 13(7), pages 1-36, March.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:7:p:1069-:d:1620262
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/7/1069/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/7/1069/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yurtkuran, Alkın & Emel, Erdal, 2015. "An adaptive artificial bee colony algorithm for global optimization," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 1004-1023.
    2. Seyedeh Maedeh Mirmohseni & Amir Javadpour & Chunming Tang, 2021. "LBPSGORA: Create Load Balancing with Particle Swarm Genetic Optimization Algorithm to Improve Resource Allocation and Energy Consumption in Clouds Networks," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-15, June.
    Full references (including those not matched with items on IDEAS)

    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.
    1. Yetgin, Zeki & Abaci, Hüseyin, 2021. "Honey formation optimization framework for design problems," Applied Mathematics and Computation, Elsevier, vol. 394(C).

    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:13:y:2025:i:7:p:1069-:d:1620262. 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.