{"id":1918,"date":"2015-06-01T14:37:31","date_gmt":"2015-06-01T13:37:31","guid":{"rendered":"http:\/\/home.agh.edu.pl\/~cholda\/?page_id=1918"},"modified":"2016-03-30T10:20:11","modified_gmt":"2016-03-30T09:20:11","slug":"risk-engineering-in-energy-efficient-networks","status":"publish","type":"page","link":"https:\/\/home.agh.edu.pl\/~cholda\/research\/risk-engineering-in-energy-efficient-networks\/","title":{"rendered":"Risk Engineering in Energy Efficient Networks"},"content":{"rendered":"<h2>Publication<\/h2>\n<p>Here, the information related to our paper presenting the iterative method for energy-efficient optimized design of resilient network with risk-awareness is given. The paper entitled &#8220;Optimization\/simulation-based risk mitigation in resilient green communication networks&#8221;, authored by Piotr Cho\u0142da and Piotr Jaglarz,\u00a0has been published in\u00a0<a href=\"http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1084804515001721\" target=\"_blank\">Journal of Network and Computer Application<\/a> (by Elsevier) in January 2016.<\/p>\n<p>When using or inspiring by the given configuration files (either changed or not), please properly reference the way you obtained the files, preferably by citing the related paper.<\/p>\n<p>&nbsp;<\/p>\n<h2>Details of the optimization algorithms<\/h2>\n<p>Exact optimization is realized with CPLEX (the problems are written in OPL). The formulations are quite typical for convex programming-based resilient network design with linearization of the concave goal function and it is given in the paper:<\/p>\n<ul>\n<li>Formulation for NR (non-recovery): <a href=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/nr.mod_.pdf\" target=\"_blank\">.MOD file<\/a>.<\/li>\n<li>Network data for the Poland network (PL) for NR: <a href=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/nr.poland.dat_.pdf\" target=\"_blank\">.DAT file<\/a>.<\/li>\n<li>Formulation for DP (dedicated path protection): <a href=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/dp.mod_.pdf\" target=\"_blank\">.MOD file<\/a>.<\/li>\n<li>Formulation for SP (shared backup path protection): <a href=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/sp.mod_.pdf\" target=\"_blank\">.MOD file<\/a>.<\/li>\n<li>Network data for the Poland network (PL) for DP\/SP: <a href=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/dp.sp_.poland.dat_.pdf\" target=\"_blank\">.DAT file<\/a>.<\/li>\n<li>Formulation for DL (dedicated link protection): <a href=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/dl.mod_.pdf\" target=\"_blank\">.MOD file<\/a>.<\/li>\n<li>Formulation for SL (shared backup link protection): <a href=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/sl.mod_.pdf\" target=\"_blank\">.MOD file<\/a>.<\/li>\n<li>Network data for the Poland network (PL) for DL\/SL: <a href=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/dl.sl_.poland.dat_.pdf\" target=\"_blank\">.DAT file<\/a>.<\/li>\n<\/ul>\n<p>MATLAB algorithm uses heuristic based on the modified Yaged&#8217;s approach.<\/p>\n<p><a href=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/Pages-from-JNCA-D-15-00006R1.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-full wp-image-1929\" src=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/Pages-from-JNCA-D-15-00006R1.png\" alt=\"Pages from JNCA-D-15-00006R1\" width=\"1295\" height=\"848\" srcset=\"https:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/Pages-from-JNCA-D-15-00006R1.png 1295w, https:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/Pages-from-JNCA-D-15-00006R1-300x196.png 300w, https:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/Pages-from-JNCA-D-15-00006R1-1024x671.png 1024w, https:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/Pages-from-JNCA-D-15-00006R1-100x65.png 100w\" sizes=\"auto, (max-width: 1295px) 100vw, 1295px\" \/><\/a><\/p>\n<h2>Iterative optimization-simulation algorithm<\/h2>\n<p>We optimized the mixed combination of recovery methods for selected risk mitigation strategies:<\/p>\n<p><a href=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/Pages-from-JNCA-D-15-00006R1-2.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignnone size-full wp-image-1931\" src=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/Pages-from-JNCA-D-15-00006R1-2.png\" alt=\"Pages from JNCA-D-15-00006R1-2\" width=\"879\" height=\"614\" srcset=\"https:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/Pages-from-JNCA-D-15-00006R1-2.png 879w, https:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/Pages-from-JNCA-D-15-00006R1-2-300x210.png 300w, https:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/Pages-from-JNCA-D-15-00006R1-2-100x70.png 100w\" sizes=\"auto, (max-width: 879px) 100vw, 879px\" \/><\/a><\/p>\n<p>Optimization is again realized with CPLEX and Matlab. The formulation is given in the paper. Here you can find the optimization problem in <a href=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/risk-mitigation-iteration.mod_.pdf\" target=\"_blank\">.MOD file<\/a>. The MATLAB files with the whole iterative optimization\/simulation procedure is given here in <a href=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/iterative_algorithm.zip\" target=\"_blank\">.ZIP file<\/a>.<\/p>\n<p>&nbsp;<\/p>\n<h2>Results for various networks<\/h2>\n<p>The paper presents results for the Poland network only. Here, we also present the results for other tested networks retrieved from the <a href=\"http:\/\/sndlib.zib.de\/\" target=\"_blank\">SNDLib library<\/a>:<\/p>\n<ul>\n<li>The Poland network (poland.xml): <a href=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/polska.zip\" target=\"_blank\">.ZIP file<\/a> with figures.<\/li>\n<li>The NOBEL project German network (nobel-germany.xml): <a href=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/nobel-germany.zip\" target=\"_blank\">.ZIP file<\/a> with figures.<\/li>\n<li>The NOBEL project US network (nobel-us.xml):\u00a0<a href=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/nobel-us1.zip\" target=\"_blank\">.ZIP file<\/a> with figures.<\/li>\n<li>The NOBEL project European network (nobel-eu.xml):\u00a0<a href=\"http:\/\/home.agh.edu.pl\/~cholda\/wp-content\/uploads\/2015\/06\/nobel-eu.zip\" target=\"_blank\">.ZIP file<\/a> with figures.<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Publication Here, the information related to our paper presenting the iterative method for energy-efficient optimized design of resilient network with risk-awareness is given. The paper entitled &#8220;Optimization\/simulation-based risk mitigation in resilient green communication networks&#8221;, authored by Piotr Cho\u0142da and Piotr Jaglarz,\u00a0has been published in\u00a0Journal of Network and Computer Application (by Elsevier) in January 2016. When [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":25,"menu_order":102,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"class_list":["post-1918","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/home.agh.edu.pl\/~cholda\/wp-json\/wp\/v2\/pages\/1918","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/home.agh.edu.pl\/~cholda\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/home.agh.edu.pl\/~cholda\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/home.agh.edu.pl\/~cholda\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/home.agh.edu.pl\/~cholda\/wp-json\/wp\/v2\/comments?post=1918"}],"version-history":[{"count":22,"href":"https:\/\/home.agh.edu.pl\/~cholda\/wp-json\/wp\/v2\/pages\/1918\/revisions"}],"predecessor-version":[{"id":2355,"href":"https:\/\/home.agh.edu.pl\/~cholda\/wp-json\/wp\/v2\/pages\/1918\/revisions\/2355"}],"up":[{"embeddable":true,"href":"https:\/\/home.agh.edu.pl\/~cholda\/wp-json\/wp\/v2\/pages\/25"}],"wp:attachment":[{"href":"https:\/\/home.agh.edu.pl\/~cholda\/wp-json\/wp\/v2\/media?parent=1918"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}