{"id":"W2108305519","doi":"10.1109/ccece.2004.1345097","title":"A dynamic k-routing algorithm in wavelength-routed optical networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Communications Research Centre Canada; University of Ottawa","funders":"","keywords":"Static routing; Equal-cost multi-path routing; Link-state routing protocol; Computer science; Dynamic Source Routing; Path vector protocol; Multipath routing; Computer network; Destination-Sequenced Distance Vector routing; Private Network-to-Network Interface; Policy-based routing; Geographic routing; Distributed computing; Algorithm; K shortest path routing; Routing (electronic design automation); Shortest path problem; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005450639,0.000503963,0.000559633,0.0006669896,0.001016973,0.0009756056,0.001459923,0.000785154,0.001788585],"category_scores_gemma":[0.001531311,0.0003442283,0.0004040599,0.001036299,0.0007307645,0.001704407,0.0007014507,0.000782998,0.0006520396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009560962,"about_ca_system_score_gemma":0.001279345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004139889,"about_ca_topic_score_gemma":0.004727243,"domain_scores_codex":[0.9995096,0.0001115114,0.00003914169,0.0001448926,0.0001389987,0.00005581228],"domain_scores_gemma":[0.9995556,0.0001433259,0.00007139611,0.0001030913,0.0001037315,0.000022777],"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.0003384806,0.0001194421,0.001376559,0.0001714727,0.00009893162,0.0001417584,0.0001615362,0.4499793,0.0162829,0.04693732,0.00535822,0.479034],"study_design_scores_gemma":[0.00004803455,0.0001058602,0.0003266353,0.00002351955,0.00002826505,0.0002863468,0.00004173426,0.958011,0.006111441,0.02419107,0.01077666,0.0000494824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01950776,0.0006257309,0.9745893,0.0002123716,0.00008427733,0.00007257563,0.00006371641,0.001080957,0.003763347],"genre_scores_gemma":[0.2784721,0.000567074,0.7164295,0.000154775,0.00003984618,0.0001146081,0.0002414801,0.0001916139,0.003788981],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004139889,"threshold_uncertainty_score":0.00823158,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005391140991644569,"score_gpt":0.214132465669636,"score_spread":0.2087413246779914,"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."}}