{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008436399,0.0002014399,0.0002267748,0.00009607329,0.00002990491,0.0000229288,0.000201358,0.0002323593,0.00001617464],"category_scores_gemma":[0.0000576201,0.0001940157,0.00004386677,0.0005001499,0.00007756954,0.0001325699,0.00008647767,0.0005473201,0.0000397603],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002768838,"about_ca_system_score_gemma":0.000007788333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006111118,"about_ca_topic_score_gemma":0.00006066397,"domain_scores_codex":[0.9987537,0.000004949347,0.0002951838,0.0002280178,0.0001100045,0.0006082073],"domain_scores_gemma":[0.9995735,0.00008217158,0.00001240929,0.0002490226,0.00001529833,0.0000676189],"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.000001673664,0.00001698563,0.00002434123,0.000004059096,0.000009116201,0.00004579237,0.0000164395,0.7532787,0.00006020288,0.009734305,0.000007077843,0.2368014],"study_design_scores_gemma":[0.0004900837,0.00002338363,0.0006363613,0.00004417975,0.000003887604,0.00001410845,0.0001062761,0.9934065,0.0001322725,0.004823899,0.00006522674,0.0002537984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04948613,0.000204016,0.9430906,0.0001431774,0.0001904473,0.0001588588,8.327241e-7,0.002315281,0.004410666],"genre_scores_gemma":[0.5956262,0.0001109342,0.4041476,0.00002733713,0.00002097127,0.00001394484,0.000003574154,0.00003036786,0.00001908743],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.54614,"threshold_uncertainty_score":0.7911729,"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."}}