{"id":"W2021482093","doi":"10.1002/dac.859","title":"A scalable multicast routing protocol for building shortest path trees","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Multicast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Computer network; Distributed computing; Xcast; Pragmatic General Multicast; Source-specific multicast; IP multicast; Open Shortest Path First; Scalability; Routing protocol; Routing (electronic design automation); Link-state routing protocol; Database","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.0009301797,0.0004396878,0.0004608567,0.0008434794,0.0007302121,0.0005958081,0.0008920208,0.0005405816,0.001800425],"category_scores_gemma":[0.002023691,0.0002230277,0.0004380925,0.0008497593,0.0004123527,0.001064196,0.001372888,0.0006337016,0.0004630203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004303622,"about_ca_system_score_gemma":0.0006711966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000541319,"about_ca_topic_score_gemma":0.0006822554,"domain_scores_codex":[0.9992703,0.0001925659,0.00004780123,0.0000564699,0.0003777525,0.00005523938],"domain_scores_gemma":[0.9994313,0.0001823645,0.00008023061,0.00009615194,0.0001615162,0.00004846013],"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.0003134366,0.0001456234,0.0008444816,0.000650932,0.0001519143,0.001374518,0.0005054441,0.2517158,0.08830074,0.2476709,0.02900332,0.3793229],"study_design_scores_gemma":[0.0001489447,0.0002499782,0.0004074262,0.00007759279,0.00008401872,0.0006522491,0.00009446073,0.8153338,0.01764614,0.1094729,0.05577628,0.00005633686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01829991,0.0008419907,0.9721168,0.0004495094,0.0001826554,0.0003239854,0.0001919978,0.00166575,0.0059274],"genre_scores_gemma":[0.377146,0.000982412,0.6160899,0.0001773825,0.0001916189,0.0007355161,0.0009201294,0.0001570024,0.003600101],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001800425,"threshold_uncertainty_score":0.00602299,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02560027646901103,"score_gpt":0.3168552367566697,"score_spread":0.2912549602876586,"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."}}