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

被引:0
作者
Wang, Xueyi [1 ]
Wang, Xingwei [2 ]
Wang, Zhitong [2 ]
Zeng, Rongfei [1 ]
Yu, Ruiyun [1 ]
He, Qiang [3 ]
Huang, Min [4 ]
机构
[1] Northeastern Univ, Coll Software, Shenyang 110819, Peoples R China
[2] Northeastern Univ, Coll Comp Sci & Engn, Shenyang 110819, Peoples R China
[3] Northeastern Univ, Coll Med & Biol Informat Engn, Shenyang 110819, Peoples R China
[4] Northeastern Univ, Coll Informat Sci & Engn, Shenyang 110819, Peoples R China
基金
中国国家自然科学基金; 国家重点研发计划;
关键词
Costs; Cloud computing; Procurement; Privacy; Dynamic scheduling; Vectors; Computational modeling; Virtualization; Minimization; Differential privacy; Network function virtualization; virtual network function; reverse auction; differential privacy; truthfulness; NETWORK; ALLOCATION; PLACEMENT;
D O I
10.1109/TCC.2024.3522963
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:259 / 272
页数:14
相关论文
共 52 条
[1]  
[Anonymous], 2011, Google Cluster Data V2, V2
[2]  
Archer A, 2001, ANN IEEE SYMP FOUND, P482
[3]   A genetic algorithm for the set covering problem [J].
Beasley, JE ;
Chu, PC .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 94 (02) :392-404
[4]   FENDE: Marketplace-Based Distribution, Execution, and Life Cycle Management of VNFs [J].
Bondan, Lucas ;
Franco, Muriel F. ;
Marcuzzo, Leonardo ;
Venancio, Giovanni ;
Santos, Ricardo L. ;
Pfitscher, Ricardo J. ;
Scheid, Eder J. ;
Stiller, Burkhard ;
De Turck, Filip ;
Duarte, Elias P., Jr. ;
Schaeffer-Filho, Alberto E. ;
dos Santos, Carlos R. P. ;
Granville, Lisandro Z. .
IEEE COMMUNICATIONS MAGAZINE, 2019, 57 (01) :13-19
[5]   Multiple-Walrasian Auction Mechanism for Tree Valuation Service in NFV Market [J].
Borjigin, Wuyunzhaola ;
Ota, Kaoru ;
Dong, Mianxiong .
IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2023, 10 (01) :61-71
[6]   In Broker We Trust: A Double-Auction Approach for Resource Allocation in NFV Markets [J].
Borjigin, Wuyunzhaola ;
Ota, Kaoru ;
Dong, Mianxiong .
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2018, 15 (04) :1322-1333
[7]   Differentially Private Double Spectrum Auction With Approximate Social Welfare Maximization [J].
Chen, Zhili ;
Ni, Tianjiao ;
Zhong, Hong ;
Zhang, Shun ;
Cui, Jie .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2019, 14 (11) :2805-2818
[8]  
Fei XC, 2017, 2017 IEEE/ACM 25TH INTERNATIONAL SYMPOSIUM ON QUALITY OF SERVICE (IWQOS)
[9]   Paving the Way for NFV Acceleration: A Taxonomy, Survey and Future Directions [J].
Fei, Xincai ;
Liu, Fangming ;
Zhang, Qixia ;
Jin, Hai ;
Hu, Hongxin .
ACM COMPUTING SURVEYS, 2020, 53 (04)
[10]   Virtual Network Functions Routing and Placement for Edge Cloud Latency Minimization [J].
Gouareb, Racha ;
Friderikos, Vasilis ;
Aghvami, Abdol-Hamid .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2018, 36 (10) :2346-2357