{"title":"多媒体点播网络中服务器定位与存储分配的遗传算法","authors":"Sun-jin KIm, Mun-kee Choi","doi":"10.1109/TIC.2003.1249094","DOIUrl":null,"url":null,"abstract":"We propose a genetic algorithm (GA) to design a non-hierarchical and decentralized multimedia-on-demand (MOD) network architecture. To optimize the MOD network resource based on cost analysis, including server installation cost, program storage cost, and transmission cost, both server location and storage allocation were considered. In applying the proposed algorithm to the problem considered, many of components are devised to improve solution quality and computational efficiency: genetic representation; evaluation function; genetic operators; procedure. The results of extensive computational simulations showed that the proposed algorithm provides high quality solutions within reasonable computation times.","PeriodicalId":177770,"journal":{"name":"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A genetic algorithm for server location and storage allocation in multimedia-on-demand network\",\"authors\":\"Sun-jin KIm, Mun-kee Choi\",\"doi\":\"10.1109/TIC.2003.1249094\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a genetic algorithm (GA) to design a non-hierarchical and decentralized multimedia-on-demand (MOD) network architecture. To optimize the MOD network resource based on cost analysis, including server installation cost, program storage cost, and transmission cost, both server location and storage allocation were considered. In applying the proposed algorithm to the problem considered, many of components are devised to improve solution quality and computational efficiency: genetic representation; evaluation function; genetic operators; procedure. The results of extensive computational simulations showed that the proposed algorithm provides high quality solutions within reasonable computation times.\",\"PeriodicalId\":177770,\"journal\":{\"name\":\"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TIC.2003.1249094\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SympoTIC'03. Joint 1st Workshop on Mobile Future and Symposium on Trends in Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TIC.2003.1249094","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A genetic algorithm for server location and storage allocation in multimedia-on-demand network
We propose a genetic algorithm (GA) to design a non-hierarchical and decentralized multimedia-on-demand (MOD) network architecture. To optimize the MOD network resource based on cost analysis, including server installation cost, program storage cost, and transmission cost, both server location and storage allocation were considered. In applying the proposed algorithm to the problem considered, many of components are devised to improve solution quality and computational efficiency: genetic representation; evaluation function; genetic operators; procedure. The results of extensive computational simulations showed that the proposed algorithm provides high quality solutions within reasonable computation times.