{"id":"W2016530058","doi":"10.1109/tcomm.2003.816972","title":"Effective bandwidth of multiclass Markovian traffic sources and admission control with dynamic buffer partitioning","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quality of service; Computer science; Bandwidth (computing); Markov process; Admission control; Buffer overflow; Statistical time division multiplexing; Partition (number theory); Multiplexing; Markov chain; Packet loss; Queueing theory; Computer network; Bandwidth allocation; Buffer (optical fiber); Call Admission Control; Network packet; Real-time computing; Mathematics; Telecommunications; Statistics","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.00129523,0.0006014773,0.0005687339,0.0006880908,0.0003750312,0.001206474,0.001146554,0.0006016676,0.000517447],"category_scores_gemma":[0.00579871,0.0003784134,0.0003063879,0.0005090315,0.0009376965,0.001640996,0.0008719737,0.0006460755,0.00006359668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001363046,"about_ca_system_score_gemma":0.0009525892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002856396,"about_ca_topic_score_gemma":0.001099346,"domain_scores_codex":[0.9992374,0.0002570497,0.00002448591,0.00008246935,0.0002339275,0.000164559],"domain_scores_gemma":[0.9981863,0.001282667,0.0002258719,0.00008032216,0.0001513326,0.00007349389],"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.0001701774,0.00003846001,0.0007101278,0.00004459916,0.00002905302,0.00009026238,0.0001000559,0.91398,0.007492001,0.06090367,0.0001614786,0.01628015],"study_design_scores_gemma":[0.00000430586,0.00001065178,0.00007369824,0.000002564278,0.000004629693,0.00001111919,0.000007239451,0.9934319,0.0006471168,0.005745524,0.00005783163,0.000003429855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.22479,0.0009643847,0.7708985,0.0003552921,0.00005395912,0.00003478693,0.00002154713,0.00009470264,0.002786787],"genre_scores_gemma":[0.98927,0.0001857464,0.01003931,0.00002038639,0.00002689379,0.00002525749,0.000008833315,0.000008719588,0.0004148335],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002856396,"threshold_uncertainty_score":0.009889603,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007693999743948856,"score_gpt":0.2303236653854175,"score_spread":0.2226296656414687,"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."}}