{"id":"W2106536499","doi":"10.1109/icccn.2000.885500","title":"Deadline based network resource management","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Tuple; Network packet; Scheduling (production processes); Distributed computing; Computer network; Earliest deadline first scheduling; Key (lock); Fair-share scheduling; Rate-monotonic scheduling; Quality of service","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.0001589371,0.00009213018,0.00008719815,0.0000337132,0.00009939451,0.00008345528,0.0005283583,0.00002886089,0.0004502238],"category_scores_gemma":[0.00000204906,0.00007958554,0.00004698996,0.0003244374,0.00001513143,0.0000862943,0.00008041394,0.00006563494,0.0004296619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001288684,"about_ca_system_score_gemma":0.000002940693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.368788e-7,"about_ca_topic_score_gemma":0.000002428758,"domain_scores_codex":[0.9990989,0.00004253569,0.0001380826,0.0002589428,0.0001812857,0.0002802292],"domain_scores_gemma":[0.9993504,0.00006374373,0.00002989604,0.0004520938,0.00001876825,0.00008514368],"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.000001897869,0.00003179904,0.00005452014,0.000002130115,0.00001023149,0.00002280311,0.000008986519,0.0259134,2.201021e-7,0.1721479,0.1708492,0.6309569],"study_design_scores_gemma":[0.0002982,0.00001734704,0.0001005504,0.000006184755,0.000003719258,0.000001598952,0.000002030869,0.6735754,0.000001551447,0.0002603667,0.3256546,0.00007849757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00005924218,0.0002372611,0.8255775,0.004984767,0.0001481806,0.0001014013,8.889869e-8,0.0003951815,0.1684964],"genre_scores_gemma":[0.7938704,0.00002000658,0.1614457,0.01232976,0.0004058293,0.00003263952,0.000001468593,0.00001063274,0.03188357],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7938111,"threshold_uncertainty_score":0.5522578,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01141371890797681,"score_gpt":0.1801792031958126,"score_spread":0.1687654842878358,"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."}}