{"id":"W2106951158","doi":"10.1109/icc.1995.525183","title":"Delay bounds of a dynamic priority queueing scheme: single node case","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Queueing theory; Computer network; Node (physics); Queue; Network packet; Scheme (mathematics); Priority queue; Layered queueing network; Upper and lower bounds; Queuing delay; Process (computing); Real-time computing; Distributed computing; 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.005047487,0.001056314,0.001240692,0.001740725,0.001179293,0.00339465,0.00266258,0.001415435,0.004547661],"category_scores_gemma":[0.02150224,0.0007022801,0.0005889657,0.001377095,0.001983715,0.003407446,0.002422343,0.002130688,0.000458578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00468791,"about_ca_system_score_gemma":0.002337687,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002765981,"about_ca_topic_score_gemma":0.001243335,"domain_scores_codex":[0.9975736,0.0003255025,0.0001233463,0.0004187392,0.0008759173,0.0006829351],"domain_scores_gemma":[0.9804135,0.01385292,0.001382385,0.001324542,0.00214779,0.0008788523],"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.0007558272,0.0001113514,0.001004432,0.0004436724,0.00009252515,0.000265087,0.0004174375,0.5342444,0.01734013,0.4028017,0.0027483,0.03977516],"study_design_scores_gemma":[0.0000592146,0.0001924107,0.0002694475,0.00007269017,0.00004551933,0.0001465785,0.00005950307,0.9143706,0.003959141,0.07886263,0.001921078,0.00004107782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1297547,0.004907864,0.8418564,0.001240102,0.0002932829,0.0001242628,0.0002768178,0.0005370478,0.02100959],"genre_scores_gemma":[0.9509796,0.001627337,0.04403419,0.0001918258,0.0001785818,0.0001180413,0.0001021637,0.0001301286,0.002638203],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005047487,"threshold_uncertainty_score":0.03401327,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01445268482103055,"score_gpt":0.221593804208901,"score_spread":0.2071411193878704,"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."}}