{"id":"W2046012872","doi":"10.1016/j.comnet.2009.05.009","title":"Heuristic algorithms for designing self-repairing protection trees in mesh networks","year":2009,"lang":"en","type":"article","venue":"Computer Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa; University of Ontario Institute of Technology","funders":"","keywords":"Computer science; Path protection; Backup; Redundancy (engineering); Unicast; Network topology; Distributed computing; Multicast; Tree (set theory); Heuristic; Computer network; Tree network; Mesh networking; Algorithm; Time complexity; Mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001721519,0.0009530804,0.001176488,0.001628853,0.0007503755,0.001117803,0.001855508,0.001462171,0.002853302],"category_scores_gemma":[0.005883952,0.001039045,0.0007946373,0.001341152,0.0009736745,0.001722593,0.0009637213,0.0008758987,0.000306722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001261986,"about_ca_system_score_gemma":0.001228565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00308889,"about_ca_topic_score_gemma":0.003800546,"domain_scores_codex":[0.9994355,0.0002562698,0.00003527417,0.00007217016,0.00009683173,0.000103937],"domain_scores_gemma":[0.9965713,0.002697264,0.0002430785,0.0001583113,0.0002274475,0.0001025817],"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.00007322296,0.00004715121,0.0002888111,0.00007165969,0.00002214518,0.0000276807,0.00006607804,0.9555379,0.0005383334,0.006380067,0.0008764657,0.03607054],"study_design_scores_gemma":[0.0000341939,0.00003306449,0.00005155872,0.00001089471,0.00001122779,0.0000116806,0.00003066113,0.9920224,0.0002798451,0.007227275,0.0002818856,0.000005300292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04798873,0.0006718924,0.9474005,0.0001997385,0.00005360705,0.0001449755,0.0001047961,0.0004229085,0.003012805],"genre_scores_gemma":[0.4729289,0.0005227722,0.5240859,0.00009595287,0.00005225107,0.0002802415,0.0002352513,0.0001260107,0.001672696],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00308889,"threshold_uncertainty_score":0.009545267,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01406975404724735,"score_gpt":0.2229072855366198,"score_spread":0.2088375314893725,"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."}}