{"id":"W2125698398","doi":"10.1109/ccece.2009.5090106","title":"Dynamic admission control and path allocation for SLAs in DiffServ networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Quality of service; Service level; Admission control; Computer network; Path (computing); Context (archaeology); Throughput; Blocking (statistics); Distributed computing; Prioritization","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.002271735,0.0008100006,0.000823914,0.0005699554,0.0008427291,0.001244433,0.001115931,0.0009261404,0.001099831],"category_scores_gemma":[0.00338973,0.0004811471,0.0004261471,0.000664175,0.001391986,0.001205738,0.001067196,0.001186972,0.0001183183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001950004,"about_ca_system_score_gemma":0.0027522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006202071,"about_ca_topic_score_gemma":0.00403947,"domain_scores_codex":[0.998809,0.0005155443,0.00004451928,0.0001361982,0.0002989848,0.0001958212],"domain_scores_gemma":[0.9989547,0.0006831509,0.0001273507,0.00006071603,0.0001054948,0.00006868968],"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.00008863034,0.00004015616,0.0003105053,0.0000340966,0.0000135804,0.0000541604,0.00009628847,0.9470494,0.001527822,0.0271311,0.0004230555,0.02323105],"study_design_scores_gemma":[0.00001050174,0.00001674096,0.00004228943,0.000002708069,0.000004225821,0.000007737632,0.000009806531,0.9936073,0.00029825,0.005784726,0.0002117725,0.000003874423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04847674,0.0004035815,0.9471785,0.0004317407,0.00005175064,0.00008673844,0.00003226284,0.0001962859,0.003142289],"genre_scores_gemma":[0.9491175,0.0002139489,0.04912193,0.00006582663,0.00004493521,0.0001106788,0.00003212548,0.00002339531,0.001269644],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006202071,"threshold_uncertainty_score":0.01414835,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004385523136421856,"score_gpt":0.2175946714967875,"score_spread":0.2132091483603656,"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."}}