{"id":"W2133822874","doi":"10.1109/vetecs.2011.5956739","title":"On the Delay-Fairness through Scheduling for Wireless OFDMA Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Queuing delay; Proportionally fair; Computer science; Scheduling (production processes); Fairness measure; Weighted fair queueing; Fair queuing; Max-min fairness; Quality of service; Generalized processor sharing; Queueing theory; Network packet; Maximum throughput scheduling; Network delay; Asymptotically optimal algorithm; Computer network; Wireless network; Wireless; Mathematical optimization; Round-robin scheduling; Resource allocation; Dynamic priority scheduling; Mathematics; Algorithm; 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.003323318,0.0007605706,0.000636287,0.0005658824,0.0006983455,0.001009654,0.0008797864,0.0006303811,0.001095306],"category_scores_gemma":[0.007488569,0.0002131231,0.0004418251,0.0009158602,0.001872883,0.001748765,0.0009448931,0.001226641,0.0001658717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001803802,"about_ca_system_score_gemma":0.001302098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003243154,"about_ca_topic_score_gemma":0.001586886,"domain_scores_codex":[0.9989004,0.0004819169,0.00003824503,0.0001305143,0.0003352558,0.0001137102],"domain_scores_gemma":[0.9973635,0.002027915,0.0001566226,0.0001142688,0.0002620168,0.00007568352],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001386761,0.00005500525,0.0006840649,0.0001490567,0.00004581442,0.0001354549,0.0001868359,0.4456647,0.003967532,0.5062111,0.001281458,0.04148036],"study_design_scores_gemma":[0.00001251073,0.00007335749,0.0002339252,0.00002582749,0.00001930729,0.0000648574,0.00002289127,0.862742,0.001229527,0.1321661,0.003395086,0.00001455347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01494556,0.002355625,0.9761068,0.0005130104,0.0001564662,0.00003954719,0.00002132575,0.00004241767,0.00581927],"genre_scores_gemma":[0.851904,0.00529164,0.1357201,0.0003946082,0.0006918291,0.0001283441,0.00003506819,0.0001037791,0.005730659],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003323318,"threshold_uncertainty_score":0.01757556,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02716930953345961,"score_gpt":0.2168284805862294,"score_spread":0.1896591710527698,"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."}}