{"id":"W1561119721","doi":"10.1109/glocom.1994.513591","title":"A dynamic priority queueing approach to traffic regulation and scheduling in B-ISDN","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Queueing theory; Computer network; Network packet; Priority ceiling protocol; Scheduling (production processes); Priority inheritance; Integrated Services Digital Network; Multiplexing; Priority queue; Deadline-monotonic scheduling; Statistical time division multiplexing; Real-time computing; Packet switching; Fair queuing; Dynamic priority scheduling; Queue; Round-robin scheduling; Mathematical optimization; Rate-monotonic scheduling; Quality of service; Telecommunications; 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.001225967,0.0005931937,0.0007577441,0.0007889527,0.0009067183,0.001346896,0.001841571,0.000752047,0.001072369],"category_scores_gemma":[0.00178987,0.0003673342,0.0004931495,0.001002619,0.0009513244,0.001365161,0.0008214504,0.0009846874,0.0002030584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001867873,"about_ca_system_score_gemma":0.001718025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0050847,"about_ca_topic_score_gemma":0.00467531,"domain_scores_codex":[0.9990196,0.0003128515,0.00006114197,0.0001370599,0.0003322179,0.0001370988],"domain_scores_gemma":[0.999392,0.0002219424,0.00007316149,0.00006191296,0.0001884085,0.00006258104],"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.000145911,0.0001178947,0.0005852436,0.0001494404,0.0000562316,0.0003962374,0.0002950529,0.5495479,0.0137714,0.320022,0.002478223,0.1124344],"study_design_scores_gemma":[0.00001616074,0.00005147284,0.00005862489,0.000007707151,0.00001435955,0.00006616508,0.00001775612,0.9702443,0.001040899,0.02628385,0.002184435,0.00001427555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006735053,0.0004335431,0.9905724,0.0001620775,0.00009830247,0.0000548698,0.00001652477,0.0001146239,0.001812594],"genre_scores_gemma":[0.6584172,0.001612684,0.3349777,0.0001826552,0.0003456208,0.0001863076,0.00005100999,0.00005783145,0.004169079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0050847,"threshold_uncertainty_score":0.01355243,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01253717379610884,"score_gpt":0.2126445598755062,"score_spread":0.2001073860793973,"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."}}