{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007108152,0.0001414556,0.0001629197,0.0001355229,0.0002709996,0.0001409203,0.001217781,0.00006360418,0.000001881013],"category_scores_gemma":[0.00005377615,0.0001533171,0.00007880062,0.0004585579,0.000103466,0.0002419139,0.00004295997,0.0002310359,0.000009766709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006381183,"about_ca_system_score_gemma":0.00008169629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002066421,"about_ca_topic_score_gemma":0.00009769362,"domain_scores_codex":[0.9985339,0.0004809167,0.0003109029,0.0002701255,0.0001058553,0.0002982962],"domain_scores_gemma":[0.9974216,0.0009619586,0.0001224702,0.001334552,0.00009133186,0.00006815216],"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.000008157671,0.0001845871,0.0002185021,0.00000542166,0.00002457806,0.000002437143,0.0005873723,0.2940129,0.0002027969,0.0134433,0.0007724976,0.6905375],"study_design_scores_gemma":[0.001078305,0.00002125578,0.0002956857,0.00002444552,0.000009607674,0.000001644317,0.00003732611,0.986376,0.00004487799,0.0001278601,0.01181317,0.0001698136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002971848,0.0003260576,0.986065,0.009650448,0.0002879695,0.0004947991,0.000002739602,0.0001366958,0.00006449125],"genre_scores_gemma":[0.6445995,0.00002867221,0.3516724,0.003334229,0.00003824895,0.0002858862,0.00001103058,0.00001075428,0.00001927144],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6923631,"threshold_uncertainty_score":0.625209,"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."}}