Delay tolerant EPC-BGP for discovery services in EPCGlobal networks
Bibliographic record
Abstract
In this paper, we present a new protocol for EPC discovery services, namely Delay Tolerant EPC-BGP (DT-EPC-BGP), which is an extension of the previously proposed EPC-BGP. By inheriting all features of EPC-BGP features, DT-EPC-BGP introduces a new mechanism that allows information about the status of the mesh nodes to be exchanged along with other routing information. This new extension sets update sessions with only active nodes, and drops any update request that is destined to an inactive node. We have evaluated DT-EPC-BGP in terms of blocking probability, similarities among routing tables and number of updates in comparison to EPC-BGP. We have shown that DT-EPC-BGP outperforms its predecessor, EPC-BGP by introducing lower blocking probability, lower inconsistency in routing tables among different nodes, and lower number of updates which leads to less control overhead messages.
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.002 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| 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".