An architecture for a secured tunnel in the Automatic Multicast Tunneling (AMT) environment
Bibliographic record
Abstract
IP multicasting is a communication mechanism in which identical data are communicated from a server to multiple clients. It has two main problems: there is no control over who can receive the multicast data, and every receiver has to be in a network where multicast routing is enabled. Islam and Atwood have shown how to add Receiver Access Control (RAC) to IP multicast. Automatic Multicast Tunneling (AMT) offers a mechanism to enable the clients in a unicast-only region to receive multicast data through an automatically-established tunnel. However, AMT, like the IP multicast that it extends, does not provide any access control over the receivers or any security features. Malla and Atwood have demonstrated how to integrate RAC into the AMT environment, assuming that the AMT tunnel is secure. In this paper, we show how to establish the necessary verifiable identities for the tunnel end points, so that the tunnel can be secured. We also validate the security of our design using the Automated Validation of Internet Security Protocols and Applications (AVISPA) tool.
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.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.001 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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".