Optimizing Telematics Network Performance through Resource Virtualization in a Disruptive Environment: The Case of the IP/MPLS Core Network
Bibliographic record
Abstract
We offer a security solution to considerably reduce latency in an IP network by virtualizing the IP/MPLS core network. It consists of adapting a virtualization method to a complex IP network, presenting the simulation of the implementation of this virtualization and the modifications to be made to certain aspects of the code of the solution. These modifications would take into account the key performance indicators of the network in order to guarantee its security and the transmission through very wide bands of data. To do this, we use Software Defined Network (SDN) technology. It allows us to have an emergent, scalable, dynamic, secure, laudable and adaptable network architecture, making it suitable for today's high bandwidth applications and IT services. This architecture decouples network control and digital data transfer functions, making network control directly programmable and the underlying infrastructure abstracted to network applications and services. After describing the soft failover to a virtualized network, we present the new architecture that describes the separation of the control and data planes of the core of the IP/MPLS network of the Autonomous Port of Kribi (PAK) in Cameroon, as part of our research work. We will then present the aspects in which modifying the code would contribute to improving one of the key qualities of service, namely latency in the heart of the network. We go from latencies above 100 ms to latencies below 1 ms; finally we recommend the approach for a continuous modification of the code with a view to optimizing the performance of the network in a continuous process for the reduction of its latency.
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.000 | 0.001 |
| 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.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 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".