{"title":"基于禁忌搜索算法的大规模云网络实时迁移优化设计","authors":"Salah-Eddine Benbrahim, A. Quintero, M. Bellaiche","doi":"10.1109/AMS.2014.47","DOIUrl":null,"url":null,"abstract":"This work, based on the paper [1], presents and develops a tabu search (TS) algorithm for the planning of interdependent virtual machines (VMs) with regards to data exchange deadline concern between their interdependent hosted applications. The main contribution of this research is the use of a tabu search (TS) heuristic to find near-optimal node positions in a virtual network having interdependent VMs and shared resources. This TS is an interesting solution regarding its precision and feasibility for large-sized virtual networks. The results of the TS proposed in this paper show that it is possible to reduce the planning costs of a virtual network while respecting interdependency constraints of its shared and distributed resources.","PeriodicalId":198621,"journal":{"name":"2014 8th Asia Modelling Symposium","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the Design of Large-Sized Cloud Networks Optimized for Live Migration Using Tabu Search Algorithms\",\"authors\":\"Salah-Eddine Benbrahim, A. Quintero, M. Bellaiche\",\"doi\":\"10.1109/AMS.2014.47\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work, based on the paper [1], presents and develops a tabu search (TS) algorithm for the planning of interdependent virtual machines (VMs) with regards to data exchange deadline concern between their interdependent hosted applications. The main contribution of this research is the use of a tabu search (TS) heuristic to find near-optimal node positions in a virtual network having interdependent VMs and shared resources. This TS is an interesting solution regarding its precision and feasibility for large-sized virtual networks. The results of the TS proposed in this paper show that it is possible to reduce the planning costs of a virtual network while respecting interdependency constraints of its shared and distributed resources.\",\"PeriodicalId\":198621,\"journal\":{\"name\":\"2014 8th Asia Modelling Symposium\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 8th Asia Modelling Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AMS.2014.47\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 8th Asia Modelling Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AMS.2014.47","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Design of Large-Sized Cloud Networks Optimized for Live Migration Using Tabu Search Algorithms
This work, based on the paper [1], presents and develops a tabu search (TS) algorithm for the planning of interdependent virtual machines (VMs) with regards to data exchange deadline concern between their interdependent hosted applications. The main contribution of this research is the use of a tabu search (TS) heuristic to find near-optimal node positions in a virtual network having interdependent VMs and shared resources. This TS is an interesting solution regarding its precision and feasibility for large-sized virtual networks. The results of the TS proposed in this paper show that it is possible to reduce the planning costs of a virtual network while respecting interdependency constraints of its shared and distributed resources.