Show simple item record

dc.contributor.authorFu, Z
dc.contributor.authorFan, Q
dc.contributor.authorZhang, X
dc.contributor.authorLi, X
dc.contributor.authorWang, S
dc.contributor.authorWang, Y
dc.date.accessioned2021-07-26T06:53:33Z
dc.date.issued2022-03-09
dc.description.abstractNetwork function virtualization (NFV) simplifies the configuration and management of security services by migrating the network security functions from dedicated hardware devices to software middle-boxes that run on commodity servers. Under the paradigm of NFV, the service function chain (SFC) consisting of a series of ordered virtual network security functions is becoming a mainstream form to carry network security services. Allocating the underlying physical network resources to the demands of SFCs under given constraints over time is known as the SFC deployment problem. It is a crucial issue for infrastructure providers. However, SFC deployment is facing new challenges in trading off between pursuing the objective of high revenue-to-cost ratio and making decisions in an online manner. In this paper, we investigate the use of reinforcement learning to guide online deployment decisions for SFC requests and propose a Policy network Assisted Monte Carlo Tree search approach named PACT to address the above challenge, aiming to maximize the average revenue-to-cost ratio. PACT combines the strengths of the policy network, which evaluates the placement potential of physical servers and the Monte Carlo Tree Search, which is able to tackle problems with large state spaces. Extensive experimental results demonstrate that our PACT achieves the best performance and superior to other algorithms by up to 30% and 23.8% on average revenue-to-cost ratio and acceptance rate, respectivelyen_GB
dc.description.sponsorshipMajor Special Program for Technical Innovation & Application Development of Chongqing Science & Technology Commissionen_GB
dc.description.sponsorshipNational NSFCen_GB
dc.description.sponsorshipChongqing Research Program of Basic Research and Frontier Technologyen_GB
dc.description.sponsorshipNatural Science Foundation of Jiangsuen_GB
dc.description.sponsorshipLeading Technology of Jiangsu Basic Research Planen_GB
dc.description.sponsorshipEuropean Union Horizon 2020en_GB
dc.identifier.citationTrustCom 2021: 20th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, 20 - 22 October 2021, Shenyang, Chinaen_GB
dc.identifier.doi10.1109/TrustCom53373.2021.00157
dc.identifier.grantnumberCSTC 2019jscxzdztzxX0031en_GB
dc.identifier.grantnumber61902044en_GB
dc.identifier.grantnumber62072060en_GB
dc.identifier.grantnumber61902178en_GB
dc.identifier.grantnumber62002035en_GB
dc.identifier.grantnumbercstc2019jcyj-msxmX0589en_GB
dc.identifier.grantnumbercstc2018jcyjAX0340en_GB
dc.identifier.grantnumberBK20190295en_GB
dc.identifier.grantnumberBK2019200en_GB
dc.identifier.grantnumberBK2019200en_GB
dc.identifier.urihttp://hdl.handle.net/10871/126527
dc.language.isoenen_GB
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_GB
dc.rights© 2021 IEEEen_GB
dc.subjectPrivacy
dc.subjectMonte Carlo methods
dc.subjectService function chaining
dc.subjectService function chaining
dc.subjectReinforcement learning
dc.subjectNetwork security
dc.subjectSearch problems
dc.subjectSoftware
dc.subjectService Function Chain
dc.subjectVirtual Network Function
dc.subjectMonte Carlo Tree Search
dc.titlePolicy network assisted Monte Carlo Tree search for intelligent service function chain deploymenten_GB
dc.typeConference paperen_GB
dc.date.available2021-07-26T06:53:33Z
dc.descriptionThis is the author accepted manuscript. The final version is available from IEEE via the DOI in this recorden_GB
dc.rights.urihttp://www.rioxx.net/licenses/all-rights-reserveden_GB
dcterms.dateAccepted2021-06-07
rioxxterms.versionAMen_GB
rioxxterms.licenseref.startdate2021-06-07
rioxxterms.typeConference Paper/Proceeding/Abstracten_GB
refterms.dateFCD2021-07-22T12:30:02Z
refterms.versionFCDAM
refterms.dateFOA2022-03-25T13:48:31Z
refterms.panelBen_GB


Files in this item

This item appears in the following Collection(s)

Show simple item record