{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001948499,0.0001379264,0.0001435548,0.0001526011,0.000162965,0.00006152841,0.0002358585,0.00006943478,0.00002282903],"category_scores_gemma":[0.000001032063,0.000110138,0.00003432112,0.0007408209,0.00001717251,0.0003809129,0.000008561509,0.00008018052,0.000009160155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004315063,"about_ca_system_score_gemma":0.00001753999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005421183,"about_ca_topic_score_gemma":0.001902418,"domain_scores_codex":[0.998948,0.00007127945,0.0002819313,0.0003210731,0.0001654049,0.0002122802],"domain_scores_gemma":[0.9994022,0.00005975664,0.00004679757,0.0003643758,0.00007139296,0.0000555342],"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.00001531717,0.0001009835,0.00003965413,0.00002229716,0.00002055899,0.00000256713,0.0002043132,0.9393017,0.0000118461,0.0007662171,0.0001612983,0.05935326],"study_design_scores_gemma":[0.0009728858,0.00006493394,0.0005746147,0.0001725754,0.00001857693,0.000001539806,0.0000329467,0.9971255,0.0000436509,0.00008160845,0.0007610873,0.0001500691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001407128,0.00004061904,0.9947655,0.002922224,0.0003327726,0.0003419286,0.000003520589,0.00008768557,0.00009865827],"genre_scores_gemma":[0.6549192,0.0008591801,0.3429156,0.000889888,0.00005063098,0.0001069857,0.000004382294,0.00001663111,0.0002375262],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6535121,"threshold_uncertainty_score":0.4491297,"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."}}