{"id":"W1969412326","doi":"10.1109/tpds.2015.2392760","title":"Achieving Optimal Traffic Engineering Using a Generalized Routing Framework","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science and Technology Entrepreneurship Development Board","keywords":"Multiprotocol Label Switching; Computer science; Open Shortest Path First; Traffic engineering; Constrained Shortest Path First; Mathematical optimization; Routing protocol; Computer network; Label switching; Path vector protocol; Equal-cost multi-path routing; Shortest path problem; Distributed computing; Routing (electronic design automation); Link-state routing protocol; Quality of service; Mathematics; Graph; K shortest path routing; Theoretical computer science","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0003347481,0.0002549562,0.0003331249,0.0001016142,0.0002537617,0.0003513822,0.0002935595,0.0001620584,0.000002215015],"category_scores_gemma":[0.00001377613,0.0002436215,0.00009736252,0.0003972179,0.00002769969,0.000318356,0.000004302911,0.0003143151,0.00001099971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009668137,"about_ca_system_score_gemma":0.00008518316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003544936,"about_ca_topic_score_gemma":0.000001785571,"domain_scores_codex":[0.9983777,0.0001129796,0.0003825558,0.0004223981,0.0002898187,0.0004144801],"domain_scores_gemma":[0.9990009,0.0001475717,0.000100634,0.0003320459,0.00009038083,0.0003284463],"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.00002919872,0.00004756875,0.000009289805,0.00001235387,0.00005134922,0.00001471393,0.0002450453,0.9916124,0.00005750507,0.002262828,0.00005093201,0.005606764],"study_design_scores_gemma":[0.0008907117,0.00007051538,0.0000124514,0.0001214878,0.00003254602,0.000102136,0.0001430398,0.9979801,0.000006494304,0.000008556869,0.0003561139,0.0002758521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1055298,0.0005227388,0.8919276,0.0001431582,0.001210579,0.0002298037,0.00002507437,0.0003985364,0.00001267383],"genre_scores_gemma":[0.9773646,0.00001694673,0.02231834,0.00004155134,0.0001504606,0.00004666205,0.000004940563,0.0000167729,0.00003972696],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8718348,"threshold_uncertainty_score":0.9934598,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02958790818677237,"score_gpt":0.2414304263517627,"score_spread":0.2118425181649903,"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."}}