Résolution des problèmes de routage asymétrique et de partage de charge dans les pare-feux
Bibliographic record
Abstract
RESUME. Les pare-feux (plus connus sous leur nom anglais de firewall) sont devenus indispensables dans la defense du perimetre de securite des reseaux. Les regles dynamiques installees sur les pare-feux necessitent dans la plupart des cas que les paquets (d'un flux) entrants et sortants traversent le meme pare-feu, le cas echeant les paquets entrants dans le reseau sont ignores et donc non achemines a leur destination. Ce probleme est du au routage asymetrique des paquets (les paquets sortent du reseau en suivant une certaine route non identique a la route de retour). Le partage de charge utilisant les metriques de routage peut induire qu'une regle dynamiquement soit creee sur un pare-feu et que les paquets de donnees associes traversant un autre pare-feu (ils seront donc ignores). Dans ce papier les auteurs decrivent les solutions actuelles, leurs limites et proposent une nouvelle solution pour la resolution des problemes du routage asymetrique et du partage de charge. Les mecanismes proposes sont applicables a tout service necessitant l’installation dynamique de regles sur un routeur (QoS entre autres).
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.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.003 | 0.002 |
| Insufficient payload (model declined to judge) | 0.010 | 0.001 |
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".