A neuro‐evolutionary approach for software defined wireless network traffic classification
Bibliographic record
Abstract
Abstract Accurate network traffic classification is an essential and challenging issue for wireless network management and survivability. Existing network traffic classification algorithms, on the other hand, cannot meet the required specifications of real networks' in terms of user privacy control overhead, latency, and above all, classification speed. For wireless network traffic classification, machine learning‐based and hybrid optimization techniques have been deployed. This paper takes a software‐defined wireless network (SDWN) architecture for network traffic classification into account. Because the proposed scheme is perfectly contained within the network controller,the SDWN controller's higher processing capability, global visibility, and programmability can be used to achieve real‐time, adaptive, and precise traffic classification. In this paper, a neuro‐evolutionary approach is proposed in which the feed forward neural network (FFNN) is the base classifier and particle swarm optimization (PSO) is used to train the FFNN to accurately classify traffic while minimizing communication overhead between the controller and the SDWN switches. Simulation experiments were conducted by acquiring real‐world internet datasets to test the efficacy of the proposed scheme. The results and the state‐of‐the‐art comparisons show that the proposed approach has outperformed in terms of accuracy in wireless traffic classification.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| 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".