{"id":"W2141838214","doi":"10.1109/qshine.2005.17","title":"Delay Satisfaction End-to-End Priority Assignment and Routing in Multi- Class Priority Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Heuristic; Routing (electronic design automation); End-to-end principle; Quality of service; Computation; Distributed computing; End-to-end delay; Computer network; Mathematical optimization; Priority inheritance; Algorithm; Dynamic priority scheduling; 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.0006638348,0.0001731791,0.0002027395,0.00007830108,0.0001403799,0.0001553673,0.0002186934,0.0001107722,0.00002990268],"category_scores_gemma":[0.00002707244,0.0001629815,0.00003693748,0.0002760552,0.00002679133,0.0003927967,0.0001756056,0.000292774,0.00002015032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000196597,"about_ca_system_score_gemma":0.00005635128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000165186,"about_ca_topic_score_gemma":0.003355042,"domain_scores_codex":[0.9983746,0.0001297586,0.0003328419,0.0005071352,0.000241689,0.0004139502],"domain_scores_gemma":[0.9992266,0.0001677457,0.00007731739,0.0003017703,0.00003479373,0.0001917195],"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.000007975967,0.00004173244,0.03558463,0.000001503674,0.000007976589,0.000005260852,0.0002713378,0.02173053,0.00004386799,0.0115636,0.00009464609,0.930647],"study_design_scores_gemma":[0.0006860612,0.00003659131,0.1692524,0.00001420468,0.00000449907,0.000008763819,0.00001809316,0.8277763,0.00001714387,0.00003082983,0.001983709,0.0001714093],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1162331,0.0001296315,0.8804755,0.001760664,0.0002927645,0.0003164609,4.798777e-7,0.0001798181,0.0006115593],"genre_scores_gemma":[0.9498023,0.00003052482,0.04895644,0.0007860872,0.0001799879,0.00002183254,6.701597e-7,0.000006808677,0.0002153592],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9304755,"threshold_uncertainty_score":0.6646193,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01465350829868846,"score_gpt":0.2483859066987742,"score_spread":0.2337323984000858,"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."}}