{"id":"W2152283194","doi":"10.1007/978-3-540-72990-7_14","title":"A Robust Routing Plan to Optimize Throughput in Core Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Quality of service; Benchmark (surveying); Distributed computing; Routing (electronic design automation); Criticality; Static routing; Path (computing); Shortest path problem; Equal-cost multi-path routing; Computer network; Traffic engineering; Throughput; Core (optical fiber); Graph; Routing protocol; Theoretical computer science","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.001191008,0.001067441,0.001010105,0.0006441791,0.0004651138,0.000850116,0.001321981,0.0009255167,0.002818268],"category_scores_gemma":[0.002240292,0.0006133351,0.000495624,0.0006703933,0.0006829544,0.001012814,0.0009372373,0.0009659813,0.0003716621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009341879,"about_ca_system_score_gemma":0.001221841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002201356,"about_ca_topic_score_gemma":0.00261866,"domain_scores_codex":[0.9995977,0.0001139907,0.00001851893,0.00007315067,0.0001123676,0.00008432955],"domain_scores_gemma":[0.9994385,0.000250383,0.00006826277,0.00007890932,0.0001185661,0.0000454059],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001128649,0.00003682086,0.0001310599,0.00003356784,0.00001844093,0.0000308156,0.00003171258,0.9399184,0.004180529,0.01379687,0.002037558,0.03967138],"study_design_scores_gemma":[0.000008339249,0.00003597658,0.00003178433,0.000002542565,0.000005754523,0.000006165071,0.000004677957,0.9945796,0.0005439668,0.00460174,0.0001762634,0.000003249065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02619474,0.0001736309,0.9686414,0.0001533266,0.0000526124,0.00008634389,0.0001100328,0.001066512,0.00352148],"genre_scores_gemma":[0.5816429,0.0002317048,0.4133192,0.0001058742,0.00006826317,0.0002193475,0.0002452676,0.0003664338,0.003800931],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002818268,"threshold_uncertainty_score":0.009428024,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04606247519529978,"score_gpt":0.2517556950536331,"score_spread":0.2056932198583333,"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."}}