基于遗传算法的SDN最优路由路径计算

{"title":"基于遗传算法的SDN最优路由路径计算","authors":"M. Han, Dept. Information","doi":"10.21742/IJHIT.2018.11.3.02","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":170772,"journal":{"name":"International Journal of Hybrid Information Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimal Routing Path Calculation for SDN using Genetic Algorithm\",\"authors\":\"M. Han, Dept. Information\",\"doi\":\"10.21742/IJHIT.2018.11.3.02\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":170772,\"journal\":{\"name\":\"International Journal of Hybrid Information Technology\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Hybrid Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.21742/IJHIT.2018.11.3.02\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Hybrid Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21742/IJHIT.2018.11.3.02","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}