{"id":"W4379883149","doi":"10.1016/j.comnet.2023.109863","title":"Congestion-aware delay-guaranteed scheduling and routing with renewal optimization","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"Age of Information Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada; University of Victoria","keywords":"Computer science; Queuing delay; Goodput; Computer network; Network congestion; Network delay; Network packet; Distributed computing; Queue; Scheduling (production processes); End-to-end delay; Mathematical optimization; Throughput; Wireless","routes":{"ca_aff":true,"ca_fund":true,"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.003068757,0.000998899,0.001935205,0.001058193,0.0008485225,0.002049121,0.002598458,0.001293725,0.001981292],"category_scores_gemma":[0.01165261,0.0008960381,0.0007785469,0.001806764,0.001590882,0.002357982,0.001937745,0.0019914,0.0002468649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003117817,"about_ca_system_score_gemma":0.002521099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005006996,"about_ca_topic_score_gemma":0.003583203,"domain_scores_codex":[0.9986167,0.000596207,0.00004923969,0.0001900561,0.0002798954,0.0002679071],"domain_scores_gemma":[0.9960425,0.002827291,0.0003071302,0.0002661661,0.000337259,0.0002197132],"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.0002062191,0.00005633147,0.0002934432,0.0000570416,0.00004312325,0.00003118375,0.00004698024,0.9187714,0.001172229,0.06171935,0.001652242,0.01595042],"study_design_scores_gemma":[0.000006781434,0.00001007685,0.00002772701,0.000002089132,0.000005561496,0.000005286087,0.000003067664,0.9882671,0.0001244167,0.01139549,0.000148953,0.000003370768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03072368,0.001210833,0.9636847,0.0007177423,0.000176156,0.00005181819,0.00007278589,0.0002754229,0.00308685],"genre_scores_gemma":[0.9126567,0.001012581,0.08045688,0.0001686372,0.0002690699,0.00009414837,0.0001040437,0.0001720739,0.005065935],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005006996,"threshold_uncertainty_score":0.02262145,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008632974006670659,"score_gpt":0.2033725434131101,"score_spread":0.1947395694064395,"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."}}