{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001756808,0.0006838978,0.0007703719,0.0009507045,0.0002469935,0.0005746695,0.003777775,0.0005161494,0.00002264206],"category_scores_gemma":[0.00008898832,0.0006580004,0.0001441966,0.001360871,0.0003509008,0.0004519398,0.001341923,0.001454364,0.00004722328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004474542,"about_ca_system_score_gemma":0.0004473024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004725507,"about_ca_topic_score_gemma":0.0004563782,"domain_scores_codex":[0.9948536,0.00003887562,0.0008249102,0.002017108,0.0009625959,0.001302918],"domain_scores_gemma":[0.9969398,0.0008821605,0.0002856414,0.001351489,0.0002001679,0.0003407791],"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.00001020882,0.00001209752,0.00005726228,0.000004611085,0.000004245486,0.0001416692,0.0002631515,0.5594041,9.159805e-7,0.01409103,0.00003168753,0.4259791],"study_design_scores_gemma":[0.0004757571,0.0001371016,0.0001271935,0.0006417985,0.000005604303,0.00006817761,3.11139e-7,0.9890655,0.000006203528,0.007966088,0.0007766814,0.0007296305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000630732,0.0004217118,0.9919589,0.0008527326,0.002569419,0.0006615536,0.000002032129,0.0002530461,0.003217523],"genre_scores_gemma":[0.3340862,0.00004579016,0.6575118,0.006417648,0.001484868,0.00002330132,0.000007199965,0.00006520483,0.0003580005],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4296614,"threshold_uncertainty_score":0.9995871,"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."}}