DSO: An Intelligent SFC Orchestrator for Time and Resource Intensive Ultra Dense IoT Networks
Bibliographic record
Abstract
Among the massive pool of Internet of Things (IoT) devices in network function virtualization (NFV) context, the urgency for efficient service orchestration is constantly growing. The emerging challenges can be addressed as collaborative optimization of resource utilities and ensuring Quality-of-Service (QoS) with prompt orchestration in dynamic, congested, and resource-hungry IoT networks. Traditional mathematical programming models are NP-hard, hence inappropriate for time sensitive IoT scenarios. This paper promotes the need to go beyond the realms and propose an intelligent Deep Q-Network (DQN) driven service function chain (SFC) orchestration, named as DSO hereafter. We further equip this proposed DSO model with the notion of sharing the flow of already deployed network function rather than urging a new instantiation. The sharing conceptualization improves resource utilization, and DQN is employed for adaptive, robust, and swift orchestration. Our extensive simulation results demonstrate the remarkable capability and adaptability of the proposed DSO model for cutting back running time (≈ 10 hours) and ensuring near-optimal resource utilization across extremely dense IoT substrate network settings. Thus, this research can be regarded as a pioneering tread to scale down massive IoT resource fabrication costs, upgrade profit margin for providers, and sustain QoS.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".