IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v11y2019i1p15-d197181.html
   My bibliography  Save this article

Multi-Topology Routing Algorithms in SDN-Based Space Information Networks

Author

Listed:
  • Xiangli Meng

    (Science and Technology on Complex Electronic System Simulation Laboratory, Space Engineering University, Beijing 101416, China)

  • Lingda Wu

    (Science and Technology on Complex Electronic System Simulation Laboratory, Space Engineering University, Beijing 101416, China)

  • Shaobo Yu

    (Science and Technology on Complex Electronic System Simulation Laboratory, Space Engineering University, Beijing 101416, China)

Abstract

Aiming at the complex structure of the space information networks (SIN) and the dynamic change of network topology, in order to design an efficient routing strategy, this paper establishes a SIN management architecture based on Software-defined Networking (SDN). A routing algorithm flow of the spatial information network based on a snapshot sequence is designed. For different spatial tasks with different Quality of Service (QoS) requirements, the concept of integrated link weight is proposed. The Warshall–Floyd algorithm is used to design the optimal routing strategy. A Task-oriented Bandwidth Resource Allocation (TBA) algorithm is proposed for multiple spatial tasks in the same link. Simulation results show that the algorithm can effectively guarantee the priority transmission of important tasks and avoid the unnecessary waste of bandwidth resources.

Suggested Citation

  • Xiangli Meng & Lingda Wu & Shaobo Yu, 2019. "Multi-Topology Routing Algorithms in SDN-Based Space Information Networks," Future Internet, MDPI, vol. 11(1), pages 1-17, January.
    • Handle: RePEc:gam:jftint:v:11:y:2019:i:1:p:15-:d:197181
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/11/1/15/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/11/1/15/
    Download Restriction: no
    ---><---

    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:jftint:v:11:y:2019:i:1:p:15-:d:197181. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.