MétaCan
Menu
Back to cohort
Record W2291009813 · doi:10.1109/glocom.2015.7417804

Towards Intelligent LTE Mobility Management through MME Pooling

2015· article· en· W2291009813 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

Venue2015 IEEE Global Communications Conference (GLOBECOM) · 2015
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsWestern University
Fundersnot available
KeywordsComputer sciencePoolingMobility managementQuality of serviceDistributed computingOverhead (engineering)HeuristicContext (archaeology)Computer networkMobility modelLatency (audio)Mobile computingMathematical optimizationArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

Long term evolution (LTE) is a leading mobile technology that provides very high speeds, low latency, and better quality-of-service (QoS). However, because of the exponential growth in the number of mobile users, the variety of new handheld devices, and the incremental use of different applications, the core network experiences a significant signaling overhead. This demand requires the design of intelligent, optimized mobility management methods. The present work attempts to overcome signaling overhead expansion and to define the fundamental basis for designing a tracking area list (TAL). In this context, we differ from other studies by introducing a model that relates the tracking area list to the mobility management entity (MME) which enables more control and adds intelligence to the system. Two MME pooling schemes are investigated namely, centralized and distributed MME schemes. The proposed model is NP-hard; thus, the problem can be simplified with a few assumptions (which do not violate the constraints of the problem) to become a solvable linear problem (LP). Moreover, a low-complexity heuristic algorithm is developed by determining the percentage use of the lists/MME in each cell. The results show that the centralized scheme outperforms the distributed one. Also, the heuristic algorithm offers sub-optimal results when compared to the LP solution.

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 categoriesMeta-epidemiology (narrow), Open science, Insufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.826
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0160.008
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.001

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.198
GPT teacher head0.401
Teacher spread0.202 · 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