{"id":"W2433280216","doi":"10.1109/tnsm.2016.2580590","title":"Optimization of SDN Flow Operations in Multi-Failure Restoration Scenarios","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ontario Tech University","funders":"Mitacs","keywords":"Dijkstra's algorithm; Computer science; Path (computing); Minimum-cost flow problem; Flow network; Shortest path problem; Mathematical optimization; Software-defined networking; Integer programming; Flow (mathematics); Maximum flow problem; Integer (computer science); Software; Distributed computing; Algorithm; Computer network; Graph; Theoretical computer science; Mathematics","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.001596978,0.001111652,0.0008553939,0.0006073973,0.0006677057,0.001064315,0.000894752,0.0009680843,0.001905213],"category_scores_gemma":[0.002969006,0.0005504127,0.0004709766,0.0007379544,0.000848605,0.00134032,0.000769928,0.0008502537,0.0001165784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002151497,"about_ca_system_score_gemma":0.00192887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01078363,"about_ca_topic_score_gemma":0.009380003,"domain_scores_codex":[0.9994441,0.0002057557,0.00002081621,0.00007970237,0.00007752976,0.0001719935],"domain_scores_gemma":[0.998577,0.0009634978,0.0001470788,0.00005339708,0.0001315292,0.000127442],"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.00003154808,0.00001623578,0.0001505721,0.00001812383,0.000005374563,0.00001582878,0.000008702869,0.9946278,0.0002351511,0.001310929,0.0001366638,0.003443007],"study_design_scores_gemma":[0.000006827628,0.00001665077,0.00005988597,0.000002040087,0.000002738867,0.000004952961,0.00001611099,0.9981439,0.0001808727,0.00146436,0.00009977155,0.000001945911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2355941,0.0005596832,0.756732,0.0007004773,0.00008458434,0.0001676533,0.0002614591,0.0003215088,0.005578544],"genre_scores_gemma":[0.9322364,0.000244762,0.06574956,0.00004530583,0.00001383527,0.00008394371,0.0001281631,0.00004790748,0.001450198],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01078363,"threshold_uncertainty_score":0.0214417,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01596123671252649,"score_gpt":0.2203505701790603,"score_spread":0.2043893334665338,"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."}}