{"id":"W1641542487","doi":"10.1109/icc.1999.765489","title":"Minimum cost traffic shaping: a user's perspective on connection admission control","year":2003,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Quality of service; Computer science; Computer network; Context (archaeology); Traffic classification; Traffic policing; Admission control; Traffic shaping; Resource (disambiguation); Perspective (graphical); Network traffic control; Control (management); Scheme (mathematics); Distributed computing; Mathematics; Artificial intelligence","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.0003281104,0.0002173564,0.0002301232,0.0001221885,0.0002298078,0.0001672285,0.0003621252,0.000108034,0.0002269312],"category_scores_gemma":[0.0001848,0.0001834186,0.0001177059,0.0003490048,0.00003777427,0.0002838251,0.00001689566,0.0002072189,0.0002291699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001715024,"about_ca_system_score_gemma":0.0001537541,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006869408,"about_ca_topic_score_gemma":0.00001586107,"domain_scores_codex":[0.9982855,0.000217911,0.0002316524,0.0005880306,0.0002987348,0.0003782255],"domain_scores_gemma":[0.998744,0.0003138845,0.00008935009,0.000411677,0.0001961144,0.0002449394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008823539,0.0002274405,0.00003935605,0.000002362977,0.00004727608,0.00001841062,0.0003216568,0.009283572,0.0001332355,0.8966763,0.006670378,0.08649174],"study_design_scores_gemma":[0.007121723,0.000924941,0.0003299958,0.00006347996,0.00003745365,0.00007468183,0.0009168595,0.8800777,0.0004727453,0.001894161,0.1073877,0.0006985518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0173421,0.0003896431,0.9167629,0.007891101,0.00151656,0.001054584,0.000002171074,0.001009591,0.0540313],"genre_scores_gemma":[0.9938989,0.00001389223,0.00122741,0.002613769,0.0001169996,0.00005969838,7.795141e-7,0.00001291779,0.00205569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9765567,"threshold_uncertainty_score":0.7479593,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02007552502490806,"score_gpt":0.256193568080073,"score_spread":0.2361180430551649,"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."}}