{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000375127,0.0002357415,0.0002291283,0.0000990819,0.000465466,0.0002134099,0.0005491894,0.0001277635,0.00002623481],"category_scores_gemma":[0.000006547084,0.0002414056,0.00007518913,0.0007152979,0.00003991565,0.0003263507,0.000008124863,0.0003756019,0.00004186707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004647283,"about_ca_system_score_gemma":0.00007337859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001804589,"about_ca_topic_score_gemma":0.0001339163,"domain_scores_codex":[0.9983053,0.0001753988,0.0002650124,0.0005448545,0.0002602327,0.0004492336],"domain_scores_gemma":[0.998639,0.000295177,0.00007765984,0.0007277308,0.00008391392,0.0001765467],"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.00001850973,0.0001017328,0.0001478298,0.00001670431,0.00004952776,0.00001806331,0.0003747496,0.02570246,0.00005918173,0.007032047,0.0001388092,0.9663404],"study_design_scores_gemma":[0.004186928,0.0003352147,0.001314542,0.0004122684,0.0001783671,0.0003584476,0.0002286896,0.7753425,0.00119473,0.01576429,0.1987786,0.001905394],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01043478,0.0004365726,0.9835333,0.001291821,0.002474558,0.000230625,0.000001522363,0.0003624087,0.001234472],"genre_scores_gemma":[0.9857188,0.0001344662,0.01238621,0.001147228,0.0002249074,0.0000421905,5.575026e-7,0.00001896617,0.0003267154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.975284,"threshold_uncertainty_score":0.9844236,"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."}}