Content-aware and QoE Optimization of Video Stream Scheduling over LTE Networks using Genetic Algorithm and Random Neural Networks
Bibliographic record
Abstract
Long Term Evolution (LTE) networks support Quality of Service (QoS) of multimedia services with fast communication connectivity, high data transfer speed and high level of security. Video streaming over LTE networks is one of the highest proportions of global mobile data traffic and is growing; this has led to the development of several scheduling algorithms aimed at improving the performance of these networks. The performance analysis and evaluation of existing scheduling algorithms are generally limited to QoS parameters. It is not clear how these scheduling algorithms perform in terms of Quality of Experience (QoE) which is the overall acceptability of a service or application, as perceived subjectively by end users. Video content has a major impact on QoE; thus its analysis in scheduling algorithms performance is critical. The aim of this study is to classify video content based on the impact of video content on quality over LTE networks. This classification is then used to develop novel QoE-aware optimization scheduling of video traffic in order to achieve maximum QoE. Our approach focuses on the development of optimization downlink scheduling based on a novel integration between random neural networks (RNN) and genetic algorithms (GA) to learn complex non-linear mapping of QoE and to search for the optimal parameters, respectively. An open source simulation tool for LTE networks (LTE-Sim) has been used to collect unique RNN training database based on existing scheduling algorithms. A comparison between the proposed scheduler and state-of-the-art LTE downlink scheduling algorithms (FLS, EXP-rule, and LOG-rule) has been made under different network conditions. Simulation results showed an increase in performance of about 15% in terms of QoE and throughput while maintaining fairness.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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".