MétaCan
Menu
Back to cohort
Record W1983739428 · doi:10.2298/csis0801001f

Elimination of generalized ping-pong effects using triple-layers of location areas in cellular networks

2008· article· en· W1983739428 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

VenueComputer Science and Information Systems · 2008
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsPing pongComputer sciencePagingPing (video games)Terminal (telecommunication)Scheme (mathematics)Computer networkCellular networkReal-time computingSimulationMathematics

Abstract

fetched live from OpenAlex

Location-areas is a popular location management scheme in cellular networks In the location areas scheme, a service area is partitioned into location areas, each consisting of contiguous cells. A mobile terminal updates its location whenever it moves into a cell that belongs to a new location area. However, no matter how the location areas are designed, the ping-pong location update effect exists when a mobile terminal moves back and forth between two location areas. The paper defines a new kind of ping-pong effect referred to as the generalized ping-pong effect, and shows that it accounts for a nonnegligible portion of the total location update cost. Although several strategies have been proposed to reduce the ping-pong effect in the literature, they either eliminate no generalized ping-pong effect or introduce a larger paging cost. This paper proposes a triple-layer location management strategy to eliminate the generalized ping-pong effect, therefore greatly reducing the total location update cost. Simulation results show that the triple-layer strategy outperforms the existing schemes designed to reduce the ping-pong effect.

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.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.718
Threshold uncertainty score0.407

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.003
Science and technology studies0.0000.000
Scholarly communication0.0000.005
Open science0.0010.000
Research integrity0.0000.000
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.027
GPT teacher head0.258
Teacher spread0.231 · 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