MétaCan
Menu
Back to cohort
Record W1531125993 · doi:10.5772/10169

Cross-Layer Connection Admission Control Policies for Packetized Systems

2010· book-chapter· en· W1531125993 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueSciyo eBooks · 2010
Typebook-chapter
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsQueen's University
Fundersnot available
KeywordsComputer networkAutomatic repeat requestComputer scienceNetwork packetQuality of serviceCode division multiple accessTelecommunications linkBase stationHybrid automatic repeat requestAdmission controlPhysical layerWirelessTelecommunications

Abstract

fetched live from OpenAlex

In summary, this chapter provides a framework for joint optimization of packet-switched multiple-antenna systems across physical, packet and connection levels. We extend the existing CAC policies in packet-switched networks to more general cases, where the SINR may vary quickly relative to the connection time, as encountered in multiple antenna base stations. Compared with the CAC policy for circuit-switched networks, the proposed connection admission control policy allows dynamical allocation of limited resources, and as a result, is capable of efficient resource utilization. The proposed CAC policy demonstrates a flexible method of handling heterogeneous QoS requirements while simultaneously optimizing overall system performance.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Scholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Other · Consensus signal: Other
Teacher disagreement score0.931
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.000
Science and technology studies0.0010.000
Scholarly communication0.0010.000
Open science0.0030.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.053
GPT teacher head0.331
Teacher spread0.278 · 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