{"id":"W2059092774","doi":"10.1109/infocom.2014.6848131","title":"Low complexity multi-resource fair queueing with bounded delay","year":2014,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Fair queuing; Weighted fair queueing; Computer science; Proportionally fair; Queueing theory; Network packet; Bounded function; Scheduling (production processes); Computer network; Layered queueing network; Generalized processor sharing; Distributed computing; Quality of service; Round-robin scheduling; Mathematical optimization; Dynamic priority scheduling; 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":[],"consensus_categories":[],"category_scores_codex":[0.0002558161,0.0001479786,0.0001666555,0.00004054977,0.0002033339,0.0002138938,0.0006282355,0.00004573767,0.00004349701],"category_scores_gemma":[0.00001353563,0.0001097871,0.00004315792,0.0001987003,0.00009936542,0.0002374888,0.0001026996,0.0001329508,0.0001062191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002227192,"about_ca_system_score_gemma":0.00004069395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005125022,"about_ca_topic_score_gemma":0.00037105,"domain_scores_codex":[0.9988306,0.0001013934,0.0001578943,0.000370617,0.0002235973,0.0003159089],"domain_scores_gemma":[0.9991192,0.0001224458,0.00006172195,0.0004882956,0.00006707985,0.0001413198],"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.00002457413,0.0001320137,0.0007549867,0.00001065046,0.00002762417,0.00001284883,0.0002626338,0.004759594,0.00003759612,0.5395752,0.002283434,0.4521188],"study_design_scores_gemma":[0.001040745,0.0000954726,0.001152563,0.00001951885,0.000005088396,0.00001941733,0.00001726766,0.9780002,0.00008577656,0.0005591961,0.01879037,0.0002143691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0113458,0.00001825723,0.9760887,0.001332757,0.00009549681,0.0001253302,2.570719e-7,0.0005564934,0.01043692],"genre_scores_gemma":[0.88493,5.387533e-7,0.1115173,0.001760776,0.0000876319,0.00001013235,0.000001305866,0.0000084276,0.001683868],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9732406,"threshold_uncertainty_score":0.4476988,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0160865811016981,"score_gpt":0.2149682540479124,"score_spread":0.1988816729462143,"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."}}