{"id":"W2188636836","doi":"10.1007/978-1-4615-0849-6_12","title":"Analysis of Frame-Based Fair Queueing under Self-Similar Traffic","year":2002,"lang":"en","type":"book-chapter","venue":"Kluwer international series in engineering and computer science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Queueing theory; Network packet; Weighted round robin; Weighted fair queueing; Quality of service; Generalized processor sharing; Packet analyzer; Fair queuing; Scheduling (production processes); Frame (networking); Processor sharing; Real-time computing; Asynchronous communication; Processing delay; Transmission delay; Round-robin scheduling; Dynamic priority scheduling; Mathematical optimization; Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003430335,0.0002787623,0.0004130431,0.002172436,0.00007510692,0.0002154735,0.0006473547,0.00009908708,0.0001459095],"category_scores_gemma":[0.00002970478,0.0002932774,0.0001584547,0.0007313691,0.0001988142,0.0008731594,0.0002713752,0.0002295327,0.000006629185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000109276,"about_ca_system_score_gemma":0.00002042584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001362088,"about_ca_topic_score_gemma":0.00001675721,"domain_scores_codex":[0.998369,0.000002706944,0.0003914346,0.0005086219,0.0005123677,0.0002158265],"domain_scores_gemma":[0.9991717,0.00007079143,0.0002402361,0.0002858561,0.0002116767,0.00001974204],"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.000005867018,0.00001726228,0.0001259353,0.00004865119,0.0002325964,0.00000827239,0.00003811652,0.8079119,0.00001478909,0.1903562,0.00001079092,0.001229666],"study_design_scores_gemma":[0.0001175014,0.000008153002,0.0004606635,0.0001652855,0.0002179931,0.000001436122,0.000006109934,0.9851431,0.000009299621,0.001814669,0.01175142,0.0003043897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0919909,0.0007961325,0.7951458,0.001796992,0.00517144,0.0006514778,0.00005290953,0.00140052,0.1029938],"genre_scores_gemma":[0.9865174,0.00004853412,0.009737325,0.0004659388,0.0004656164,0.000007332248,0.00003281479,0.00004588202,0.002679212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8945264,"threshold_uncertainty_score":0.999952,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007241163496856129,"score_gpt":0.1940008818572485,"score_spread":0.1867597183603924,"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."}}