{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000279863,0.00016106,0.0001481116,0.0001593248,0.000281932,0.0004294175,0.0003313461,0.00009362605,0.00000408531],"category_scores_gemma":[0.00001159478,0.0001490463,0.00002308457,0.0008535521,0.00004128837,0.000880056,0.0002788076,0.000142973,0.00001384024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002953857,"about_ca_system_score_gemma":0.00003669733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004453959,"about_ca_topic_score_gemma":0.000001907223,"domain_scores_codex":[0.9988783,0.00004704503,0.0002767848,0.000307752,0.0002030593,0.0002870575],"domain_scores_gemma":[0.9991864,0.0001119374,0.0001596793,0.0002916673,0.0001645267,0.00008579226],"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.000005440904,0.000004229609,0.0005781208,0.000006172586,0.00001181796,0.00001098875,0.0003691917,0.9825511,2.138636e-7,0.002709796,0.0002281121,0.01352484],"study_design_scores_gemma":[0.0004282517,0.00005705208,0.000483218,0.00009967302,0.000005318259,0.0000583116,0.00002388468,0.9985511,0.000002917477,0.00005465707,0.00004347849,0.0001921039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003388624,0.00003322747,0.9946833,0.0003211815,0.0003687304,0.0001826595,5.262249e-7,0.000798043,0.0002236605],"genre_scores_gemma":[0.503395,0.0000403804,0.4958411,0.000397997,0.0002170623,0.00001048837,0.00005064728,0.00001612777,0.00003117435],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5000064,"threshold_uncertainty_score":0.607793,"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."}}