{"title":"一种能量感知的NFV业务功能链和重构算法","authors":"S. Kim, Yunjung Han, Sungyong Park","doi":"10.1109/FAS-W.2016.24","DOIUrl":null,"url":null,"abstract":"With the advances of network function virtualization (NFV) and cloud computing technologies, a number of network services are implemented across data centers by chaining different virtual network functions (VNFs) running on virtual machines. Since these VNFs consume a large amount of resources and power from underlying physical machines, the service function chaining (SFC) algorithm should be carefully designed in order to meet the QoS requirements of users and minimize the power consumptions. This paper proposes an energy-aware SFC algorithm that allows users to meet their service latency requirements, while minimizing the energy consumption at the same time. The proposed algorithm is also dynamic in a sense that the SFC path can be reconfigured when the energy consumption of idle servers exceeds a pre-defined threshold of the total energy consumption. We use genetic algorithm (GA) to formulate this problem because it is a variation of the multi-constrained path selection problem known as NP-complete. The benchmarking results show that the proposed approach outperforms other existing studies by as much as 13.4% and reduces both the idle and overall energy consumptions by reconfiguring SFC path.","PeriodicalId":382778,"journal":{"name":"2016 IEEE 1st International Workshops on Foundations and Applications of Self* Systems (FAS*W)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"An Energy-Aware Service Function Chaining and Reconfiguration Algorithm in NFV\",\"authors\":\"S. Kim, Yunjung Han, Sungyong Park\",\"doi\":\"10.1109/FAS-W.2016.24\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the advances of network function virtualization (NFV) and cloud computing technologies, a number of network services are implemented across data centers by chaining different virtual network functions (VNFs) running on virtual machines. Since these VNFs consume a large amount of resources and power from underlying physical machines, the service function chaining (SFC) algorithm should be carefully designed in order to meet the QoS requirements of users and minimize the power consumptions. This paper proposes an energy-aware SFC algorithm that allows users to meet their service latency requirements, while minimizing the energy consumption at the same time. The proposed algorithm is also dynamic in a sense that the SFC path can be reconfigured when the energy consumption of idle servers exceeds a pre-defined threshold of the total energy consumption. We use genetic algorithm (GA) to formulate this problem because it is a variation of the multi-constrained path selection problem known as NP-complete. The benchmarking results show that the proposed approach outperforms other existing studies by as much as 13.4% and reduces both the idle and overall energy consumptions by reconfiguring SFC path.\",\"PeriodicalId\":382778,\"journal\":{\"name\":\"2016 IEEE 1st International Workshops on Foundations and Applications of Self* Systems (FAS*W)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 1st International Workshops on Foundations and Applications of Self* Systems (FAS*W)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FAS-W.2016.24\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 1st International Workshops on Foundations and Applications of Self* Systems (FAS*W)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FAS-W.2016.24","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21
摘要
随着网络功能虚拟化(network function virtualization, NFV)和云计算技术的发展,许多网络服务通过将运行在虚拟机上的不同虚拟网络功能(virtual network functions, VNFs)链接在一起,跨数据中心实现。由于这些VNFs消耗了底层物理机的大量资源和功耗,因此需要仔细设计SFC (service function chains)算法,以满足用户对QoS的要求,并将功耗降到最低。本文提出了一种能量感知的SFC算法,在满足用户服务延迟需求的同时,使能耗最小化。所提出的算法在某种意义上也是动态的,当空闲服务器的能耗超过预定义的总能耗阈值时,可以重新配置SFC路径。我们使用遗传算法(GA)来表述这个问题,因为它是被称为np完全的多约束路径选择问题的一个变体。基准测试结果表明,所提出的方法比其他现有研究高出13.4%,并且通过重新配置SFC路径减少了闲置和总能耗。
An Energy-Aware Service Function Chaining and Reconfiguration Algorithm in NFV
With the advances of network function virtualization (NFV) and cloud computing technologies, a number of network services are implemented across data centers by chaining different virtual network functions (VNFs) running on virtual machines. Since these VNFs consume a large amount of resources and power from underlying physical machines, the service function chaining (SFC) algorithm should be carefully designed in order to meet the QoS requirements of users and minimize the power consumptions. This paper proposes an energy-aware SFC algorithm that allows users to meet their service latency requirements, while minimizing the energy consumption at the same time. The proposed algorithm is also dynamic in a sense that the SFC path can be reconfigured when the energy consumption of idle servers exceeds a pre-defined threshold of the total energy consumption. We use genetic algorithm (GA) to formulate this problem because it is a variation of the multi-constrained path selection problem known as NP-complete. The benchmarking results show that the proposed approach outperforms other existing studies by as much as 13.4% and reduces both the idle and overall energy consumptions by reconfiguring SFC path.