{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002776898,0.0001747991,0.0001742595,0.0001116599,0.0001041203,0.0002502216,0.0004373204,0.000118619,0.00001248855],"category_scores_gemma":[0.0001162892,0.0001356791,0.00002902219,0.0007736831,0.0000327931,0.0007636059,0.000127873,0.0001916074,0.00003951441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007300689,"about_ca_system_score_gemma":0.0002012197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001817176,"about_ca_topic_score_gemma":0.00729121,"domain_scores_codex":[0.9986953,0.00007495104,0.0002476404,0.0004080194,0.0002464693,0.0003276734],"domain_scores_gemma":[0.9990337,0.00008719321,0.00003755092,0.0004855633,0.0001843124,0.0001716362],"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.00003450689,0.0001371165,0.0246165,0.000003202608,0.00001041733,0.00003795052,0.0007504257,0.9451451,0.000006930568,0.003303858,0.01620172,0.009752306],"study_design_scores_gemma":[0.001236215,0.0001792286,0.007449573,0.00002529251,0.000003928423,0.00001968587,0.00004918504,0.9889389,0.00001043874,0.00009343189,0.001757341,0.0002367574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01013002,0.0001501047,0.9876463,0.00114124,0.0002237016,0.0002237854,0.000001225389,0.0003690648,0.0001145584],"genre_scores_gemma":[0.2581272,0.000004116586,0.7409086,0.0004605989,0.0001006694,0.00004611184,0.00002265401,0.00001328284,0.0003168167],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2479971,"threshold_uncertainty_score":0.5532834,"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."}}