{"id":"W2139810283","doi":"10.1109/glocom.2004.1378278","title":"An enhanced algorithm for fair traffic conditioning in differentiated services networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Differentiated services; Quality of service; Computer network; Network packet; Bandwidth (computing); Fairness measure; Packet loss; Service (business); Max-min fairness; Algorithm; Throughput; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00299633,0.000599437,0.000743105,0.0008896857,0.0006287402,0.001061949,0.001512015,0.00106065,0.002322376],"category_scores_gemma":[0.007907209,0.0003130969,0.0004388067,0.0006711672,0.0009559965,0.001488482,0.001385983,0.001581699,0.0006793697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001059059,"about_ca_system_score_gemma":0.001187035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001156249,"about_ca_topic_score_gemma":0.001003636,"domain_scores_codex":[0.998773,0.000326875,0.00007770755,0.0001953208,0.0005138661,0.0001131161],"domain_scores_gemma":[0.9980566,0.0009165421,0.0001051165,0.0003213808,0.0005406706,0.00005981657],"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.0005556786,0.0001626902,0.001105979,0.000117827,0.00005553705,0.0001198391,0.0002433438,0.3676862,0.02945457,0.1165141,0.001986416,0.4819979],"study_design_scores_gemma":[0.00003635688,0.0000586817,0.00009884888,0.000008835766,0.000008854577,0.00004475706,0.000004847233,0.9793862,0.00670108,0.01107129,0.002567816,0.00001254164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003687858,0.00005914068,0.9955025,0.00002877176,0.00003404939,0.00004748024,0.000006822937,0.0001809332,0.0004524029],"genre_scores_gemma":[0.1372154,0.0001155751,0.8604785,0.00009420469,0.00006982376,0.0001401404,0.00005340442,0.00007680892,0.001756074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00299633,"threshold_uncertainty_score":0.01584625,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00541106987680708,"score_gpt":0.2290257653624483,"score_spread":0.2236146954856412,"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."}}