Achieving Lightweight Path Validation and Packet Modification Detection in Software-Defined Networks
Bibliographic record
Abstract
Software-Defined Networks (SDN) bring unprecedented agility and programmability to traditional networks by decoupling the control plane and data plane. However, this separation enables adversaries to manipulate data plane forwarding behaviors or modify packet payloads, thereby violating the network security policies set by the control plane and leading to information leakage, network congestion, or even network collapse. In this article, we propose an Enhanced Lightweight Path Validation Scheme (EL-PVS) for the SDN environment. Firstly, we propose a packet forwarding path validation scheme that verifies the paths traversed by packets, alongside a theoretical analysis of this validation process. Then, we extend the scheme with a network flow-level path validation to improve the validation efficiency, and present a storage optimization method to reduce the storage overhead in the validation process. To support large-scale deployment, we design a path partition scheme and present a Greedy-based KeySwitch Node Selection Algorithm (GKSS) to pinpoint optimal switches for path partition, significantly reducing overall data plane storage usage and the total number of paths requiring validation. In addition, we extend our path validation scheme to detect packet payload modification, where a multi-phase packet modification detection approach is designed, and then the detection results are integrated with path validation information to minimize switch-to-controller bandwidth usage. Finally, we present an anomaly switch identification technique to identify abnormal switches when the controller encounters validation failure. The evaluation results verify that EL-PVS enables flow-level path validation and packet modification detection with small validation header, minimizing processing delay and switch storage overhead.
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.002 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".