{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003862081,0.0005526445,0.0005915896,0.0006072642,0.0005435997,0.0006347398,0.001369203,0.0008415105,0.001714105],"category_scores_gemma":[0.001010509,0.0002450557,0.0003112401,0.0006803682,0.0003480694,0.0007114513,0.0006713748,0.000402104,0.0003383123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000599118,"about_ca_system_score_gemma":0.001129929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002789645,"about_ca_topic_score_gemma":0.002512153,"domain_scores_codex":[0.9996841,0.00007970478,0.00002463978,0.00008312264,0.00008997742,0.00003850936],"domain_scores_gemma":[0.9995922,0.0001460164,0.00005845584,0.00007344904,0.00009967239,0.00003018433],"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.0004060662,0.0002286638,0.001034217,0.0001682745,0.00009405486,0.0001553522,0.0001289712,0.6855944,0.02711233,0.0154907,0.004032375,0.2655545],"study_design_scores_gemma":[0.00003101993,0.00004555461,0.00008875071,0.000005299656,0.000008929012,0.00005314767,0.000008874763,0.9943461,0.0026266,0.00176325,0.001014707,0.000007720174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0352834,0.0002385981,0.9611337,0.000157384,0.00006294461,0.0001431519,0.00006489619,0.0008172424,0.002098775],"genre_scores_gemma":[0.4070158,0.0001320502,0.5891879,0.00009929415,0.00002991365,0.0002043849,0.0002262502,0.00006013352,0.003044319],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002789645,"threshold_uncertainty_score":0.005734265,"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."}}