Dynamic QoE/QoS-Aware Queuing for Heterogeneous Traffic in Smart Home
Bibliographic record
Abstract
Smart home gateways have to forward multi-sourced network traffic generated with different distributions and with different quality-of-service (QoS) requirements. The state-of-the-art QoS-aware scheduling methods consider only the conventional priority metrics based on the IP type of service (ToS) field to make a decision for bandwidth allocation. Such priority-based scheduling methods are not optimal to provide both QoS and quality of experience (QoE), since higher priority traffic may not require lower delay than lower priority traffic (for example, traffic generated from medical sensors has a higher priority than traffic from streaming devices, but the latter one requires lower maximum delay). To solve the gaps between QoS and QoE, we propose a new queuing model for QoS-level Pair traffic with mixed arrival distributions in the smart home network (QP-SH) to make dynamic QoS-aware scheduling decisions meeting delay requirements of all traffic while preserving their degrees of criticality. A new metric that combines the ToS field and the maximum number of packets that can be processed by the system' s service during the maximum required delay is defined. Our experiments show that the proposed solution increases 15% of packets that meet their priorities and 40% of packets that meet their maximum delays as well as 25% of the total number of packets in the system.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".