{"id":"W2013174072","doi":"10.1109/tnet.2003.818196","title":"Priority service and max-min fairness","year":2003,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Game theory; Computer network; Nash equilibrium; Bandwidth allocation; Bandwidth (computing); Max-min fairness; Service (business); Quality of service; Mathematical optimization; Resource allocation; Microeconomics","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.004020841,0.001232271,0.001131628,0.0006564335,0.001644144,0.003685366,0.002239025,0.001699678,0.005235863],"category_scores_gemma":[0.01070283,0.0006449159,0.0006695578,0.001163983,0.002690333,0.005683972,0.001692371,0.002111936,0.0006631764],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002999391,"about_ca_system_score_gemma":0.003100472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003887518,"about_ca_topic_score_gemma":0.001864918,"domain_scores_codex":[0.9963315,0.001313969,0.00009708948,0.0005057552,0.0009706675,0.0007810251],"domain_scores_gemma":[0.9952531,0.00305012,0.0005179893,0.0002703518,0.0005261974,0.0003822751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002223474,0.00007413534,0.0004311509,0.00009630751,0.00003144955,0.0001677273,0.0002676816,0.08751976,0.001373281,0.897642,0.002044631,0.01012958],"study_design_scores_gemma":[0.00007585231,0.00009644776,0.0002233533,0.00002684707,0.00003330502,0.0002037904,0.0001027096,0.4418154,0.0008042018,0.5487029,0.007890996,0.0000241887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07331382,0.00210954,0.8706701,0.002664037,0.0004665939,0.000110591,0.0001409444,0.0002279578,0.05029632],"genre_scores_gemma":[0.9340519,0.001289134,0.04866744,0.0004182617,0.0007947644,0.0001323424,0.00006413138,0.00009066324,0.01449139],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005235863,"threshold_uncertainty_score":0.02176225,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0188926864910351,"score_gpt":0.2288178971658632,"score_spread":0.2099252106748281,"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."}}