A Novel Approach for Profile Optimization in DOCSIS 3.1 Networks Exploiting Traffic Information
Bibliographic record
Abstract
The latest release of the data over cable service interface specification (DOCSIS), namely DOCSIS 3.1, has introduced the use of adaptive bit loading profiles. The design of these profiles is critical for the overall performance of a hybrid fiber coaxial (HFC) cable system. Previous works on profile optimization for DOCSIS networks have mainly focused on grouping cable modems (CMs) based on their signal-to-noise ratio (SNR) similarity to maximize the system’s capacity. However, this approach can be inefficient due to effect of data demand and traffic variations that can highly affect the overall system performance. In this paper, we introduce a profile design approach to maximize the average throughput of an HFC system while considering the effect of both CMs’ traffic and channels SNRs on the system’s performance. Moreover, the profile optimization should not require knowledge of future instantaneous data arrival rates, which is not possible to obtain in practice. Thus, our proposed approach uses only average information which can be easily predicted using learning techniques. We show that the proposed approach yields significantly high performance, particularly for scenarios with high degree of heterogeneity in the CMs’ traffic.
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.003 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
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".