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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
