{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005112126,0.0006545771,0.000552117,0.0006133351,0.0005769262,0.0007540801,0.001508926,0.0009908207,0.00323195],"category_scores_gemma":[0.001710908,0.0002238626,0.0004664877,0.0008468074,0.0004799432,0.0009150626,0.000605903,0.001052008,0.0008691832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000838678,"about_ca_system_score_gemma":0.00111698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005782839,"about_ca_topic_score_gemma":0.005212903,"domain_scores_codex":[0.9995359,0.00007371984,0.00002334678,0.00008222349,0.0002559775,0.00002884054],"domain_scores_gemma":[0.9995958,0.0001573509,0.00003166133,0.00004116008,0.0001539868,0.00002003853],"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":[0.0001300564,0.0001114541,0.000376558,0.0001976721,0.00006419855,0.000117435,0.00008817356,0.4460228,0.02128032,0.06513102,0.006771297,0.4597091],"study_design_scores_gemma":[0.00002688328,0.00003153572,0.00006639989,0.000007492799,0.00001039471,0.00005705586,0.000005199374,0.9852206,0.002843807,0.006500592,0.005215749,0.00001436908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001869005,0.00008629991,0.9964837,0.00006672418,0.00002710959,0.00003760264,0.00003220124,0.0002051804,0.001192197],"genre_scores_gemma":[0.05854798,0.000160615,0.9389907,0.00009246126,0.00002678247,0.0001435519,0.0001298983,0.00005837758,0.001849631],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005782839,"threshold_uncertainty_score":0.01149839,"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."}}