MétaCan
Menu
Back to cohort

Full Function Firewalls and Fast Routing Query on MANETs

2014· article· en· W2509031698 on OpenAlexaff
Ting Zhang, Dale Lindskog

Bibliographic record

VenueJournal of Internet Technology and Secured Transaction · 2014
Typearticle
Languageen
FieldComputer Science
TopicNetwork Packet Processing and Optimization
Canadian institutionsConcordia University of Edmonton
Fundersnot available
KeywordsComputer scienceComputer networkMobile ad hoc networkFunction (biology)Information retrievalCell biologyBiology

Abstract

fetched live from OpenAlex

This paper proposes a routing storage and query mechanism for the ROFL firewall scheme, a mechanism that combines a hierarchical routing storage structure with a fast routing query method.ROFL, which stands for Routing as the Firewall Layer, is a firewall scheme designed mainly to prevent insider attacks on Mobile Ad Hoc Networks (MANETs).The proposed mechanism also extends the filtering capabilities of ROFL, allowing packet filtering based on most any traditional packet filtering criteria, e.g., source IP address, source and destination port numbers, TCP flags, etc.

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 imitation

Not 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.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.006
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0020.001
Science and technology studies0.0010.002
Scholarly communication0.0020.006
Open science0.0020.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.

Opus teacher head0.004
GPT teacher head0.194
Teacher spread0.190 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations0
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Internet Technology and Secured TransactionSame topicNetwork Packet Processing and OptimizationFrench-language works237,207