{"id":"W1978642186","doi":"10.1016/j.comcom.2007.08.037","title":"Quality of service based resource allocation for scheduled lightpath demands","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Backup; Integer programming; Computer network; Heuristic; Quality of service; Routing (electronic design automation); Resource allocation; Path (computing); Linear programming; Service (business); Idle; Path protection; Metric (unit); Mathematical optimization; Distributed computing; Wavelength-division multiplexing; Algorithm; Wavelength; Mathematics","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.000397988,0.00009506594,0.0001603806,0.00007940952,0.00008848828,0.000009489673,0.000815095,0.00009267336,0.000001471994],"category_scores_gemma":[0.00005163955,0.0001024244,0.00004931657,0.0003498869,0.00007463869,0.0000641657,0.0001758896,0.0001446029,0.000003789297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004357467,"about_ca_system_score_gemma":0.000009843548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002656741,"about_ca_topic_score_gemma":0.00006800504,"domain_scores_codex":[0.999266,0.0000265813,0.0003651985,0.0001002393,0.00007621572,0.0001657976],"domain_scores_gemma":[0.9973935,0.0008995754,0.00006515385,0.001446424,0.0001596811,0.00003568733],"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.00007075792,0.0004157253,0.00142127,0.0006092938,0.0001489549,3.376198e-7,0.0005178813,0.4631245,0.009971682,0.3300889,0.001626295,0.1920044],"study_design_scores_gemma":[0.0004176001,0.00003042911,0.004697875,0.00005169274,0.00001095385,3.809543e-7,0.00004553468,0.9734851,0.002406152,0.00325182,0.01543996,0.0001625479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01336836,0.0004036014,0.9831122,0.001308017,0.00004307667,0.0002463084,0.000006314103,0.0005976172,0.0009145258],"genre_scores_gemma":[0.4629543,0.00001322826,0.5368075,0.0001240558,0.00001867763,0.00002342157,0.00004377175,0.00001234175,0.000002694058],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5103606,"threshold_uncertainty_score":0.4176747,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04868393157740157,"score_gpt":0.3092076100395707,"score_spread":0.2605236784621691,"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."}}