{"id":"W2084093893","doi":"10.1002/dac.657","title":"A hop‐by‐hop delay‐constrained routing algorithm with explicit loop avoidance and backup routing information","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Static routing; Dynamic Source Routing; Link-state routing protocol; Distributed computing; Equal-cost multi-path routing; Routing Information Protocol; Destination-Sequenced Distance Vector routing; Policy-based routing; Geographic routing; Path vector protocol; Routing table; Multipath routing; Backup; Routing protocol; Zone Routing Protocol; Routing (electronic design automation)","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.0009284555,0.0001456364,0.0002260851,0.0001697386,0.0001582738,0.0006488559,0.001300372,0.00006270332,0.000002041488],"category_scores_gemma":[0.00006595751,0.0001250572,0.0000543534,0.0001942505,0.00005811873,0.002284202,0.0001398457,0.0003008914,0.000009775186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001594122,"about_ca_system_score_gemma":0.0001595147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007587262,"about_ca_topic_score_gemma":0.000007590803,"domain_scores_codex":[0.9981317,0.0001467266,0.0008112291,0.0001172876,0.000631043,0.0001620216],"domain_scores_gemma":[0.9970831,0.0002209785,0.001151404,0.0003441385,0.001096726,0.0001036348],"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.0001053438,0.0001420726,0.001077915,0.000009971162,0.0004775981,0.00002933651,0.005305814,0.05644685,0.0002468333,0.1800159,0.0004542293,0.7556882],"study_design_scores_gemma":[0.007753461,0.0003275781,0.0005571506,0.001789184,0.00004632009,0.002910124,0.003118795,0.9672084,0.0001801483,0.0009300204,0.01461527,0.0005635449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02947282,0.001247243,0.9647923,0.003254532,0.0004038919,0.0001577906,0.000006428839,0.00005289858,0.0006121379],"genre_scores_gemma":[0.9710533,0.0002289485,0.02822222,0.0003060903,0.0001285663,0.00001152148,0.000009313732,0.000007081765,0.00003292864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9415805,"threshold_uncertainty_score":0.6256933,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008363068624608528,"score_gpt":0.2290105524311441,"score_spread":0.2206474838065356,"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."}}