{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001244639,0.0001647951,0.0002799933,0.00003344712,0.0002988924,0.0002181263,0.0003210075,0.00009943005,0.000002001596],"category_scores_gemma":[0.00001327949,0.0001174797,0.00005615559,0.0002168134,0.00002117475,0.0002560885,0.00006027002,0.0001279043,8.749419e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000222374,"about_ca_system_score_gemma":0.0001327483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003258889,"about_ca_topic_score_gemma":0.00001319567,"domain_scores_codex":[0.9979068,0.0007131507,0.0005142126,0.000370345,0.0002986069,0.0001969048],"domain_scores_gemma":[0.9987156,0.0001016593,0.0002881046,0.0004864942,0.0003161487,0.00009200336],"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.00001141635,0.00003451762,0.0002823052,0.00004276303,0.00004106867,8.310357e-7,0.0008970975,0.8964496,0.001343906,0.08679815,0.002776333,0.01132204],"study_design_scores_gemma":[0.0005789953,0.00001915958,0.0001358627,0.00001914775,0.0000110632,0.00001781234,0.00005451585,0.9974513,0.0000747438,0.000008952158,0.001501771,0.0001266564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05119729,0.0009557481,0.9396474,0.0007754175,0.00698165,0.0003255782,0.000003856121,0.00006726917,0.00004574269],"genre_scores_gemma":[0.946706,0.000004112922,0.04722311,0.0006282779,0.005398122,0.00001064067,0.00000254598,0.000006883963,0.00002028576],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8955087,"threshold_uncertainty_score":0.4790682,"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."}}