{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004107217,0.0009436337,0.001166382,0.0008535209,0.001137453,0.001619171,0.002899421,0.0007150007,0.002529232],"category_scores_gemma":[0.006507129,0.0004726036,0.0005682928,0.001115924,0.001460179,0.003043742,0.001519636,0.001305913,0.0004759755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001668573,"about_ca_system_score_gemma":0.001656219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001595756,"about_ca_topic_score_gemma":0.001744305,"domain_scores_codex":[0.9965585,0.001273123,0.00016825,0.0006051731,0.001008655,0.0003863114],"domain_scores_gemma":[0.9970988,0.001631831,0.0002485221,0.0005364213,0.0003633969,0.0001210232],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006014878,0.0002255749,0.0009532138,0.0001877804,0.0001461912,0.0001620436,0.0003544601,0.5602419,0.0105138,0.2380607,0.003095888,0.185457],"study_design_scores_gemma":[0.00005367251,0.0001098891,0.000182819,0.00001868483,0.00002992018,0.0001259181,0.00002507197,0.9054773,0.004663107,0.08244698,0.006828251,0.00003832539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00798354,0.0002327006,0.9877976,0.0001007509,0.00007531863,0.00006348269,0.00002152437,0.0002357015,0.0034895],"genre_scores_gemma":[0.6698855,0.0003816784,0.3243322,0.0002588361,0.0001954176,0.0002674685,0.00007326618,0.0001586882,0.004446952],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004107217,"threshold_uncertainty_score":0.0217213,"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."}}