{"id":"W2103438486","doi":"10.1109/glocom.2004.1378208","title":"A fuzzy constraint-based routing algorithm for traffic engineering","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Dijkstra's algorithm; Computer science; Equal-cost multi-path routing; Suurballe's algorithm; Routing (electronic design automation); Network packet; Constraint (computer-aided design); Blocking (statistics); Path (computing); Load balancing (electrical power); Algorithm; Static routing; Traffic engineering; Link-state routing protocol; Shortest path problem; Fuzzy logic; Distributed computing; Computer network; Routing protocol; Mathematics; Theoretical computer science; Artificial intelligence","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":[],"consensus_categories":[],"category_scores_codex":[0.0002268323,0.0001228218,0.0001304235,0.0000572012,0.00007846732,0.0001128957,0.000336047,0.0000492155,0.00001326028],"category_scores_gemma":[0.00001895064,0.000116074,0.00009056181,0.0001487781,0.00001658793,0.0001749789,0.00002025,0.0000791203,0.00002612536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003112977,"about_ca_system_score_gemma":0.00007747766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.850415e-7,"about_ca_topic_score_gemma":0.000003405573,"domain_scores_codex":[0.9990882,0.00001123038,0.0001914876,0.0002654934,0.0001178671,0.0003256831],"domain_scores_gemma":[0.9993841,0.0002188733,0.00003756937,0.0002049292,0.00005662686,0.00009790165],"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":[8.782087e-7,0.00001781352,9.967162e-7,0.000001785009,0.000007377494,0.000001151026,0.00002552445,0.1014794,0.0000191337,0.04657525,0.0003296788,0.851541],"study_design_scores_gemma":[0.0008199426,0.00003658406,0.000007222954,0.00001126781,0.000005101294,0.000006700093,0.000008821031,0.9878321,0.0001183042,0.00002402826,0.01097534,0.0001545976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009464733,0.00006659378,0.9949533,0.002036142,0.0002254824,0.0002163582,0.000001954954,0.0006430779,0.0009106486],"genre_scores_gemma":[0.5388749,5.08102e-7,0.4600914,0.0005718531,0.0002294453,0.00003406055,0.000001374991,0.000006356928,0.0001902045],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8863527,"threshold_uncertainty_score":0.473336,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008684264275075362,"score_gpt":0.2101746471924393,"score_spread":0.2014903829173639,"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."}}