DiffServ Model with Backpressure for CDMA2000
Bibliographic record
Abstract
The nodes with shared-queues at the CDMA2000 data network have inherent rate mismatch and a single level of service. A core node, the packet control function (PCF) is processing power limited. Whereas a feeding node, the packet data serving node (PDSN), has superior processing metrics. A close-loop backpressure solution was proposed at the literature to efficiently control the PCF queue by utilizing PDSN free buffer space during PCF congestion events. Differentiated services (DiffServ) have been designed for Internet to provide multiple levels of network services. We propose a model for providing service differentiation at the CDMA2000 data networks. The model aims to provide service differentiations comparable to the traditional DiffServ model. The proposed improvement is in providing those services under the CDMA2000 structure of tandem nodes with large rate mismatch and a constraint of maintaining the complexity level of the processing limited core node (the PCF). The model uses a combination of backpressure and DiffServ techniques. The backpressure mechanism is used to push congestion from the PCF to the PDSN edge node where superior treatment of differentiated services can be provided to the traffic. The model differentiates services in terms of the relative access to the output link bandwidth and provides distinct handling to traffic at the multiple RED physical queues. It enables differentiation in terms of the achieved relative throughput, packet loss rate, delay, and jitter. We demonstrate the solution's robustness with various traffic scenarios and system topologies. We show that our architecture is effective in providing bandwidth differentiation, as well as throughput, packet drop rate, and average delay preferences.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".