Design Guidelines for Topology Management in Software-Defined Vehicular Networks
Bibliographic record
Abstract
Software-Defined Vehicular Networks (SDVNs) have been a vital component to various radio access technologies that supports massive data loads in various security and infotainment applications. SDVNs elevate the constraints of static hardware network devices to programmable units and provide a global view of the network's status and a common interface between varied radio access technologies. However, having a logically centralized control unit comes with several challenges, including bottleneck issues and densification issues. The distributed control plane appears as a possible alternative to the centralized one yet raises questions concerning where to deploy control units, how many SDN controllers are needed in a given network structure, and when to migrate switches or change controllers. Therefore, the development of an efficient topology management entity is an important aspect that needs to be addressed. In this article, we define the main components necessary to develop and design an efficient SDVN topology management architecture. We evaluate the current solutions and methods of controllers' deployment and assignment for software-defined vehicle networks. We then discuss several challenges, design guidelines, open issues, and future directions for research related to the development of future adaptive software-defined vehicular networks.
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.004 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.004 | 0.003 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.004 | 0.004 |
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".