{"id":"W2152683668","doi":"10.1109/lcomm.2002.808378","title":"A rate adaptation algorithm for multicast sources in priority-based IP networks","year":2003,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Multicast; Computer science; Computer network; Xcast; IP multicast; Quality of service; Source-specific multicast; Distributed computing; Protocol Independent Multicast; Pragmatic General Multicast; Multicast address; Adaptation (eye); Distance Vector Multicast Routing Protocol; Inter-domain; Algorithm","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.001925814,0.0006791147,0.0006755292,0.0008055722,0.0006243132,0.0008972184,0.001611173,0.0007971711,0.001054777],"category_scores_gemma":[0.005233792,0.0003422642,0.0003009111,0.0005164662,0.0004797433,0.001857665,0.0007371226,0.001591378,0.000589434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000618806,"about_ca_system_score_gemma":0.0005629725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001091043,"about_ca_topic_score_gemma":0.0008322456,"domain_scores_codex":[0.9992823,0.0001656532,0.00005511875,0.0001210852,0.0003138857,0.0000619654],"domain_scores_gemma":[0.998562,0.0006611232,0.0001396324,0.0001675682,0.0004083341,0.00006136714],"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.0004209822,0.000201122,0.001160991,0.0001477575,0.00008257398,0.0001605884,0.0003599656,0.1400118,0.04965958,0.03940438,0.004371187,0.7640191],"study_design_scores_gemma":[0.0000787746,0.0001273945,0.000229169,0.00002003224,0.00003506473,0.0002293715,0.00002146778,0.9704739,0.01330802,0.009044914,0.006391785,0.00004010863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004353493,0.0002578876,0.9940559,0.00006692819,0.00006177484,0.00005215958,0.000007891585,0.0005304715,0.0006133841],"genre_scores_gemma":[0.1953259,0.0005186557,0.8007685,0.000143571,0.0002242993,0.0001919358,0.00007429283,0.0001716417,0.002581324],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001925814,"threshold_uncertainty_score":0.01018476,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02857592500813283,"score_gpt":0.2583156522136632,"score_spread":0.2297397272055304,"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."}}