{"id":"W2096909102","doi":"10.1109/icnp.2008.4697038","title":"Competitive analysis of buffer policies with SLA commitments","year":2008,"lang":"en","type":"article","venue":"Proceedings/Proceedings - International Conference on Network Protocols","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Network packet; Computer science; Competitive analysis; Computer network; Revenue; Abstraction; Bandwidth (computing); Task (project management); Online algorithm; Algorithm; Upper and lower bounds; Business; Engineering","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004910662,0.0004041254,0.0006351798,0.0007637483,0.0003338031,0.0004584562,0.001937286,0.0001293484,0.0002475358],"category_scores_gemma":[0.00007886896,0.0003385762,0.0001773899,0.00241935,0.000318829,0.001172773,0.0004188789,0.0003905252,0.00002492443],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001375293,"about_ca_system_score_gemma":0.0001861228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000267048,"about_ca_topic_score_gemma":0.00000715899,"domain_scores_codex":[0.9965214,0.00001462258,0.0006782427,0.0007726105,0.001418984,0.0005942017],"domain_scores_gemma":[0.9958004,0.00006514134,0.0006646176,0.0001936695,0.003047885,0.0002282823],"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.0001861206,0.0002623274,0.04464384,0.0000359397,0.000707569,0.00000352369,0.001446185,0.0007735601,0.0003161872,0.9492935,0.002032462,0.0002987908],"study_design_scores_gemma":[0.008669197,0.006353906,0.1308856,0.002976534,0.0004876185,0.0001779079,0.001828185,0.7397127,0.009787164,0.02183239,0.07391604,0.003372697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.02408431,0.00001268058,0.02622784,0.003749718,0.0002118645,0.03142332,0.00004845731,0.0006925747,0.9135492],"genre_scores_gemma":[0.9556198,0.00004355009,0.02713823,0.0006742936,0.0001842437,0.01519029,0.0000242561,0.00003307586,0.001092327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9315354,"threshold_uncertainty_score":0.9999066,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07694593558326353,"score_gpt":0.3318369077999769,"score_spread":0.2548909722167134,"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."}}