{"id":"W2067209328","doi":"10.1109/icnp.2013.6733610","title":"Multi-Resource Round Robin: A low complexity packet scheduler with Dominant Resource Fairness","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Fair queuing; Weighted fair queueing; Network packet; Computer network; Queueing theory; Schedule; Layered queueing network; Weighted round robin; Bandwidth (computing); Network scheduler; Resource (disambiguation); Generalized processor sharing; Distributed computing; Round-robin scheduling; Processing delay; Transmission delay; Quality of service; Operating system; Dynamic priority scheduling","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.0002954733,0.0003141457,0.0003407387,0.00008227241,0.0002836808,0.0005435966,0.001120776,0.0001045555,0.0002515896],"category_scores_gemma":[0.00001744529,0.0002193301,0.00008677659,0.0004260948,0.0002364508,0.0006234077,0.0002657021,0.0002707144,0.0005941908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005421933,"about_ca_system_score_gemma":0.0000809807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001806693,"about_ca_topic_score_gemma":0.0001468385,"domain_scores_codex":[0.9977875,0.0001649853,0.0003148763,0.0006960427,0.0004108846,0.0006257154],"domain_scores_gemma":[0.9982671,0.0001622149,0.0001309333,0.0009644467,0.0001768622,0.0002984653],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002514738,0.001632262,0.003308738,0.000110015,0.0002708884,0.0001507562,0.002183891,0.01411181,0.001111479,0.2586527,0.07209433,0.6461216],"study_design_scores_gemma":[0.003411727,0.0002030641,0.007462444,0.00009087771,0.00001909581,0.00007755803,0.0003119237,0.9569779,0.0002876602,0.0004683062,0.02998558,0.0007038605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06279632,0.00009530249,0.927622,0.004504599,0.0001080058,0.0006284561,0.000001552276,0.0004556926,0.003788103],"genre_scores_gemma":[0.9153394,0.000001741374,0.07689153,0.001786674,0.0001251869,0.0001099382,0.000005533796,0.00002267922,0.005717289],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9428661,"threshold_uncertainty_score":0.894402,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01922403941702558,"score_gpt":0.2180026246080903,"score_spread":0.1987785851910648,"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."}}