{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002540504,0.001147033,0.001804419,0.0006102691,0.001702171,0.002105209,0.002999505,0.001353044,0.003211052],"category_scores_gemma":[0.00686555,0.0005048121,0.0006456954,0.0009436516,0.001462044,0.002095512,0.001660539,0.001487288,0.0005764093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002733237,"about_ca_system_score_gemma":0.003306067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006430765,"about_ca_topic_score_gemma":0.00630403,"domain_scores_codex":[0.9980127,0.0004102314,0.00008699832,0.000384047,0.0006906231,0.0004154584],"domain_scores_gemma":[0.9957553,0.003017214,0.0002235608,0.0004208555,0.0004075473,0.0001756376],"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.0005134708,0.0001289632,0.0005693045,0.0001857871,0.00005776554,0.000173138,0.000156659,0.8446945,0.006872823,0.08891045,0.003022604,0.05471454],"study_design_scores_gemma":[0.00002391793,0.00002010083,0.00002187078,0.000002677208,0.000006887528,0.00001290604,0.000004615455,0.9896326,0.000630596,0.009192253,0.000446068,0.000005458855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01623015,0.0004033664,0.9790646,0.000254494,0.0001192327,0.00009271611,0.00007023453,0.0008696174,0.002895494],"genre_scores_gemma":[0.7502608,0.000299593,0.244387,0.0001667367,0.0001227611,0.0001860781,0.0001052562,0.0001262248,0.004345496],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006430765,"threshold_uncertainty_score":0.01983106,"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."}}