{"id":"W2143849473","doi":"10.1002/cpe.759","title":"On the scalability of many‐to‐many reliable multicast sessions","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"SAIT Polytechnic","funders":"Fonds National de la Recherche Luxembourg","keywords":"Multicast; Computer science; Reliable multicast; Protocol Independent Multicast; Computer network; Scalability; Session (web analytics); Pragmatic General Multicast; Protocol (science); IP multicast; Distance Vector Multicast Routing Protocol; Tree (set theory); Network packet; Source-specific multicast; Distributed computing; Throughput; Xcast; Wireless; Medicine; World Wide Web; Telecommunications","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.0003155917,0.0001103028,0.0001269705,0.00003803608,0.0003027774,0.0001141663,0.0002345533,0.00003636094,0.000007910856],"category_scores_gemma":[0.0004706194,0.00007962633,0.00002215067,0.0002909176,0.0001524499,0.0005939379,0.0001099773,0.0001424885,0.00001379571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001250199,"about_ca_system_score_gemma":0.00006632386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002273578,"about_ca_topic_score_gemma":0.000001024821,"domain_scores_codex":[0.9989793,0.00008909396,0.0002358459,0.0003374055,0.0002019572,0.0001564524],"domain_scores_gemma":[0.9984373,0.0009282992,0.0001235815,0.0002334784,0.0001667278,0.000110616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004544308,0.0001938169,0.0001258722,0.00001305035,0.00001085364,0.000005087031,0.01243023,0.005194502,0.0001426855,0.696533,0.0002412909,0.2850642],"study_design_scores_gemma":[0.004167811,0.001972855,0.01121878,0.0006953807,0.00008377817,0.0001935551,0.01430738,0.8829436,0.00190889,0.06248296,0.01884912,0.001175881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3461593,0.0002884674,0.6437912,0.008503998,0.0002551133,0.0002267729,0.000001281229,0.00004755657,0.0007262643],"genre_scores_gemma":[0.9920266,0.00007059436,0.006282885,0.001538076,0.00002079373,0.00004001268,5.785661e-7,0.000002912759,0.00001760751],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8777491,"threshold_uncertainty_score":0.3247068,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0203997158021895,"score_gpt":0.3083440784861725,"score_spread":0.2879443626839829,"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."}}