An Adaptive Load Balancer for Multiprocessor Routers
Bibliographic record
Abstract
By investigating flow-level characteristics of Internet traffic, the authors are able to trace the root of load imbalance in hash-based load-splitting schemes. They model flow popularity distributions as Zipf-like and prove that for typical Internet traffic, a hashing scheme cannot balance workload statistically, not even in the long run. They then develop a novel load-balancing packet scheduler for parallel forwarding systems. The scheduler capitalizes on the nonuniform flow reference pattern and especially the presence of a few high-rate flows in Internet traffic. The authors show that detecting and scheduling these flows can be very effective in balancing workloads among network processors. They introduce an important metric, adaptation disruption, to measure the scheduling efficiency of load-balancing mechanisms in parallel forwarding systems. Because there are relatively few large flows, reassigning them in the load balancer results in little disruption to the states of individual processors. The ideas are validated by simulation results. Finally, the authors discuss the effects on cache performance when classifying flows using two different flow definitions: the destination IP address and the five-tuple. The latter results in finer flow granularity but worse route cache hit rate, which can lead to the degradation of routing table lookup performance.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".