A Fair VNF Assignment Algorithm for Network Functions Virtualization
Bibliographic record
Abstract
On-demand resource management is a challenging prospect, especially in communication networks where the users' requirements of network resources are volatile. This challenge is magnified by the current shift of hardware-dependent network technologies into virtual Network Functions (vNFs) in a cloud-based platform and the proliferation of the Internet of Things (IoT) networks. vNFs are an integral part of edge devices that aims to improve service providers' response time, eliminate redundancy, and end to end latency results in operators' lower operating costs significantly. The efficiency of such a virtualized system largely depends on the optimization of resource allocation between users and Virtual Machines (VM) or hosting devices. One approach to addressed this issue is to minimize the latency of the entire communication network, however, the concern is that this mechanism does not ensure fairness of resource allocation because some of the users may receive enhanced services than others. In the previous study, a Stable Matching Algorithm is proposed to minimize the latency between vNFs and VMs but the algorithm failed to ensure the fairness of the requested services and server elements. In this study, we further extend the previous model to ensure the fairness. Our proposed solution minimizes the maximum latency in the network. This problem is an NP-hard and hence we provide a local search based solution. The experimental result shows improved fairness from other approaches and the fairness index is close to the optimal, which in fact represents the elimination of imbalances to a great extent.
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.000 |
| 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.000 |
| 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".