{"title":"Dynamic Service Function Chaining by Resource Usage Learning in SDN/NFV Environment","authors":"Sang Il Kim, Hwa-sung Kim","doi":"10.1109/ICOIN.2019.8718190","DOIUrl":null,"url":null,"abstract":"Recently, to reflect diverse service requirements increasing with the popularization of various Internet devices, network functions virtualization (NFV) is attracting attention as the core technology of the next-generation network. In keeping with the progress of NFV, service function chaining (SFC) for specific network service appeared, and SFC refers to a technique for the sequential abstraction of service functions. In connection with the existing study's method for dynamic service chaining that dynamically generates a service chain through reinforcement learning, considering a node, at which service functions operate for efficient service chaining in the NFV environment, and the usage of resources such as CPU, memory, and network usage, this paper investigated a method for more stable dynamic service function chaining by flexibly calculating a fixed weight for the $r$ value, which was derived from an experiment, according to the amount of remaining resources at the relevant node.","PeriodicalId":422041,"journal":{"name":"2019 International Conference on Information Networking (ICOIN)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Information Networking (ICOIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN.2019.8718190","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
Recently, to reflect diverse service requirements increasing with the popularization of various Internet devices, network functions virtualization (NFV) is attracting attention as the core technology of the next-generation network. In keeping with the progress of NFV, service function chaining (SFC) for specific network service appeared, and SFC refers to a technique for the sequential abstraction of service functions. In connection with the existing study's method for dynamic service chaining that dynamically generates a service chain through reinforcement learning, considering a node, at which service functions operate for efficient service chaining in the NFV environment, and the usage of resources such as CPU, memory, and network usage, this paper investigated a method for more stable dynamic service function chaining by flexibly calculating a fixed weight for the $r$ value, which was derived from an experiment, according to the amount of remaining resources at the relevant node.