Show simple item record

dc.contributor.authorLiang, J
dc.contributor.authorHuang, S
dc.contributor.authorQiu, Y
dc.contributor.authorLiu, L
dc.contributor.authorAziz, F
dc.contributor.authorChen, M
dc.date.accessioned2024-07-03T14:22:10Z
dc.date.issued2024-04-23
dc.date.updated2024-07-03T11:35:24Z
dc.description.abstractGreen Mobile Edge Networks (GMENs) are emerging networks that harvest green energy for powering mobile edge nodes, thereby reducing carbon dioxide emissions and energy costs. In GMENs, network service providers can flexibly place multiple virtual network functions (VNFs) that form a service function chain (SFC) in a specific order on geographically distributed edge nodes based on the level of harvested green energy, providing customized and sustainable network services for users. To meet the diversified availability requirements of users, backup SFCs need to be provided in addition to the primary SFC. These backup SFCs can be activated for providing uninterrupted services when the primary SFC is unavailable. However, due to the dynamic nature of wireless communication links, the uncertainty and unpredictability of green energy, and the limited resources available at edge nodes, optimizing the VNF placement and route traffic in real-time is challenging to minimize energy costs of all nodes and form expected SFCs with higher availability than user demand value. In this paper, the above problem is first formulated as an integer nonlinear programming and proven to be NP-hard. Then, it is discretized into a sequence of one-slot optimization problems to handle real-time changes in green energy and link availability. Finally, an online approximation strategy with a constant approximation ratio is proposed to solve the one-slot problems in polynomial time. This is the first study into online link availability-aware VNF placement and traffic routing problems in GMENs, motivated by sustainability concerns. The evaluation results indicate that the proposed scheme can ensure service availability while reducing the energy costs of all edge nodes and has achieved better performance when compared with other state-of-the-art methods.en_GB
dc.description.sponsorshipNational Natural Science Foundation of China
dc.description.sponsorshipChina Scholarship Council
dc.identifier.citationPublished online 23 April 2024en_GB
dc.identifier.doihttps://doi.org/10.1109/tgcn.2024.3392813
dc.identifier.grantnumber62362005
dc.identifier.grantnumber202206665001
dc.identifier.urihttp://hdl.handle.net/10871/136564
dc.language.isoenen_GB
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_GB
dc.rights© 2024, IEEEen_GB
dc.subjectMobile edge networken_GB
dc.subjectnetwork function virtualizationen_GB
dc.subjectservice function chainingen_GB
dc.subjectplacementen_GB
dc.subjectroutingen_GB
dc.subjectgreen energy harvestingen_GB
dc.subjectavailabilityen_GB
dc.titleSustainable virtual network function placement and traffic routing for Green Mobile Edge Networksen_GB
dc.typeArticleen_GB
dc.date.available2024-07-03T14:22:10Z
dc.identifier.issn2473-2400
dc.descriptionThis is the author accepted manuscript. The final version is available from IEEE via the DOI in this record en_GB
dc.identifier.journalIEEE Transactions on Green Communications and Networkingen_GB
dc.rights.urihttp://www.rioxx.net/licenses/all-rights-reserveden_GB
rioxxterms.versionAMen_GB
rioxxterms.licenseref.startdate2024-04-23
rioxxterms.typeJournal Article/Reviewen_GB
refterms.dateFCD2024-07-03T14:15:54Z
refterms.versionFCDAM
refterms.dateFOA2024-07-03T14:22:19Z
refterms.panelBen_GB
refterms.dateFirstOnline2024-04-23


Files in this item

This item appears in the following Collection(s)

Show simple item record