MétaCan
Menu
Back to cohort
Record W2063924430 · doi:10.1109/noms.2006.1687642

On improving performance of Network Intrusion Detection Systems by efficient packet capturing

2006· article· en· W2063924430 on OpenAlexaff
Asit Baran Biswas, Pranay Sinha

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Security and Intrusion Detection
Canadian institutionsConcordia University
Fundersnot available
KeywordsBottleneckComputer scienceNetwork packetIntrusion detection systemComputer networkPacket analyzerEmbedded systemSoftware deploymentInterface (matter)Packet processingReal-time computingDistributed computingOperating system

Abstract

fetched live from OpenAlex

In a PC based Network Intrusion Detection System (NIDS), the packet capturing component is a key bottleneck which reduces its effectiveness. NIDS deployment on multiprocessor or distributed systems that circumvents this bottleneck do not address operating system performance limitations which are the causal factors behind this bottleneck. Completion of intrusion detection task in bounded time at the sensors is also important to detect complex and co-ordinated attack patterns. Existing Linux based packet capturing solutions, NAPI and PFRING, are inefficient and have poor real-time performance. We have implemented an user space network interface (DMA ring) to capture packets under high network load on a modest commodity platform. DMA ring outperforms existing solutions in terms of higher load bearing, packet capturing capacity and superior real-time behavior. We proposed a scheme using DMA ring, which will improve the performance of an user space NIDS.

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 distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.284
Threshold uncertainty score0.473

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.171
Teacher spread0.167 · 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 teacher head, 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

Citations7
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicNetwork Security and Intrusion DetectionFrench-language works237,207