{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001981839,0.0003414643,0.0003695376,0.0002751124,0.000457902,0.00005305655,0.0005342977,0.000227414,0.00001225717],"category_scores_gemma":[0.0000105253,0.0003233731,0.0001061544,0.0004775446,0.0001536877,0.0004416428,0.000009996555,0.0005061005,0.0000105821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002442871,"about_ca_system_score_gemma":0.00002476601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009174799,"about_ca_topic_score_gemma":0.0003547392,"domain_scores_codex":[0.998398,0.0001012465,0.0005092894,0.0003720585,0.000149581,0.0004698289],"domain_scores_gemma":[0.9971663,0.001360606,0.00008121406,0.001198863,0.00007714807,0.0001158119],"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.00005048999,0.0001127274,0.00002474481,0.00002360068,0.00003979634,4.858596e-7,0.0001383322,0.8810469,0.001579337,0.002294065,0.00001882109,0.1146707],"study_design_scores_gemma":[0.001203949,0.00007415737,0.0000871947,0.0005033978,0.00002842975,0.000004093733,0.00006341687,0.9957278,0.001546372,0.0001683298,0.0001917961,0.0004010869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1138438,0.0002170644,0.8837665,0.0006173548,0.0003084395,0.0005998145,0.00004596115,0.0004521714,0.0001488347],"genre_scores_gemma":[0.9600976,0.004235547,0.03477598,0.00006563401,0.00004947972,0.000590128,0.00001809704,0.0001230209,0.00004454617],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8489906,"threshold_uncertainty_score":0.9999219,"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."}}