{"id":"W2067366494","doi":"10.1016/j.jpdc.2008.01.001","title":"On the complexity and algorithm of grooming regular traffic in WDM optical networks","year":2008,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Traffic grooming; Synchronous optical networking; Computer science; Wavelength-division multiplexing; Multiplexing; Multiplexer; Upper and lower bounds; Algorithm; Channel (broadcasting); Computer network; Time complexity; Wavelength; Mathematics; Telecommunications","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.003215416,0.001094944,0.001538742,0.001260297,0.001294773,0.003835953,0.002636214,0.002033199,0.00388812],"category_scores_gemma":[0.02464107,0.0009291273,0.0008989495,0.001867851,0.002382849,0.005954209,0.002650713,0.003180492,0.0004754789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003152227,"about_ca_system_score_gemma":0.003327045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006090962,"about_ca_topic_score_gemma":0.006904489,"domain_scores_codex":[0.9976339,0.0008341327,0.0001139912,0.0002839916,0.0008053841,0.0003285945],"domain_scores_gemma":[0.9705361,0.02508941,0.001093437,0.001426497,0.001302828,0.0005517381],"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.001201583,0.0003415125,0.00373788,0.0002815155,0.00009135597,0.000143504,0.0004469797,0.763905,0.005975282,0.1287399,0.006942669,0.08819285],"study_design_scores_gemma":[0.00004520533,0.00003651059,0.0002523366,0.000009745312,0.00001316858,0.00002646747,0.00003594897,0.9426787,0.0004685844,0.0561232,0.0002978318,0.00001232414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2137938,0.001166412,0.7689468,0.002227993,0.000249637,0.0002452196,0.0003609055,0.0007878866,0.01222122],"genre_scores_gemma":[0.7107812,0.0009928193,0.2795841,0.0004844079,0.0003766955,0.0003049791,0.0006231745,0.0003251765,0.006527385],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006090962,"threshold_uncertainty_score":0.02287108,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02036499625000479,"score_gpt":0.2189781675200836,"score_spread":0.1986131712700789,"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."}}