{"id":"W2135943273","doi":"10.1109/icc.2004.1312870","title":"The complexity of computing virtual-time in weighted fair queuing schedulers","year":2004,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Weighted fair queueing; Computer science; Iterated function; Queueing theory; Network packet; Time complexity; Scheduling (production processes); Algorithm; Mathematical optimization; Mathematics; Computer network","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.0004681251,0.0001020081,0.000165619,0.00005487607,0.0001572374,0.00007256304,0.0006894206,0.00003931239,0.000009834955],"category_scores_gemma":[0.00002239636,0.00007250388,0.00005388153,0.000426784,0.00021308,0.0001634779,0.0001479285,0.0001420566,0.00004136773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004673886,"about_ca_system_score_gemma":0.00009009131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007717743,"about_ca_topic_score_gemma":0.0001112971,"domain_scores_codex":[0.9989175,0.00007985919,0.0003089145,0.0002227833,0.0002038065,0.0002671175],"domain_scores_gemma":[0.9992815,0.0001836619,0.00009620396,0.0003207064,0.00006475218,0.00005313674],"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.000006549903,0.00004041591,0.0001117337,0.000001673532,0.00001148399,0.000003400775,0.0003155033,0.01324236,0.0001706795,0.8596489,0.00006982834,0.1263775],"study_design_scores_gemma":[0.0009883427,0.00005712126,0.002181883,0.000047113,0.00000222735,0.000004652756,0.0001120645,0.9825384,0.0003836637,0.01332627,0.0002257217,0.000132556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1709985,0.00008312737,0.8194631,0.005436845,0.0002574346,0.0001718662,3.397763e-7,0.0002028233,0.003385936],"genre_scores_gemma":[0.9755332,0.000004559934,0.02408246,0.0002107444,0.00003457508,0.000002085238,5.302218e-7,0.000004208328,0.0001276744],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.969296,"threshold_uncertainty_score":0.2956623,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01525419522132846,"score_gpt":0.2244356486092906,"score_spread":0.2091814533879621,"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."}}