{"id":"W2074286471","doi":"10.1109/broadnets.2007.4550404","title":"Weight functions for shortest path routing of periodically scheduled burst flows","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Equal-cost multi-path routing; Private Network-to-Network Interface; Shortest path problem; Routing (electronic design automation); Computer science; Computer network; Path (computing); K shortest path routing; Link-state routing protocol; 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.002027999,0.000929183,0.0005108248,0.001318994,0.000468106,0.001097992,0.001111124,0.0006463102,0.0007339068],"category_scores_gemma":[0.008244141,0.0003685187,0.0003812317,0.0008776585,0.0005274179,0.001716713,0.0005384591,0.0008023993,0.0002153092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009763982,"about_ca_system_score_gemma":0.0009282943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002351946,"about_ca_topic_score_gemma":0.001574857,"domain_scores_codex":[0.9992723,0.0001911253,0.00003554675,0.00006128319,0.0003535154,0.00008630438],"domain_scores_gemma":[0.9974359,0.001303916,0.0003286123,0.0002158309,0.0006383482,0.00007730921],"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.0002029285,0.00009176243,0.001442825,0.00009395329,0.00004925484,0.0000522009,0.00008376518,0.7941658,0.0100988,0.03079266,0.0008406996,0.1620854],"study_design_scores_gemma":[0.00001050052,0.00003723962,0.0002248689,0.000006144887,0.00000902095,0.00001846826,0.000006900111,0.989709,0.001772479,0.007816343,0.0003779954,0.00001107204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0702062,0.0004064878,0.9280968,0.0001296138,0.00005001266,0.00004100247,0.0000303558,0.0002605815,0.000778943],"genre_scores_gemma":[0.7578933,0.0006228824,0.2394299,0.00005227161,0.00006442628,0.0001580091,0.0001512252,0.0001351789,0.001492869],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002351946,"threshold_uncertainty_score":0.01072526,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009313014235434708,"score_gpt":0.2240239606014859,"score_spread":0.2147109463660512,"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."}}