MétaCan
Menu
Back to cohort
Record W2100359074 · doi:10.1109/25.832966

Strategies to maximize carried traffic in dual-mode cellular systems

2000· article· en· W2100359074 on OpenAlexaff
G.D. Morley, W.D. Grover

Bibliographic record

VenueIEEE Transactions on Vehicular Technology · 2000
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsExploitDual (grammatical number)Computer scienceBandwidth (computing)Linear programmingControl (management)Mode (computer interface)Dual modeComputer networkEngineeringElectronic engineeringComputer securityArtificial intelligenceAlgorithm

Abstract

fetched live from OpenAlex

Dual-mode cellular systems based on the EIA/TIA IS-54 standard offer the eventual prospect of carrying up to six digital calls in the same bandwidth as a single analog call. During the transition from analog to digital service, however, the call-carrying capacity of such systems will be limited by the presence of existing analog users. In this situation, it is reasonable to ask if there are call-handling strategies that could increase the total traffic carried by providing preferential treatment to digital users. We consider four such strategies for maximizing the total traffic carried by a dual-mode cellular system. For two of these strategies, including the baseline "no-control" strategy we develop closed-form solutions for carried traffic and other related service statistics. The closed-form solution for the no-control case is then extended to provide a tight upper bound on carried traffic for any control strategy. We also present a method for finding the optimal control strategy by applying linear programming (LP) techniques. The strategies are compared for various proportions of analog and digital users and offered traffic levels. The findings show that it is actually quite difficult to obtain gains using strategies that exploit the difference in spectral efficiency between analog and digital calls, even with formally optimal strategies. While this is an unexpected finding, we feel the conclusion has been well validated and is now understood and explained in the paper.

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.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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0020.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.015
GPT teacher head0.265
Teacher spread0.251 · 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

Citations22
Published2000
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Vehicular TechnologySame topicWireless Communication Networks ResearchFrench-language works237,207