{"title":"高效的路径分割虚拟网络嵌入","authors":"Xiaohua Chen, Chunzhi Li","doi":"10.1109/APNOMS.2014.6996550","DOIUrl":null,"url":null,"abstract":"Multicommodity flow-based virtual network embedding algorithm does not consider link energy, which causes waste of energy. And its high time complexity can not meet real-time requirements of online virtual network embedding. In this paper, we find the dynamic inversion phenomenon, where revenue does not rely on embedding cost. Two novel link mapping algorithms are proposed for path splitting which based on the undirected network minimum cost flow. They enable link resource to consolidate and have low time complexity. Simulation results show that proposed algorithms reduce energy consumption and ensure real-time performance of online VN embedding.","PeriodicalId":269952,"journal":{"name":"The 16th Asia-Pacific Network Operations and Management Symposium","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Energy efficient virtual network embedding for path splitting\",\"authors\":\"Xiaohua Chen, Chunzhi Li\",\"doi\":\"10.1109/APNOMS.2014.6996550\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multicommodity flow-based virtual network embedding algorithm does not consider link energy, which causes waste of energy. And its high time complexity can not meet real-time requirements of online virtual network embedding. In this paper, we find the dynamic inversion phenomenon, where revenue does not rely on embedding cost. Two novel link mapping algorithms are proposed for path splitting which based on the undirected network minimum cost flow. They enable link resource to consolidate and have low time complexity. Simulation results show that proposed algorithms reduce energy consumption and ensure real-time performance of online VN embedding.\",\"PeriodicalId\":269952,\"journal\":{\"name\":\"The 16th Asia-Pacific Network Operations and Management Symposium\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 16th Asia-Pacific Network Operations and Management Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APNOMS.2014.6996550\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 16th Asia-Pacific Network Operations and Management Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APNOMS.2014.6996550","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Energy efficient virtual network embedding for path splitting
Multicommodity flow-based virtual network embedding algorithm does not consider link energy, which causes waste of energy. And its high time complexity can not meet real-time requirements of online virtual network embedding. In this paper, we find the dynamic inversion phenomenon, where revenue does not rely on embedding cost. Two novel link mapping algorithms are proposed for path splitting which based on the undirected network minimum cost flow. They enable link resource to consolidate and have low time complexity. Simulation results show that proposed algorithms reduce energy consumption and ensure real-time performance of online VN embedding.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
