MétaCan
Menu
Back to cohort
Record W2383808499

The NAT Traversal Based on STUNT

2010· article· en· W2383808499 on OpenAlexvenueno aff
Tan Bing

Bibliographic record

VenueMicrocomputer applications · 2010
Typearticle
Languageen
FieldEngineering
TopicPower Systems and Technologies
Canadian institutionsnot available
Fundersnot available
KeywordsNatTCP hole punchingComputer scienceNAT traversalComputer networkTree traversalPort (circuit theory)ReuseNetwork address translationConnection (principal bundle)Domain (mathematical analysis)Distributed computingOperating systemThe InternetTransmission Control ProtocolTCP global synchronizationAlgorithmInternet ProtocolElectrical engineeringEngineeringMathematicsNetwork packet
DOInot available

Abstract

fetched live from OpenAlex

The NAT traversal technology-STUNT based on TCP can pass through most types of the NAT,which solves the problem of the inaccessible TCP communications between peers after operating NAT,and makes the communications between peers possible. This paper presents afeasible solution through SymmetricNAT based on the STUNT. It uses the port prediction techniques to predict the communication port address,and forges a TCP connection by reusing the TCP connection numbers. Also the design of the domain settles the problem that NAT communications cannot support loopback address. Finally through analysis and experiments,the solution is verified to well meet the design requirements.

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.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.004
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.002

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.002
GPT teacher head0.177
Teacher spread0.175 · 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 designBench or experimental
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
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueMicrocomputer applicationsSame topicPower Systems and TechnologiesFrench-language works237,207