{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006786994,0.002046923,0.002645355,0.001509546,0.001887153,0.005429757,0.003569907,0.002885346,0.01116949],"category_scores_gemma":[0.03579971,0.001041161,0.0011692,0.001845121,0.002995595,0.005983707,0.003015199,0.003227369,0.0008092067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005683071,"about_ca_system_score_gemma":0.00456754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006567323,"about_ca_topic_score_gemma":0.003425518,"domain_scores_codex":[0.9949945,0.002149968,0.0001362453,0.0005530096,0.0009269879,0.001239203],"domain_scores_gemma":[0.9664235,0.02629526,0.002221792,0.001204236,0.001831491,0.002023849],"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.0005513346,0.0002408904,0.0009959674,0.0002009851,0.0000807208,0.0001374894,0.0001797412,0.6834816,0.001224372,0.2956701,0.004223577,0.0130132],"study_design_scores_gemma":[0.00004472556,0.0000570566,0.00009902946,0.00001116622,0.00001249796,0.00002395039,0.00004375103,0.9402535,0.0002120719,0.05854815,0.0006822809,0.00001178523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1850673,0.001608415,0.7487364,0.003748086,0.0002806191,0.0004646171,0.0005835189,0.0007028198,0.05880815],"genre_scores_gemma":[0.9530471,0.0007579427,0.03721345,0.0004477668,0.0002417978,0.0003399022,0.0002275499,0.0001955029,0.007529091],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01116949,"threshold_uncertainty_score":0.04123372,"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."}}