{"id":"W1989781991","doi":"10.1109/lcomm.2002.804251","title":"On the deployment of RED on shared-memory buffers","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Queueing theory; Random early detection; Software deployment; Queue; Computer network; Shared resource; Scheme (mathematics); Resource allocation; Distributed computing; Shared memory; Mathematical optimization; Parallel computing; Network congestion; Mathematics; Active queue management; Operating system","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.002139369,0.0006294576,0.0006655916,0.0005211741,0.0006695447,0.00097097,0.001828389,0.0004454449,0.0004901124],"category_scores_gemma":[0.005919672,0.0003680387,0.000211424,0.0003176505,0.000751359,0.001834195,0.001409636,0.0006330925,0.0001572012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009031215,"about_ca_system_score_gemma":0.0007352518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001363416,"about_ca_topic_score_gemma":0.001879279,"domain_scores_codex":[0.9988708,0.0004733752,0.00004803057,0.0001660551,0.0001942392,0.0002475095],"domain_scores_gemma":[0.9965958,0.001653878,0.0004074341,0.000584799,0.0005485663,0.0002096595],"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.003682644,0.000408082,0.009760652,0.0002860286,0.0001759437,0.0006616347,0.0009985346,0.4564579,0.1122135,0.09489564,0.002684322,0.3177752],"study_design_scores_gemma":[0.0000734732,0.0003205232,0.0007530023,0.00003194726,0.00005659314,0.0001504176,0.00008486219,0.9522506,0.03954043,0.005173066,0.001532489,0.00003265996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4351961,0.0007941605,0.5596259,0.0004315439,0.0000872368,0.00009123621,0.00002470597,0.0009227594,0.002826328],"genre_scores_gemma":[0.9602028,0.0001311678,0.0389633,0.00007511129,0.00002756321,0.00001706644,0.000007847247,0.00001924079,0.000555963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002139369,"threshold_uncertainty_score":0.01131421,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04059595175612478,"score_gpt":0.2372200554806761,"score_spread":0.1966241037245514,"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."}}