{"id":"W4312945422","doi":"10.1007/978-3-031-19211-1_2","title":"A Time Utility Function Driven Scheduling Scheme for Managing Mixed-Criticality Traffic in TSN","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Aperiodic graph; Quality of service; Scheduling (production processes); Internet traffic; Benchmark (surveying); Computer network; Criticality; Distributed computing; The Internet; Real-time computing; Mathematical optimization","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.000986496,0.0004921868,0.0006826818,0.0004828159,0.000881169,0.0009114302,0.001451163,0.0004206466,0.00241214],"category_scores_gemma":[0.001521608,0.0002070667,0.00027695,0.0006949427,0.0004103483,0.0007594541,0.0008334419,0.0007489231,0.00032468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001261649,"about_ca_system_score_gemma":0.001423802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003034101,"about_ca_topic_score_gemma":0.005063887,"domain_scores_codex":[0.9996405,0.00009576415,0.00002885646,0.00005044833,0.0001122979,0.00007223378],"domain_scores_gemma":[0.9993694,0.0001948848,0.00005489132,0.0001010522,0.0001890545,0.00009071166],"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.0007658633,0.0002957512,0.0006552775,0.0001454019,0.00006622134,0.0002062148,0.0002307964,0.6285805,0.04063575,0.06142797,0.007154531,0.2598358],"study_design_scores_gemma":[0.00001247521,0.00005826292,0.0000560083,0.000004198204,0.000009068103,0.00002981946,0.00001518601,0.9919397,0.002007578,0.004669803,0.001190168,0.000007733897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05354551,0.0003918805,0.9409701,0.0001626151,0.0002514134,0.0001393018,0.0000801643,0.0009079306,0.003551138],"genre_scores_gemma":[0.843233,0.00023387,0.1518854,0.000110021,0.00009439835,0.00009873068,0.0001076662,0.0001170032,0.00412],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003034101,"threshold_uncertainty_score":0.009153962,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0156856182061542,"score_gpt":0.2397724412284627,"score_spread":0.2240868230223085,"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."}}