Providing packet-loss guarantees in DiffServ architectures
Bibliographic record
Abstract
Differentiated Services (DiffServ) is a proposed architecture for the Internet in which various applications are supported using a simple classification scheme. Packets entering the DiffServ domain are marked depending on the packets' class. Premium service and assured service are the first two types of services proposed within the DiffServ architecture other than the best effort service. Premium service provides a strict guarantee on users' peak rates, hence delivering the highest quality of service (QoS). However, it expects to charge at high prices and also has low bandwidth utilization. The assured service provides high priority packets with preferential treatment over low priority packets but without any quantitative QoS guarantees. In this paper, we propose a new service, which is called loss guaranteed (LG) service for DiffServ architectures. This service can provide a quantitative QoS guarantee in terms of loss rate. A measurement-based admission control scheme and a signaling protocol are designed to implement the LG service. An extensive simulation model has been developed to study the performance and viability of the LG service model. We have tested a variety of traffic conditions and measurement parameter settings in our simulation. The results show that the LG can achieve a high level of utilization while still reliably keeping the traffic within the maximum loss rate requirement. Indeed, we show that the DiffServ architecture can provide packet-loss guarantees without the need for explicit resource reservation.
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.005 |
| 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.001 |
| Scholarly communication | 0.001 | 0.002 |
| 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".