Limited intermediate buffer switch modules and their interconnection networks for B-ISDN
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Gupta et al. (1991) presented an analysis of a limited intermediate buffer (LIB) switch consisting of input buffers and a limited amount of buffers in the switch fabric, where contention for the output ports occurs. A novel scheduling scheme based on head of line blocking was proposed, which improved the performance significantly. For uniform random traffic, a 16*16 LIB switch had an achievable throughput equal to 87.5%. The authors examine the switch performance under two delay dependent priority classes and show that the achievable throughput can be increased to 91%. To build large-size switching systems, a multistage interconnection network is proposed, which meets the demands of large-scale asynchronous transfer mode (ATM) switch design, such as (1) modularity, (2) relaxed synchronization, (3) guaranteed high performance without requiring internal speedup, and (4) maintaining packet sequence integrity. The simulation results of three-stage interconnection networks prove the efficacy of the LIB switch architecture and the proposed scheduling scheme.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| 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.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 it