{"title":"基于遗传算法的视频服务器布局与流量规划研究","authors":"Long Zhao, Jingxuan Wei, Minghan Li","doi":"10.1109/CIS.2017.00016","DOIUrl":null,"url":null,"abstract":"The paper is about a research on a problem of placing video servers and planning fluxes in an existing network topology, which must meet both the broadband limits and user's needs. For this problem, we build a bilevel mode and design two algorithms, in which the genetic algorithm is used to optimize the upper target and the SPFA minimum cost flow algorithm is used for lower target. Experimental results show that, in a complex network with large nodes and dense links, the proposed algorithm can gain a better server deployment solution in a relatively short period of time.","PeriodicalId":304958,"journal":{"name":"2017 13th International Conference on Computational Intelligence and Security (CIS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Research on Video Server Placement and Flux Plan Based on GA\",\"authors\":\"Long Zhao, Jingxuan Wei, Minghan Li\",\"doi\":\"10.1109/CIS.2017.00016\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper is about a research on a problem of placing video servers and planning fluxes in an existing network topology, which must meet both the broadband limits and user's needs. For this problem, we build a bilevel mode and design two algorithms, in which the genetic algorithm is used to optimize the upper target and the SPFA minimum cost flow algorithm is used for lower target. Experimental results show that, in a complex network with large nodes and dense links, the proposed algorithm can gain a better server deployment solution in a relatively short period of time.\",\"PeriodicalId\":304958,\"journal\":{\"name\":\"2017 13th International Conference on Computational Intelligence and Security (CIS)\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 13th International Conference on Computational Intelligence and Security (CIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.2017.00016\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 13th International Conference on Computational Intelligence and Security (CIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2017.00016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Research on Video Server Placement and Flux Plan Based on GA
The paper is about a research on a problem of placing video servers and planning fluxes in an existing network topology, which must meet both the broadband limits and user's needs. For this problem, we build a bilevel mode and design two algorithms, in which the genetic algorithm is used to optimize the upper target and the SPFA minimum cost flow algorithm is used for lower target. Experimental results show that, in a complex network with large nodes and dense links, the proposed algorithm can gain a better server deployment solution in a relatively short period of time.