{"id":"W2096062220","doi":"10.1364/jocn.2.000793","title":"Stable Logical Topologies for Survivable Traffic Grooming of Scheduled Demands","year":2010,"lang":"en","type":"article","venue":"Journal of Optical Communications and Networking","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Traffic grooming; Computer science; Network topology; Computer network; Survivability; Path protection; Distributed computing; Logical topology; Overhead (engineering); Topology (electrical circuits); Bandwidth (computing); Wavelength-division multiplexing; Routing (electronic design automation); Engineering","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.0007484576,0.0005328166,0.0003214883,0.0005527491,0.0004684645,0.001112237,0.0006032274,0.0004905498,0.003123925],"category_scores_gemma":[0.002355078,0.0003665398,0.0004735836,0.0005663343,0.0006214316,0.001325844,0.0006636284,0.0008737938,0.0003695358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005953884,"about_ca_system_score_gemma":0.0007398154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004463135,"about_ca_topic_score_gemma":0.001195131,"domain_scores_codex":[0.9995983,0.0001805587,0.00001735865,0.00004483886,0.000113127,0.00004578397],"domain_scores_gemma":[0.9989409,0.0006637916,0.0001550251,0.0000732282,0.0001208861,0.00004621397],"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.00009523602,0.0000881248,0.0004557469,0.0002900351,0.00002742086,0.0002229803,0.0001407062,0.7735727,0.01307984,0.1584707,0.002070787,0.05148574],"study_design_scores_gemma":[0.00002019402,0.00008457772,0.0001030549,0.00002485245,0.00001353579,0.00007860268,0.00007086878,0.9390471,0.002359216,0.05322583,0.004961226,0.00001097668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01611704,0.0002876543,0.9787471,0.0002006583,0.00003443949,0.00008336133,0.00008617943,0.0001268418,0.004316754],"genre_scores_gemma":[0.5417423,0.001437345,0.4520957,0.0001660766,0.0001083284,0.0004404096,0.0004106221,0.0001395626,0.003459781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003123925,"threshold_uncertainty_score":0.0104506,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03360453544351871,"score_gpt":0.2800130439526551,"score_spread":0.2464085085091364,"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."}}