A Service Function Chain Traffic Steering Path Algorithm Based on Graph Convolutional Network and Deep Q-Network
Bibliographic record
Abstract
With the rise of applications such as the Internet of Things (IoT) and Virtual Reality (VR), there is an increasing demand for stringent service latency and quality of service requirements, which has led to a shift in network service deployment from cloud to edge, giving rise to Mobile Edge Computing (MEC) architectures.In MEC environments, network infrastructure is distributed near users, allowing access to local networks in real time.However, dynamically orchestrating Service Function Chains (SFCs) presents a significant challenge, especially in resource-constrained settings where maximizing SFC deployments while maintaining low latency is essential for service providers' revenue optimization.To address this challenge, this paper proposes an intelligent SFC orchestration strategy, termed GCN-DQN, which combines Graph Convolutional Networks (GCNs) and Deep Q-Networks (DQNs).The GCN-DQN framework is designed to optimize the request acceptance rate while ensuring compliance with stringent low-latency requirements.To achieve this, the GCN-DQN strategy is designed to perceive network structure, resource availability, and SFCspecific information, enabling optimized decision-making for SFC traffic steering paths.Performance evaluations demonstrate that the proposed algorithm outperforms existing methods in SFC request acceptance rates under various network loads.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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".