MétaCan
Menu
Back to cohort
Record W2506127450 · doi:10.1109/icupc.1996.562657

Non-uniform polling and reservation alternatives for bandwidth management in broadband wireless networks

2002· article· en· W2506127450 on OpenAlexaff
Naser Movahhedinia, G. Stamatelos, N.M. Hafez

Bibliographic record

VenueProceedings of ICUPC - 5th International Conference on Universal Personal Communications · 2002
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Network Optimization
Canadian institutionsCarleton University
Fundersnot available
KeywordsPollingComputer networkComputer scienceQuality of serviceBandwidth (computing)ReservationWireless broadbandBase stationBandwidth allocationBroadband networksTime division multiple accessWirelessChannel (broadcasting)Polling systemWireless networkBroadbandTelecommunications

Abstract

fetched live from OpenAlex

To manage the bandwidth in a TDMA-ATM broadband wireless network, an efficient polling based multiple access method, called non-uniform polling, has been proposed previously. Although this system presents improved performance, the disadvantage is that the base station and remotes have to switch between receive and transmit modes quickly. As an alternative to the technical complexity of polling, a reservation based protocol is presented which applies the bandwidth allocation and admission control techniques similar to non-uniform polling. The performance of this system and the non-uniform polling method is compared in terms of cell loss rate of the delay sensitive applications and the mean cell delay. Furthermore the previous analysis and formulations are extended to considering the effect of offered load on interference power, channel failure rate, and the upper bound on the utilization which guarantees user quality of service (QOS) 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.002
metaresearch head score (Gemma)0.003
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.051
GPT teacher head0.282
Teacher spread0.230 · 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
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
Published2002
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of ICUPC - 5th International Conference on Universal Personal CommunicationsSame topicAdvanced Wireless Network OptimizationFrench-language works237,207