VNF-Based Service Provision in Software Defined LEO Satellite Networks

Low earth orbit (LEO) satellite networks will play important roles in the sixth generation (6G) communication system. Software defined network technique is a novel approach introduced to the LEO satellite networks to improve the resource flexibility and efficiency, forming the software defined LEO s...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on wireless communications Ročník 20; číslo 9; s. 6139 - 6153
Hlavní autoři: Jia, Ziye, Sheng, Min, Li, Jiandong, Zhou, Di, Han, Zhu
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.09.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Analytical models
Approximation algorithms
branch-and-price
Communications systems
Dantzig-Wolfe decomposition
Integer programming
Linear programming
Low earth orbit (LEO) satellite networks
Low earth orbit satellites
Low earth orbits
Mathematical analysis
Particle beams
Satellite networks
satellite resource allocation
Satellites
Search algorithms
Software algorithms
Software-defined networking
virtual network function (VNF)
Virtual networks
Wireless communication
ISSN:1536-1276, 1558-2248
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Low earth orbit (LEO) satellite networks will play important roles in the sixth generation (6G) communication system. Software defined network technique is a novel approach introduced to the LEO satellite networks to improve the resource flexibility and efficiency, forming the software defined LEO satellite networks (SDLSNs). How to efficiently allocate the resources of SDLSN to provide services for the terrestrial users is a key issue. Hence, in this work, we explore the service provision for SDLSN via virtual network functions (VNFs) orchestration on the software defined time-evolving graph. In view of the scarce, intermittent and unstable satellite-to-satellite (S2S) links, the problem is formulated to minimize the S2S resource consumption while satisfying the terrestrial tasks, which is in the form of integer linear programming. Since the problem is intractable by exhaustive search, we design a branch-and-price algorithm based on the coupling of Dantzig-Wolfe decomposition, column generation, and branch-and-bound to efficiently acquire the optimal solution. Further, to obtain a faster solution for practical usage, we further design an approximation algorithm for the subproblem and leverage the beam search to accelerate the pruning for the search tree. Finally, extensive simulations are conducted and the numerical results validate the effectiveness of the proposed schemes.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2021.3072155