{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003876639,0.0008832176,0.001793287,0.001913526,0.001301436,0.002232013,0.003042236,0.001356614,0.003646704],"category_scores_gemma":[0.01043804,0.0006682255,0.0009066823,0.001360538,0.001869477,0.002284317,0.001078247,0.001068313,0.0002731547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006234638,"about_ca_system_score_gemma":0.003144058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02133759,"about_ca_topic_score_gemma":0.009528595,"domain_scores_codex":[0.9986492,0.000339827,0.0000362732,0.0001526068,0.000498069,0.0003239788],"domain_scores_gemma":[0.9945467,0.003933444,0.0002564713,0.0002069143,0.0008725387,0.0001839341],"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.0001653319,0.0000920114,0.0005702049,0.00007518737,0.00005012893,0.00008648436,0.0001330906,0.8614294,0.003148721,0.123474,0.001665858,0.009109594],"study_design_scores_gemma":[0.000002300725,0.000006643154,0.00006482731,0.000002300729,0.000005967569,0.000005780492,0.000004644348,0.9957235,0.00009903507,0.004025256,0.00005574358,0.000003979916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1652147,0.002101666,0.820132,0.000741999,0.0003221924,0.0001534205,0.0001771492,0.0004703604,0.01068667],"genre_scores_gemma":[0.9698132,0.0007436789,0.02387959,0.0001457348,0.0002088019,0.0000719896,0.0001096106,0.0001208574,0.004906482],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02133759,"threshold_uncertainty_score":0.04523563,"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."}}