{"id":"W2171047518","doi":"10.1109/icpp.2006.38","title":"Efficient Algorithms for Traffic Grooming in SONET/WDM Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"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; Computer network; Heuristic; Algorithm; Multiplexer; Routing and wavelength assignment; Node (physics); Optical mesh network; Multiplexing; Wavelength; Engineering; Telecommunications; Wireless network; Wireless; Optics; Physics","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.001869638,0.002132255,0.00161042,0.001496542,0.001414097,0.002112638,0.002708927,0.002128297,0.005038508],"category_scores_gemma":[0.005487835,0.00108328,0.001009844,0.002482028,0.001557954,0.003555926,0.00242052,0.001878766,0.001053453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002062016,"about_ca_system_score_gemma":0.002064425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003346051,"about_ca_topic_score_gemma":0.005365169,"domain_scores_codex":[0.9984139,0.0004810812,0.00008673194,0.0002986791,0.0003580505,0.0003615029],"domain_scores_gemma":[0.9975336,0.001691764,0.0002266675,0.0002706446,0.0001927338,0.00008460112],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004910533,0.0003138614,0.0006049605,0.0003230748,0.00009219599,0.00008309085,0.000247631,0.6577914,0.003740548,0.05798243,0.009357391,0.2689723],"study_design_scores_gemma":[0.0001070724,0.00004973604,0.00007905908,0.00001922857,0.00001480818,0.00003811518,0.00004323763,0.9457056,0.001226102,0.05060733,0.002096611,0.00001308294],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02033745,0.001100415,0.9704642,0.0004063516,0.00009266999,0.0002358757,0.0001433304,0.001836711,0.005382905],"genre_scores_gemma":[0.1758353,0.0006991331,0.8179626,0.0002118023,0.0001065596,0.0005110292,0.0005659073,0.0003168385,0.003790715],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005038508,"threshold_uncertainty_score":0.01685548,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00835705029660807,"score_gpt":0.2153840385235958,"score_spread":0.2070269882269877,"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."}}