{"id":"W2089609964","doi":"10.1109/twc.2012.030812.110493","title":"Distributed Scheduling in Multihop Wireless Networks with Maxmin Fairness Provisioning","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Maximum throughput scheduling; Fairness measure; Multipath routing; Provisioning; Scheduling (production processes); Distributed computing; Max-min fairness; Proportionally fair; Network packet; Fair queuing; Wireless network; Wireless; Dynamic Source Routing; Routing protocol; Dynamic priority scheduling; Throughput; Round-robin scheduling; Resource allocation; Quality of service; Mathematical optimization; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006346815,0.0003234172,0.0003392598,0.0003219958,0.001112547,0.0002156132,0.002729908,0.0001465038,0.00001660148],"category_scores_gemma":[0.000009757707,0.0003075644,0.00009550233,0.001968996,0.0002244803,0.001187291,0.00007457818,0.001090044,0.00003150859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002391663,"about_ca_system_score_gemma":0.0001106173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004817813,"about_ca_topic_score_gemma":0.0006834342,"domain_scores_codex":[0.9975603,0.0005813617,0.0005410984,0.0003899351,0.0002971426,0.0006301494],"domain_scores_gemma":[0.9953814,0.0006895987,0.0001844,0.003295643,0.0002201749,0.0002287977],"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.0000827535,0.003092159,0.003633241,0.0000318372,0.0001344677,0.000004851408,0.005256663,0.4410113,0.001398657,0.04495559,0.00005181266,0.5003466],"study_design_scores_gemma":[0.0009050036,0.00006001552,0.00239691,0.0003246429,0.00001907427,0.00001803243,0.0003084676,0.9931498,0.001556822,0.00002283106,0.0007545113,0.0004839488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04750121,0.0005762273,0.9489982,0.001574292,0.0002173683,0.0004905765,0.000009904231,0.0003386249,0.0002935792],"genre_scores_gemma":[0.9631715,0.00150303,0.03460433,0.0001836784,0.00002699462,0.0003851942,0.00002951114,0.00003632172,0.00005948372],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9156702,"threshold_uncertainty_score":0.9999377,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03719978931620121,"score_gpt":0.2828541261601898,"score_spread":0.2456543368439886,"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."}}