{"id":"W2136548423","doi":"10.1109/mcom.2010.5594687","title":"Shortest path bridging: Efficient control of larger ethernet networks","year":2010,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer network; Computer science; Forwarding plane; Bridging (networking); Backhaul (telecommunications); Shortest path problem; Ethernet; Metro Ethernet; Distributed computing; Scalability; Ethernet flow control; Network packet; Base station","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001219676,0.0005929795,0.0004696675,0.0007334405,0.0003806718,0.001217274,0.001284851,0.0003228705,0.003060791],"category_scores_gemma":[0.001398041,0.0001931568,0.0001686151,0.000571163,0.0005510784,0.001836511,0.001207495,0.0006354658,0.0002752447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004764611,"about_ca_system_score_gemma":0.000345348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006557913,"about_ca_topic_score_gemma":0.0007355462,"domain_scores_codex":[0.9995346,0.00008497788,0.00003062464,0.00008842564,0.0002075427,0.00005381645],"domain_scores_gemma":[0.9995047,0.0002083365,0.00007456687,0.00008741293,0.00008801194,0.00003687907],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003581622,0.0001424499,0.0007928478,0.0003389744,0.00005742444,0.0001991857,0.0005531273,0.1868737,0.09346947,0.1800865,0.008997471,0.5281307],"study_design_scores_gemma":[0.00006612482,0.000218788,0.0003405007,0.00003474794,0.00002433415,0.0001145184,0.00008219452,0.9006898,0.01872449,0.04568106,0.03399547,0.00002793689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02133363,0.0008495476,0.9713652,0.0001838597,0.0001152834,0.00007784019,0.00004584782,0.001458987,0.004569835],"genre_scores_gemma":[0.7771732,0.001274793,0.2154279,0.0001306679,0.0002577467,0.0001815059,0.0002282479,0.0002565797,0.005069431],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003060791,"threshold_uncertainty_score":0.01023936,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0188894170185863,"score_gpt":0.2726025714176813,"score_spread":0.253713154399095,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}