{"id":"W2123788218","doi":"10.1109/cnsr.2011.43","title":"Dynamic Resource Allocation Based on Weighted Max-Min Fairness","year":2011,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Max-min fairness; Bandwidth allocation; Bandwidth (computing); Scheduling (production processes); Dynamic bandwidth allocation; Resource allocation; Fairness measure; Computer network; Distributed computing; Shared resource; Resource management (computing); Mathematical optimization; 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.0001924128,0.0001173037,0.0001006443,0.00008760406,0.00008052016,0.00004953682,0.0005693422,0.00006027807,0.00016949],"category_scores_gemma":[0.000007746869,0.00009825046,0.00004474636,0.000271085,0.00002639738,0.0001434034,0.00003748033,0.00009207048,0.0002635261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003199385,"about_ca_system_score_gemma":0.00004558565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001409087,"about_ca_topic_score_gemma":0.00002238981,"domain_scores_codex":[0.9990255,0.00007484576,0.0001558942,0.0003302851,0.0002074267,0.0002060714],"domain_scores_gemma":[0.9992036,0.00007459601,0.00005212113,0.0005304381,0.00005501643,0.00008423453],"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.00005044284,0.0001824773,0.0001317719,0.000004820293,0.00001190076,0.00001420712,0.0002542682,0.001021751,0.00005223943,0.2342228,0.00222017,0.7618331],"study_design_scores_gemma":[0.0004217539,0.00009101025,0.001700828,0.00001298999,0.000004444964,0.00000182448,0.00001448353,0.9916668,0.0001590562,0.0008417619,0.004943165,0.0001418853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003693604,0.00001730087,0.944876,0.00160115,0.0001861184,0.0001411475,3.752935e-7,0.0004289482,0.04905532],"genre_scores_gemma":[0.9722369,0.000001102287,0.02331427,0.00162638,0.00002246835,0.000024328,0.000004329787,0.000007731473,0.002762497],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9906451,"threshold_uncertainty_score":0.4006537,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01169135926847639,"score_gpt":0.19913088666929,"score_spread":0.1874395274008136,"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."}}