{"id":"W2024367487","doi":"10.1016/s0167-739x(03)00110-9","title":"Optimal Quality of Service routing and admission control using the Utility Model","year":2003,"lang":"en","type":"article","venue":"Future Generation Computer Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"Sierra Wireless (Canada); University of Victoria; Eyeball (Canada)","funders":"","keywords":"Computer science; Knapsack problem; Computer network; Admission control; Quality of service; Session (web analytics); Reservation; Routing (electronic design automation); Resource allocation; Distributed computing; Algorithm","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.002535705,0.0009867079,0.001826033,0.000974274,0.0008259553,0.002853259,0.00237403,0.00143568,0.002695662],"category_scores_gemma":[0.009101807,0.0009939858,0.0008399716,0.001369044,0.001592127,0.003284907,0.001599561,0.001841436,0.000325175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004039623,"about_ca_system_score_gemma":0.002782659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01402284,"about_ca_topic_score_gemma":0.007774196,"domain_scores_codex":[0.9979696,0.0009088542,0.00004871485,0.0002228801,0.0004435986,0.000406416],"domain_scores_gemma":[0.9976926,0.001485599,0.0001601829,0.0001376664,0.0003470946,0.0001768686],"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.0001216127,0.00005009392,0.000204022,0.00001987861,0.00002549613,0.00002983319,0.00003662944,0.9118369,0.0003608626,0.07749737,0.0009270926,0.008890224],"study_design_scores_gemma":[0.000008217437,0.000003991735,0.00002186703,0.000001175038,0.000003559948,0.00000298324,0.000003000794,0.9880023,0.00003677627,0.01185029,0.00006266304,0.000003224975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05157101,0.0007802685,0.9391443,0.001245303,0.000172888,0.00005924865,0.00008771435,0.0002943003,0.006644992],"genre_scores_gemma":[0.9623749,0.0004455808,0.03198469,0.00008997134,0.0001432985,0.00006731606,0.00006519271,0.00007408672,0.00475497],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01402284,"threshold_uncertainty_score":0.02930969,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0451775032579294,"score_gpt":0.2663088071934362,"score_spread":0.2211313039355068,"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."}}