{"id":"W2159728727","doi":"10.1109/icccn.2009.5235392","title":"On Maximizing IP Multicast Throughput in Multi-Source Applications","year":2009,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Multicast; Computer science; Computer network; Xcast; Protocol Independent Multicast; Source-specific multicast; Distributed computing; Throughput; Pragmatic General Multicast; Steiner tree problem; Greedy algorithm; Distance Vector Multicast Routing Protocol; Heuristic; Linear network coding; Tree (set theory); Algorithm; Mathematical optimization; Network packet; Mathematics; Wireless","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.002312318,0.000962871,0.0008913624,0.001269851,0.0007260757,0.0009442637,0.0009836096,0.0008046658,0.0007712495],"category_scores_gemma":[0.00776429,0.0003486943,0.0003281995,0.001780028,0.0008826787,0.001935823,0.001101715,0.0005479478,0.0002424697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001019936,"about_ca_system_score_gemma":0.0005259795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001088517,"about_ca_topic_score_gemma":0.000805796,"domain_scores_codex":[0.9988927,0.0006061384,0.00003095529,0.00006609295,0.0002564046,0.0001477845],"domain_scores_gemma":[0.9967253,0.002564536,0.0001568657,0.0001832921,0.0002970242,0.00007291015],"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.0001687843,0.00007185772,0.0007150712,0.0001072779,0.00002414977,0.0001364713,0.0001055101,0.9301867,0.005194496,0.02300237,0.001028275,0.03925902],"study_design_scores_gemma":[0.000005223736,0.00003593148,0.00009634185,0.000005203549,0.000005570999,0.00003055975,0.000016886,0.9902759,0.001566546,0.007677352,0.0002813488,0.000003203002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1176332,0.001820442,0.8714598,0.0004487176,0.00004961413,0.0000840107,0.00005030138,0.0003732533,0.008080761],"genre_scores_gemma":[0.9060046,0.001525144,0.09097641,0.00006491269,0.0001136258,0.00009981172,0.00004561563,0.0000824843,0.001087383],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002312318,"threshold_uncertainty_score":0.01222885,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07323540381293712,"score_gpt":0.3274695351966958,"score_spread":0.2542341313837587,"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."}}