MétaCan
Menu
Back to cohort
Record W2136548423 · doi:10.1109/mcom.2010.5594687

Shortest path bridging: Efficient control of larger ethernet networks

2010· article· en· W2136548423 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Communications Magazine · 2010
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer networkComputer scienceForwarding planeBridging (networking)Backhaul (telecommunications)Shortest path problemEthernetMetro EthernetDistributed computingScalabilityEthernet flow controlNetwork packetBase station

Abstract

fetched live from OpenAlex

This article provides an overview of IEEE 802.1aq shortest path bridging and outlines some application scenarios that will benefit from the new capabilities SPB offers. SPB is built on the IEEE 802.1 standards, and inherits unaltered the existing OAM and data plane scalability enhancements, such as the MAC-in-MAC forwarding paradigm. SPB introduces link state control for bridge networks, thus improving control plane scalability, network bandwidth utilization, and control of the forwarding paths. Furthermore, SPB minimizes latency by forwarding frames on the shortest path. Network-wide load balancing is also supported by spreading the traffic on multiple equal cost paths in a user controllable manner. Thus, SPB provides enhanced control for Ethernet networks in metro, RAN backhaul, or data center environments.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.976
Threshold uncertainty score0.580

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0030.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.019
GPT teacher head0.273
Teacher spread0.254 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it