Data plane acceleration for virtual switching in data centers: NP-based approach
Bibliographic record
Abstract
With the emerging trend of server virtualization, a new network access layer has emerged that is composed of the virtual switches running on the server platform, providing connectivity among the virtual machines (VMs) that live on the same physical server. This layer is generally implemented using the Open vSwitch (OVS) or an equivalent proprietary virtual switch. In networking for virtualization, virtual switch provides a simple solution for VM-to-VM connectivity, but this function of virtual switching must provide sustained, aggregated high-bandwidth network traffic. Majority of virtual switches implementation do not deliver adequate performance. To address this problem, we propose a strategy that aims to improve virtual switches performance by extending the packet processing tasks to hardware accelerators such as network processors. The proposed strategy is based on an adaptive and dynamic allocation of processors resources. The allocation mechanism consists on mapping the virtual switch tasks to the adequate set of resources, i.e. multi-core datapath or hardware accelerator datapath. Thus, the proposed solution tends to enhance throughput and scales down latency in order to accelerate network traffic switching over virtual switches.
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.001 | 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.001 |
| Open science | 0.003 | 0.001 |
| 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".