{"title":"基于NSGA-II的互联网流量工程流路径选择","authors":"El-Sayed M. El-Alfy","doi":"10.1109/ICTEL.2010.5478839","DOIUrl":null,"url":null,"abstract":"Traffic engineering has become an important issue in Internet operation due to the fast growing of the Internet traffic and the stringent requirements of quality-of-service over the limited available resources. This problem is a multicriteria optimization problem in nature and our goal in this paper is to explore the application of NSGA-II, an evolutionary algorithm for multiobjective optimization, for determining the optimal distribution of traffic demands over the network. The problem is first formulated as a multiobjective constrained optimization problem which is NP-hard. Then, a hybrid heuristic algorithm based on of linear programming and NSGA-II is developed for approximating the optimal Pareto front. We compare the performance of the proposed heuristic using a 10-node problem adopted from the literature with the exact solutions generated using a lexicographic Chebyshev method.","PeriodicalId":208094,"journal":{"name":"2010 17th International Conference on Telecommunications","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Flow-based path selection for Internet traffic engineering with NSGA-II\",\"authors\":\"El-Sayed M. El-Alfy\",\"doi\":\"10.1109/ICTEL.2010.5478839\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traffic engineering has become an important issue in Internet operation due to the fast growing of the Internet traffic and the stringent requirements of quality-of-service over the limited available resources. This problem is a multicriteria optimization problem in nature and our goal in this paper is to explore the application of NSGA-II, an evolutionary algorithm for multiobjective optimization, for determining the optimal distribution of traffic demands over the network. The problem is first formulated as a multiobjective constrained optimization problem which is NP-hard. Then, a hybrid heuristic algorithm based on of linear programming and NSGA-II is developed for approximating the optimal Pareto front. We compare the performance of the proposed heuristic using a 10-node problem adopted from the literature with the exact solutions generated using a lexicographic Chebyshev method.\",\"PeriodicalId\":208094,\"journal\":{\"name\":\"2010 17th International Conference on Telecommunications\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 17th International Conference on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTEL.2010.5478839\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 17th International Conference on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTEL.2010.5478839","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Flow-based path selection for Internet traffic engineering with NSGA-II
Traffic engineering has become an important issue in Internet operation due to the fast growing of the Internet traffic and the stringent requirements of quality-of-service over the limited available resources. This problem is a multicriteria optimization problem in nature and our goal in this paper is to explore the application of NSGA-II, an evolutionary algorithm for multiobjective optimization, for determining the optimal distribution of traffic demands over the network. The problem is first formulated as a multiobjective constrained optimization problem which is NP-hard. Then, a hybrid heuristic algorithm based on of linear programming and NSGA-II is developed for approximating the optimal Pareto front. We compare the performance of the proposed heuristic using a 10-node problem adopted from the literature with the exact solutions generated using a lexicographic Chebyshev method.