{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002046982,0.00009401156,0.0001274402,0.00004626164,0.00006139928,0.00007092412,0.0001892907,0.00006569166,0.000002980729],"category_scores_gemma":[0.00001747042,0.00007811218,0.00002816783,0.00013034,0.000009319338,0.0001999237,0.00001430259,0.00006887596,0.000001672525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002141644,"about_ca_system_score_gemma":0.00002327253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003414256,"about_ca_topic_score_gemma":0.00002878144,"domain_scores_codex":[0.9992554,0.00003400179,0.0001716494,0.0002574632,0.00007987054,0.0002016403],"domain_scores_gemma":[0.9995439,0.0001177851,0.00004335905,0.0001756778,0.00003479215,0.00008447749],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003678878,0.00004830707,0.0003294218,0.000002209645,0.000003403385,0.000001718747,0.00004232352,0.007836337,0.00009437311,0.05777147,0.0004797992,0.9333538],"study_design_scores_gemma":[0.001528548,0.0001343907,0.0179407,0.00001796815,0.000003692783,0.000002714413,0.000005286178,0.976763,0.000001871356,0.002810286,0.0006929134,0.0000987059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009759118,0.0004446581,0.9823585,0.006638665,0.0001283362,0.0003528056,2.692332e-7,0.0001106594,0.0002070106],"genre_scores_gemma":[0.989895,0.00005614674,0.007892529,0.001789741,0.00003785816,0.00002710752,0.000002933898,0.000003273693,0.0002954289],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9801359,"threshold_uncertainty_score":0.3185322,"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."}}