Service Function Chain Deployment With VNF-Dependent Software Migration in Multi-Domain Networks
Bibliographic record
Abstract
In the 6G era, user demand for low-latency, cost-effective extreme services such as extended reality (XR) and holographic communications has significantly increased. Multi-domain networks, known for their vast capacity and coverage, are essential in fulfilling the growing demand for high-performance services. Despite their potential, these networks face challenges with domain isolation, requiring a software defined network (SDN) controller for inter-domain communication. Network function virtualization (NFV) enhances flexibility of service delivery with customizable service function chain (SFC), yet prior research falls short in delivering low-latency, cost-efficient services in multi-domain NFV networks alongside an unreasonable assumption that software on physical nodes can support the execution of all virtualization network functions (VNFs). In this paper, we study the problem of SFC deployment with VNF-dependent software migration (SD-VDSM) in multi-domain networks. Particularly, we first formulate the problem by setting an objective to minimize the end-to-end communication delay and the associated costs of service provisioning, while simultaneously ensuring load balancing across multi-domain networks. However, complexity of the issue escalates to an intractable level due to the intertwined nature of SFC deployment strategies and VNF-dependent software migration tactics, which mutually influence each other intricately. To tackle this issue, we propose an innovative heuristic algorithm, designated as the Joint SFC Deployment with VNF-Dependent Software Migration Algorithm (JSD-VDSMA). Comprising three fundamental steps, this algorithm is crafted to adeptly resolve the complexities of service provisioning across multi-domain networks. A suite of rigorous experimental assessments is detailed, demonstrating the capability of our proposed JSD-VDSMA. Through these comparative analyses, we demonstrate its effectiveness not only to increase the service acceptance rate but also to diminish both the end-to-end communication delay and resource utilization costs in comparison to its counterparts.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".