ATM switching node design based on a versatile traffic descriptor
Bibliographic record
Abstract
Because of the high speed, the provision of unrestricted bandwidth on demand by ATM-based B-ISDN can only be satisfied by sacrificing network resource utilization. In ATM networks, the network resources are link bandwidth and node buffer space. A new traffic descriptor which directly specifies the resource requirements of ATM traffic streams in terms of bandwidth, buffer space and a set of parameter adjustment rules is proposed. We call this a versatile traffic descriptor (VTD) because it can describe relevant characteristics of all ATM traffic streams including nonstationary traffic streams. Also, the VTD incorporates both the traffic description and the user's QoS specifications. Therefore, there is no need to specify the QoS requirements separately. A radically new, VTD-based switching node design, which uses novel per-connection buffering scheme and service scheduling scheme is also proposed. It is conjectured that the proposed earliest due date (EDD) service scheduling scheme is optimal in per-connection burstiness reduction.
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 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.000 | 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.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".