{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001650582,0.001113644,0.0009394581,0.0007235208,0.0005771266,0.001346537,0.001280372,0.0009376187,0.001021391],"category_scores_gemma":[0.001975501,0.0003671404,0.001021711,0.0008812584,0.001735923,0.001999486,0.001821442,0.001269328,0.0001458338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001766952,"about_ca_system_score_gemma":0.001974093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002402863,"about_ca_topic_score_gemma":0.002807502,"domain_scores_codex":[0.9986601,0.0006019428,0.00004938461,0.0001907602,0.0003373249,0.0001605578],"domain_scores_gemma":[0.999431,0.0002223738,0.00006600859,0.0001426374,0.0001028165,0.00003520411],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001494739,0.0000220485,0.00008602678,0.00005091385,0.00001652409,0.00006992427,0.00005651974,0.6291731,0.003181794,0.3502368,0.0006773924,0.0164139],"study_design_scores_gemma":[0.000005674384,0.0000184958,0.00003627588,0.000005710081,0.000006101244,0.00002315536,0.0000110482,0.8921022,0.000502965,0.1060206,0.001259476,0.000008231186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009220306,0.0001779256,0.9870098,0.0001634282,0.00002288199,0.00003094392,0.00002414862,0.0001111673,0.003239487],"genre_scores_gemma":[0.5634813,0.001035035,0.4297653,0.0002623808,0.0001568822,0.0003050941,0.0001441581,0.0001480338,0.004701773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002402863,"threshold_uncertainty_score":0.01282018,"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."}}