{"title":"波长路由光网络中一系列重构模型","authors":"Passakon Prathombutr, J. Stach, E. Park, S. Tak","doi":"10.1109/ICCCN.2004.1401695","DOIUrl":null,"url":null,"abstract":"When a traffic demand is changed, a virtual topology could be reconfigured to serve that traffic and to retain high performance. We purpose a reconfiguration model that minimizes costly changes in a virtual topology and maximizes network performance for a series of reconfigurations in the long term. The model includes the reconfiguration process and the policy. The reconfiguration process finds a set of non-dominated solutions using the multi-objective evolutionary algorithm (MOEA) that optimizes two objectives by using the concept of Pareto optimal. The policy picks a solution from the set of solutions above using the Markov decision process (MDP). A case study based on simulation experiments is conducted to illustrate the application of our model","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Model for series of reconfigurations in wavelength-routed optical networks\",\"authors\":\"Passakon Prathombutr, J. Stach, E. Park, S. Tak\",\"doi\":\"10.1109/ICCCN.2004.1401695\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When a traffic demand is changed, a virtual topology could be reconfigured to serve that traffic and to retain high performance. We purpose a reconfiguration model that minimizes costly changes in a virtual topology and maximizes network performance for a series of reconfigurations in the long term. The model includes the reconfiguration process and the policy. The reconfiguration process finds a set of non-dominated solutions using the multi-objective evolutionary algorithm (MOEA) that optimizes two objectives by using the concept of Pareto optimal. The policy picks a solution from the set of solutions above using the Markov decision process (MDP). A case study based on simulation experiments is conducted to illustrate the application of our model\",\"PeriodicalId\":229045,\"journal\":{\"name\":\"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2004.1401695\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2004.1401695","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Model for series of reconfigurations in wavelength-routed optical networks
When a traffic demand is changed, a virtual topology could be reconfigured to serve that traffic and to retain high performance. We purpose a reconfiguration model that minimizes costly changes in a virtual topology and maximizes network performance for a series of reconfigurations in the long term. The model includes the reconfiguration process and the policy. The reconfiguration process finds a set of non-dominated solutions using the multi-objective evolutionary algorithm (MOEA) that optimizes two objectives by using the concept of Pareto optimal. The policy picks a solution from the set of solutions above using the Markov decision process (MDP). A case study based on simulation experiments is conducted to illustrate the application of our model