{"id":"W2027993342","doi":"10.1109/icdcsw.2013.69","title":"On Fairness-Efficiency Tradeoffs for Multi-resource Packet Processing","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Weighted fair queueing; Computer science; Generalized processor sharing; Network packet; Queueing theory; Fairness measure; Fair queuing; Computer network; Distributed computing; Scheduling (production processes); Bandwidth (computing); Schedule; Round-robin scheduling; Mathematical optimization; Throughput; Dynamic priority scheduling; Quality of service; Telecommunications; 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.01777334,0.001503157,0.001637096,0.002036492,0.002117958,0.004331644,0.00284516,0.002615306,0.00300401],"category_scores_gemma":[0.05225546,0.000822703,0.0008000965,0.001891037,0.005473911,0.01291041,0.002493946,0.004175568,0.0005181343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005452656,"about_ca_system_score_gemma":0.002144345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002189486,"about_ca_topic_score_gemma":0.001526405,"domain_scores_codex":[0.992376,0.003515789,0.0002954282,0.0008408669,0.002035364,0.0009365858],"domain_scores_gemma":[0.9470696,0.04454036,0.001865967,0.002673776,0.002780876,0.00106943],"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.0005359265,0.0002305268,0.001556045,0.0002306172,0.00007169311,0.0001535168,0.0003890868,0.2477584,0.004901024,0.7008714,0.002537841,0.04076395],"study_design_scores_gemma":[0.00006034069,0.0001400104,0.0005557215,0.00007168594,0.00002866463,0.00008722676,0.00008343032,0.502985,0.001975246,0.4914934,0.002476923,0.00004227076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07009595,0.008167357,0.8779921,0.009097045,0.000478231,0.000195266,0.0001215595,0.0001939284,0.03365857],"genre_scores_gemma":[0.903431,0.003474513,0.08676237,0.001023016,0.001245662,0.0001730743,0.00005624078,0.0001810298,0.003653102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01777334,"threshold_uncertainty_score":0.09399557,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02548469638332735,"score_gpt":0.2516465563336333,"score_spread":0.226161859950306,"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."}}