Towards Intelligent LTE Mobility Management through MME Pooling
Bibliographic record
Abstract
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".