{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004452218,0.0008983801,0.001605788,0.001019025,0.001804684,0.004829632,0.002816634,0.001242326,0.004027436],"category_scores_gemma":[0.02145776,0.0008758632,0.001038289,0.001494034,0.002220787,0.01001809,0.002753926,0.001761697,0.0004512672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004366333,"about_ca_system_score_gemma":0.003975629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01150782,"about_ca_topic_score_gemma":0.008699751,"domain_scores_codex":[0.996008,0.0009932849,0.000283897,0.0006741059,0.001002013,0.001038633],"domain_scores_gemma":[0.9823785,0.01358405,0.001112768,0.001524732,0.0008561624,0.0005437502],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008572775,0.0001139718,0.002708658,0.0001635956,0.00007564839,0.0001685303,0.0003586106,0.8444164,0.003872331,0.1018077,0.001730803,0.04372643],"study_design_scores_gemma":[0.0000268467,0.0000160527,0.0001315358,0.000003793077,0.00001037932,0.00001483551,0.00002470217,0.9499876,0.0007710994,0.04877134,0.0002324017,0.000009407522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2277699,0.0003509741,0.7654989,0.0008262192,0.0001018267,0.0001779296,0.0002472276,0.001375777,0.003651285],"genre_scores_gemma":[0.8301729,0.0002183925,0.1662682,0.0001160084,0.0001143461,0.0002089464,0.0003055783,0.0001893952,0.002406347],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01150782,"threshold_uncertainty_score":0.03168017,"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."}}