{"id":"W1524481615","doi":"10.1109/drcn.2015.7149024","title":"Multi-failure restoration with minimal flow operations in software defined networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ontario Tech University","funders":"Mitacs","keywords":"Dijkstra's algorithm; Minimum-cost flow problem; Computer science; Software-defined networking; OpenFlow; Path (computing); Flow network; Shortest path problem; Flexibility (engineering); Software; Maximum flow problem; Flow (mathematics); Mathematical optimization; Distributed computing; Computer network; Mathematics; Graph; Theoretical computer science","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.001082444,0.001178014,0.0010702,0.0008965454,0.000791303,0.0008604812,0.001368764,0.0008250908,0.001021925],"category_scores_gemma":[0.003155087,0.0004085585,0.0007045608,0.0009734111,0.0009539897,0.00179932,0.001021324,0.000755973,0.00009420427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00151471,"about_ca_system_score_gemma":0.0014251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006751113,"about_ca_topic_score_gemma":0.003990781,"domain_scores_codex":[0.9990238,0.0003227959,0.0000426531,0.0001728857,0.000232951,0.0002049177],"domain_scores_gemma":[0.9988318,0.000668972,0.0001601045,0.00009519091,0.0001560243,0.00008792384],"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.00009204793,0.00005472279,0.0002666573,0.00006427182,0.00001856898,0.00005187537,0.00004162011,0.9677908,0.001525747,0.006760728,0.0003492923,0.02298361],"study_design_scores_gemma":[0.000009978906,0.00004777242,0.00007945614,0.000003944891,0.000007456221,0.00001879146,0.00001833414,0.9934389,0.0007743086,0.005336334,0.0002594793,0.000005264118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09921253,0.0005903529,0.898226,0.0002289583,0.00004606496,0.00008032999,0.00006556237,0.0003347683,0.001215465],"genre_scores_gemma":[0.8659061,0.0003096371,0.132512,0.00004808951,0.00003253008,0.0001044221,0.0001154514,0.00005224479,0.0009196271],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006751113,"threshold_uncertainty_score":0.01342362,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0282510195308413,"score_gpt":0.2388525766573511,"score_spread":0.2106015571265098,"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."}}