MétaCan
Menu
Back to cohort
Record W2394052413

APAIMD Mechanism And APTCP Based On This Mechanism

2004· article· en· W2394052413 on OpenAlexvenueno aff
Xuefeng Fan

Bibliographic record

VenueMicrocomputer applications · 2004
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceComputer networkMulticastTransmission Control ProtocolNetwork congestionNetwork packetBandwidth (computing)Mechanism (biology)The InternetTransmission (telecommunications)TCP Friendly Rate ControlTelecommunicationsOperating system
DOInot available

Abstract

fetched live from OpenAlex

This paper proposes an AIMD mechanism whose parameters are adjustable, so called Adjustable Parameters AIMD or called APAIMD for short, and a transmission control protocol which realizes this mechanism at receivers and is fit for transporting multimedia traffic in Internet, as its parameters are adjustable, called Adjustable Parameters TCP or called APTCP for short. Neither UDP nor TCP can be used to transport multimedia data, because UDP has no congestion control mechanism and TCP reduces the sending rate in half in response to a single packet lost, which will result in rate wobbling greatly. Under the control of APTCP, multimedia traffic has good smoothness of sending rate and can share bandwidth with competing TCP flows fairly. APTCP has a promising avenue of development for multicast multimedia services, and can be used in unsymmetrical networks.

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.003
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.006
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.005
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.001
Science and technology studies0.0020.001
Scholarly communication0.0030.004
Open science0.0040.005
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0060.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.006
GPT teacher head0.198
Teacher spread0.193 · 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 designSimulation or modeling
Domainnot available
GenreMethods

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
Published2004
Admission routes1
Has abstractyes

Explore more

Same venueMicrocomputer applicationsSame topicNetwork Traffic and Congestion ControlFrench-language works237,207