{"id":"W2102937523","doi":"10.1145/2674005.2675010","title":"On the Fairness-Efficiency Tradeoff for Packet Processing with Multiple Resources","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Fairness measure; Fair queuing; Network packet; Scheduling (production processes); Distributed computing; Maximum throughput scheduling; Quality of service; Computer network; Bandwidth (computing); Queueing theory; Round-robin scheduling; Dynamic priority scheduling; Throughput; Mathematical optimization; Wireless; Operating system","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.009854983,0.001150576,0.001253213,0.001327602,0.001478608,0.002808893,0.001927316,0.001456197,0.001357095],"category_scores_gemma":[0.02287111,0.0005521944,0.000459961,0.00131266,0.00263161,0.005460344,0.001503387,0.002084058,0.0003476774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003309648,"about_ca_system_score_gemma":0.002539421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002298787,"about_ca_topic_score_gemma":0.001906968,"domain_scores_codex":[0.9951354,0.001994863,0.000238538,0.0005712128,0.001456234,0.000603835],"domain_scores_gemma":[0.9833248,0.01316237,0.0007047185,0.001202301,0.001210355,0.0003954994],"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.000751811,0.0001938387,0.001805573,0.0001713658,0.00009020419,0.0001592483,0.000281567,0.5899235,0.01399515,0.3136867,0.001895857,0.07704524],"study_design_scores_gemma":[0.00005199922,0.0001135922,0.0003529458,0.00002615613,0.00002506086,0.00007153726,0.00002887763,0.9141393,0.003738301,0.07959002,0.001835592,0.00002670566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05224166,0.002050505,0.934633,0.001624275,0.0001798692,0.0001164814,0.00003558967,0.0002306612,0.008888022],"genre_scores_gemma":[0.8253372,0.001331041,0.1695204,0.0004494842,0.0004338332,0.0001131018,0.00003363944,0.0001696115,0.002611736],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009854983,"threshold_uncertainty_score":0.05211878,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01037794045905474,"score_gpt":0.1997776407942523,"score_spread":0.1893997003351975,"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."}}