{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001564049,0.0001488407,0.0001826352,0.00008329751,0.0001160777,0.0001938493,0.0005326529,0.00008794507,0.00004892013],"category_scores_gemma":[0.000001445337,0.000138212,0.00005438136,0.0002569011,0.00001746725,0.0006755174,0.00002869916,0.0001077244,0.00001378069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003044397,"about_ca_system_score_gemma":0.0000204273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006213031,"about_ca_topic_score_gemma":0.0003865889,"domain_scores_codex":[0.9988075,0.00005255447,0.0002640228,0.0003947452,0.0001186959,0.0003624658],"domain_scores_gemma":[0.9993966,0.00009888809,0.00006789182,0.0002706201,0.00006336236,0.000102658],"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.000004485213,0.00008249193,0.00001401648,0.000002403019,0.000008684583,7.847916e-7,0.0001539184,0.1523344,0.00004471084,0.002234945,0.00008382293,0.8450353],"study_design_scores_gemma":[0.001200044,0.00008071802,0.0007271828,0.00002012909,0.000005174248,0.000001700656,0.00004841879,0.997013,0.0001549937,0.0001077836,0.0004570875,0.0001837657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06114781,0.0001003208,0.937233,0.0004384029,0.0002258188,0.0002813849,0.000001839381,0.0004108957,0.0001605152],"genre_scores_gemma":[0.9419451,0.000009647119,0.05669814,0.0007085472,0.0002742121,0.00009836934,0.0000371623,0.000009586927,0.0002191983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8807973,"threshold_uncertainty_score":0.563612,"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."}}