{"id":"W2520674444","doi":"10.1109/twc.2016.2610430","title":"On Achieving Fair and Throughput-Optimal Scheduling for TCP Flows in Wireless Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Maximum throughput scheduling; Computer network; Round-robin scheduling; Fair-share scheduling; Distributed computing; Dynamic priority scheduling; Transmission Control Protocol; Fair queuing; TCP Friendly Rate Control; Scheduling (production processes); Mathematical optimization; Network packet; Mathematics","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.007345322,0.001449983,0.001103146,0.001602724,0.002143905,0.001835638,0.001441739,0.0008724121,0.00117312],"category_scores_gemma":[0.02121551,0.0004645251,0.0005145943,0.001955496,0.0030114,0.002814101,0.001518908,0.001206005,0.0002640784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002717871,"about_ca_system_score_gemma":0.004734522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005399179,"about_ca_topic_score_gemma":0.003685994,"domain_scores_codex":[0.9977409,0.0008041985,0.0001111687,0.0002563873,0.0006883373,0.0003990929],"domain_scores_gemma":[0.9882609,0.008919358,0.001015787,0.0006045529,0.0009633044,0.0002360161],"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.0001609876,0.00009256777,0.00067865,0.0001491759,0.00003107989,0.00006394694,0.0001480435,0.8899823,0.004308553,0.067682,0.001100155,0.0356025],"study_design_scores_gemma":[0.000014126,0.00006644119,0.0001135347,0.00001539243,0.00001016755,0.00002797816,0.00002950492,0.9744528,0.001491702,0.02328033,0.0004871282,0.00001095289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02487802,0.00096048,0.970084,0.0002335153,0.0001061751,0.0001257814,0.0000389782,0.0002092096,0.003363793],"genre_scores_gemma":[0.8411532,0.001939976,0.1548346,0.0001884966,0.0002639034,0.0002091416,0.00006073014,0.0001290696,0.001220898],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007345322,"threshold_uncertainty_score":0.03884619,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01752520758220098,"score_gpt":0.2522490271077955,"score_spread":0.2347238195255945,"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."}}