Differentially Private and Truthful Reverse Auction With Dynamic Resource Provisioning for VNFI Procurement in NFV Markets

IF 5 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Cloud Computing Pub Date : 2024-12-26 DOI:10.1109/TCC.2024.3522963
Xueyi Wang;Xingwei Wang;Zhitong Wang;Rongfei Zeng;Ruiyun Yu;Qiang He;Min Huang
{"title":"Differentially Private and Truthful Reverse Auction With Dynamic Resource Provisioning for VNFI Procurement in NFV Markets","authors":"Xueyi Wang;Xingwei Wang;Zhitong Wang;Rongfei Zeng;Ruiyun Yu;Qiang He;Min Huang","doi":"10.1109/TCC.2024.3522963","DOIUrl":null,"url":null,"abstract":"With the advent of network function virtualization (NFV), many users resort to network service provisioning through virtual network function instances (VNFIs) run on the standard physical server in clouds. Following this trend, NFV markets are emerging, which allow a user to procure VNFIs from cloud service providers (CSPs). In such procurement process, it is a significant challenge to ensure differential privacy and truthfulness while explicitly considering dynamic resource provisioning, location sensitiveness and budget of each VNFI. As such, we design a differentially private and truthful reverse auction with dynamic resource provisioning (PTRA-DRP) to resolve the VNFI procurement (VNFIP) problem. To allow dynamic resource provisioning, PTRA-DRP enables CSPs to submit a set of bids and accept as many as possible, and decides the provisioning VNFIs based on the auction outcomes. To be specific, we first devise a greedy heuristic approach to select the set of the winning bids in a differentially privacy-preserving manner. Next, we design a pricing strategy to compute the charges of CSPs, aiming to guarantee truthfulness. Strict theoretical analysis proves that PTRA-DRP can ensure differential privacy, truthfulness, individual rationality, computational efficiency and approximate social cost minimization. Extensive simulations also demonstrate the effectiveness and efficiency of PTRA-DRP.","PeriodicalId":13202,"journal":{"name":"IEEE Transactions on Cloud Computing","volume":"13 1","pages":"259-272"},"PeriodicalIF":5.0000,"publicationDate":"2024-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cloud Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10816519/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

With the advent of network function virtualization (NFV), many users resort to network service provisioning through virtual network function instances (VNFIs) run on the standard physical server in clouds. Following this trend, NFV markets are emerging, which allow a user to procure VNFIs from cloud service providers (CSPs). In such procurement process, it is a significant challenge to ensure differential privacy and truthfulness while explicitly considering dynamic resource provisioning, location sensitiveness and budget of each VNFI. As such, we design a differentially private and truthful reverse auction with dynamic resource provisioning (PTRA-DRP) to resolve the VNFI procurement (VNFIP) problem. To allow dynamic resource provisioning, PTRA-DRP enables CSPs to submit a set of bids and accept as many as possible, and decides the provisioning VNFIs based on the auction outcomes. To be specific, we first devise a greedy heuristic approach to select the set of the winning bids in a differentially privacy-preserving manner. Next, we design a pricing strategy to compute the charges of CSPs, aiming to guarantee truthfulness. Strict theoretical analysis proves that PTRA-DRP can ensure differential privacy, truthfulness, individual rationality, computational efficiency and approximate social cost minimization. Extensive simulations also demonstrate the effectiveness and efficiency of PTRA-DRP.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
NFV市场中具有动态资源配置的差异化私有真实反向拍卖
随着网络功能虚拟化(NFV)的出现,许多用户通过在云中的标准物理服务器上运行的虚拟网络功能实例(VNFIs)来提供网络服务。随着这一趋势,NFV市场正在兴起,允许用户从云服务提供商(csp)那里购买vnfi。在这种采购过程中,在明确考虑每个VNFI的动态资源供应、位置敏感性和预算的同时,确保不同的隐私性和真实性是一个重大挑战。因此,我们设计了一种具有动态资源配置(PTRA-DRP)的不同隐私和真实的反向拍卖来解决VNFI采购(VNFIP)问题。为了实现动态资源供应,PTRA-DRP使csp能够提交一组投标并接受尽可能多的投标,并根据拍卖结果决定供应的vnfi。具体而言,我们首先设计了一种贪婪启发式方法,以差分隐私保护的方式选择中标集。其次,我们设计了一种定价策略来计算csp的费用,以保证其真实性。严格的理论分析证明,PTRA-DRP能够保证差异隐私性、真实性、个体合理性、计算效率和近似的社会成本最小化。大量的仿真也证明了PTRA-DRP算法的有效性和高效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Cloud Computing
IEEE Transactions on Cloud Computing Computer Science-Software
CiteScore
9.40
自引率
6.20%
发文量
167
期刊介绍: The IEEE Transactions on Cloud Computing (TCC) is dedicated to the multidisciplinary field of cloud computing. It is committed to the publication of articles that present innovative research ideas, application results, and case studies in cloud computing, focusing on key technical issues related to theory, algorithms, systems, applications, and performance.
期刊最新文献
Smart-to-Compress: A Predictive and Game-Theoretic Framework for Data Reduction Decisions Side Channel Attacks on Resource-Constrained Devices Enabled Through Secure Cloud Outsourcing Security Weaknesses of a Lightweight Privacy-Preserving Edge Computing Based Ciphertext Retrieval Scheme Real-Time Adaptive Workflow Scheduling With Graph Learning and Transformer-Driven Reinforcement in Heterogeneous Clouds Transfer Learning-Enabled System for Drone Medicine Delivery Based on Spatio-Temporal Remote Sensing Data in Edge Cloud Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1