<i>BloomStore</i>: Dynamic Bloom-Filter-based Secure Rule-Space Management Scheme in SDN
Bibliographic record
Abstract
Software-defined networking (SDN) provides an efficient way of managing traffic load by shifting complex and rigid computing tasks to the centralized controller. It reduces the burden on the switches, task of which is to perform the routing based upon the rule-action pair. However, the flow table storage capacity of switches is limited. It may have to face performance bottlenecks, which, in turn, can cause serious security breaches and performance degradation. Hence, in this article, BloomStore, which is a dynamic bloom-filter-based secure rule-space management scheme in SDN, is proposed. BloomStore handles the data traffic dynamically by managing network resources. A twofold security check is used for secure data transfer using double hashing, i.e., two independent hash functions are used to generate k hash functions. Moreover, partitioned hashing is proposed to have insertion and query in a bucket of bloom array. The result analysis demonstrates that BloomStore outperforms its competing variants with respect to various performance parameters.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".