{"id":"W2090192756","doi":"10.1109/infcom.2013.6567050","title":"Capacity provisioning for schedulers with tiny buffers","year":2013,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Buffer overflow; Provisioning; Markov chain; Mathematical optimization; Scaling; 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.002177841,0.0004371587,0.0005680053,0.0006936305,0.0006936679,0.001053856,0.0007430795,0.0004156968,0.001331849],"category_scores_gemma":[0.01021915,0.0003123876,0.0002934083,0.0006022758,0.001346632,0.001418459,0.0009539992,0.000753639,0.0001665598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001477097,"about_ca_system_score_gemma":0.001373108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003700948,"about_ca_topic_score_gemma":0.002670866,"domain_scores_codex":[0.9995276,0.0001512371,0.00003017671,0.00006759917,0.0001220771,0.0001013457],"domain_scores_gemma":[0.9968329,0.001726261,0.0005070253,0.0003674024,0.0002858934,0.0002804426],"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.0003166853,0.00007558586,0.001714726,0.0001134737,0.00004555967,0.0001209484,0.0001167312,0.9186857,0.01201448,0.04683051,0.001036481,0.01892906],"study_design_scores_gemma":[0.00002366681,0.00003403626,0.0002088979,0.000009308005,0.000008265947,0.00002132067,0.00002025898,0.9871619,0.001967131,0.01011033,0.0004245614,0.00001019055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3405347,0.001288071,0.6505336,0.0006122803,0.0002641154,0.0001448446,0.0001254909,0.001081193,0.005415628],"genre_scores_gemma":[0.9570216,0.0002719095,0.04191615,0.00008683872,0.00003474031,0.00005747922,0.00003463062,0.00004727796,0.0005293699],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003700948,"threshold_uncertainty_score":0.01151764,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01033891986464554,"score_gpt":0.182660910293268,"score_spread":0.1723219904286225,"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."}}