{"title":"基于蚁群优化的网络迁移","authors":"Stefan Türk, R. Radeke, R. Lehnert","doi":"10.1109/CTTE.2010.5557713","DOIUrl":null,"url":null,"abstract":"This paper describes the basic concepts of the network migration problem, as well as its cost optimal solution with an ant colony algorithm. Generally there are many possible approaches to calculate network migration strategies. One of those is to consider the migration as a Shortest Path Problem, which can be solved using meta heuristics. In this paper it will be analyzed how ant colony optimization can be used to calculate migration sequences with minimized costs. Results of our investigation are information about the speed of convergence of ant colony algorithms towards an optimal cost value. The used resource utilization to cover increasing network demands will be presented also.","PeriodicalId":269841,"journal":{"name":"2010 9th Conference of Telecommunication, Media and Internet","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Network migration using ant colony optimization\",\"authors\":\"Stefan Türk, R. Radeke, R. Lehnert\",\"doi\":\"10.1109/CTTE.2010.5557713\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes the basic concepts of the network migration problem, as well as its cost optimal solution with an ant colony algorithm. Generally there are many possible approaches to calculate network migration strategies. One of those is to consider the migration as a Shortest Path Problem, which can be solved using meta heuristics. In this paper it will be analyzed how ant colony optimization can be used to calculate migration sequences with minimized costs. Results of our investigation are information about the speed of convergence of ant colony algorithms towards an optimal cost value. The used resource utilization to cover increasing network demands will be presented also.\",\"PeriodicalId\":269841,\"journal\":{\"name\":\"2010 9th Conference of Telecommunication, Media and Internet\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 9th Conference of Telecommunication, Media and Internet\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CTTE.2010.5557713\",\"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 9th Conference of Telecommunication, Media and Internet","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CTTE.2010.5557713","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper describes the basic concepts of the network migration problem, as well as its cost optimal solution with an ant colony algorithm. Generally there are many possible approaches to calculate network migration strategies. One of those is to consider the migration as a Shortest Path Problem, which can be solved using meta heuristics. In this paper it will be analyzed how ant colony optimization can be used to calculate migration sequences with minimized costs. Results of our investigation are information about the speed of convergence of ant colony algorithms towards an optimal cost value. The used resource utilization to cover increasing network demands will be presented also.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
