SFCaaS: Service function chains as a service in NFV environments
Bibliographic record
Abstract
With the growing deployment of emergent technologies like software-defined networking, network services are expected to be revolutionized. In this paper, we investigate offering Service Function Chains as a Service (SFCaaS) in NFV environments. We describe the potential business model to offer such a service and then we address the service function chain provisioning and resource allocation problem. As the chain is deployed thanks to virtual machines (i.e., instances) and links, we conduct first a detailed study of the costs of Amazon EC2 instances with respect to their location, size, type and performance. Afterwards, we address the resource allocation problem for service function chains from the SFC provider's perspective. We formulate the problem as an integer linear program aiming at reducing operational costs of the service function chains (i.e., costs of virtual machine instances and links, and synchronization among the instances). To address large-scale instances of the problem, we also propose a new heuristic algorithm to reduce operational costs taking into account the conducted study of the costs of Amazon EC2 instances. We show through extensive simulations that the proposed heuristic significantly reduces operational costs compared to a baseline algorithm inspired by the existing literature.
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.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.001 |
| 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".