MétaCan
Menu
Back to cohort
Record W4385525334 · doi:10.1109/tvt.2023.3301676

Service-Oriented Network Resource Orchestration in Space-Air-Ground Integrated Network

2023· article· en· W4385525334 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Vehicular Technology · 2023
Typearticle
Languageen
FieldComputer Science
TopicSoftware-Defined Networks and 5G
Canadian institutionsUniversity of Waterloo
FundersBasic and Applied Basic Research Foundation of Guangdong ProvinceNational Natural Science Foundation of ChinaNatural Science Foundation of Shenzhen City
KeywordsComputer scienceVirtual networkDistributed computingNetwork virtualizationResource allocationWireless networkNetwork topologyCloud computingComputer networkVirtualizationWireless

Abstract

fetched live from OpenAlex

Space-air-ground integrated networks (SAGINs) are envisioned to provide seamless coverage and enhanced flexibility compared with traditional terrestrial mobile networks, which has attracted much attention from both industry and academia. However, orchestrating heterogeneous resources in such a large-scale and dynamic network is challenging, especially encountering diverse services with multi-dimensional requirements. In this paper, we first propose a software-defined networking (SDN) and network function virtualization (NFV)-based reconfigurable SAGIN architecture for constructing service function chains (SFCs). Based on that, we investigate the SFC orchestration and wireless resource management where the virtual link rate adaption between each virtual network function (VNF) is introduced to improve the network resource utilization. Considering the limited physical resource and the heterogeneity in SAGINs, we jointly formulate the VNF embedding, virtual link rate adaption, and wireless resource allocation as a mixed-integer nonlinear programming (MINLP) problem to maximize the network profit. Due to the NP-hardness of the problem, we first transform the problem into a continuous optimization problem by successive convex approximation. By introducing an additional penalty into the objective function, an iterative alternation algorithm is proposed to find a near-optimal solution of the transformed problem. Extensive simulation results show that our proposed approach outperforms the benchmarks in average network revenue, successfully serving probability, and resource consumption.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.883
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.012
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.013
GPT teacher head0.225
Teacher spread0.212 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it