A high-speed traffic manager architecture for flow-based networking
Bibliographic record
Abstract
This paper presents a fast traffic manager architecture targeting to meet some requirements of the 5G next generation cellular communication technology, and of the high-speed networking devices in the software defined networking context. Also, an important goal is to reduce latency to a minimum in order to best support the upcoming 5G. The proposed traffic manager functionalities are policing, scheduling, shaping, and queuing of incoming traffic (packets) on egress ports in a network processing unit. Policing, scheduling, and shaping guarantee that packets are sent in such a way to meet the allowed bandwidth quotas for each flow, and enforce some desired quality of service. The implemented architecture is based on the C coding language and is synthesized with the Vivado High Level Synthesis tool. A throughput improvement of 2.0× over previous reported works is claimed. The proposed design of the traffic manager is capable of providing 15.8 Gbps per egress port for 64 byte sized packets, and it works at 93 MHz when implemented with a Zynq 7000 FPGA from Xilinx.
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.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".