Efficient and Secure Traffic Scheduling Based on Private Sketch
Bibliographic record
Abstract
In today’s data–driven world, the explosive growth of network traffic often leads to network congestion, which seriously affects service performance and user experience. Network traffic scheduling is one of the key technologies to deal with congestion problems. Traditional traffic scheduling methods often rely on static rules or pre–defined policies, which make it difficult to cope with dynamically changing network traffic patterns. Additionally, the inability to efficiently manage tail contributors that disproportionately contribute to traffic can further exacerbate congestion issues. In this paper, we propose ESTS, an efficient and secure traffic scheduling based on private sketch, capable of identifying tail contributors to adjust routing and prevent congestion. The key idea is to develop a randomized admission (RA) structure, linking two count–mean–min (CMM) sketches. The first CMM sketch records cold items, while the second, following the RA structure, stores hot items with high frequency. Moreover, considering that tail contributors may leak private information, we incorporate Gaussian noise uniformly into the CMM sketch and RA structure. Experimental evaluations on real and synthetic datasets demonstrate that ESTS significantly improves the accuracy of feature distribution estimation and privacy preservation. Compared to baseline methods, the ESTS framework achieves a 25% reduction in average relative error and a 30% improvement in tail contributor identification accuracy. These results underline the framework’s efficiency and reliability.
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.012 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.005 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.001 | 0.002 |
| 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".