{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001774004,0.0001030703,0.0001470074,0.00005403964,0.000118773,0.00008015541,0.0003253935,0.00005496315,0.00008961089],"category_scores_gemma":[0.00002541191,0.00009484847,0.00006270013,0.0002831958,0.00004728518,0.000277584,0.00009081144,0.0001269969,0.00004296043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003964175,"about_ca_system_score_gemma":0.00002212489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003909673,"about_ca_topic_score_gemma":0.0001041028,"domain_scores_codex":[0.9991096,0.00005176333,0.0001946592,0.0002551959,0.0001613719,0.0002273702],"domain_scores_gemma":[0.9992605,0.00009944479,0.00007277286,0.0004042584,0.00008095797,0.00008211022],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004456101,0.0002554006,0.0002679027,0.00001695487,0.00003519018,0.0007263375,0.0005269975,0.0003392371,0.0009432088,0.04110708,0.001279542,0.9544977],"study_design_scores_gemma":[0.0003592338,0.00005196628,0.0000460491,0.00001259063,0.000005858669,0.0005660006,0.00002122788,0.9967287,0.00008123647,0.0001478389,0.001853824,0.0001255316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2587335,0.0005608914,0.7312976,0.001586525,0.0002665441,0.0001124666,9.243741e-7,0.0002761284,0.007165408],"genre_scores_gemma":[0.9482058,0.000009054485,0.05023246,0.0002331187,0.0000289726,0.000002656584,2.654491e-7,0.000005298585,0.001282345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9963894,"threshold_uncertainty_score":0.3867808,"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."}}