In Broker We Trust: A Double-Auction Approach for Resource Allocation in NFV Markets

被引:44
作者
Borjigin, Wuyunzhaola [1 ]
Ota, Kaoru [1 ]
Dong, Mianxiong [1 ]
机构
[1] Muroran Inst Technol, Dept Informat & Elect Engn, Muroran, Hokkaido 0608585, Japan
来源
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT | 2018年 / 15卷 / 04期
关键词
Network function virtualization (NFV); double auction; virtualized network function (VNF); service function chain (SFC); resource allocation; ACCESS; VIRTUALIZATION; SDN;
D O I
10.1109/TNSM.2018.2882535
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Network function virtualization (NFV) is an emerging scheme to provide virtualized network function services for next-generation networks. However, finding an efficient way to distribute different resources to customers is difficult. In this paper, we develop a new double-auction approach named DARA that is used for both service function chain routing and NFV price adjustment to maximize the profits of all participants. To the best of our knowledge, this is the first work to adopt a double-auction strategy in this area. The objective of the proposed approach is to maximize the profits of three types of participants: 1) NFV broker; 2) customers; and 3) service providers. Moreover, we prove that the approach is a weakly dominant strategy in a given NFV market by finding the Bayesian Nash equilibrium in the double-auction game. Finally, according to the results of the performance evaluation, our approach outperforms the single-auction mechanism with higher profits for the three types of participants in the given NFV market.
引用
收藏
页码:1322 / 1333
页数:12
相关论文
共 51 条
[1]   SODA: Strategy-Proof Online Double Auction Scheme for Multimicrogrids Bidding [J].
An, Dou ;
Yang, Qingyu ;
Yu, Wei ;
Yang, Xinyu ;
Fu, Xinwen ;
Zhao, Wei .
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2018, 48 (07) :1177-1190
[2]  
[Anonymous], FRAM NETW VIRT FUT N
[3]  
[Anonymous], IEEE T SYST MAN CYBE
[4]  
[Anonymous], IEEE T CLOUD COMPUT
[5]  
[Anonymous], CISC NFV SOL EN RAP
[6]  
[Anonymous], 2014, P EUR C OPT COMM EC
[7]  
[Anonymous], 2010, ADV M C M
[8]  
[Anonymous], SERVICE FUNCTION CHA
[9]  
[Anonymous], IEEE T NETW SERVICE
[10]  
[Anonymous], 2015, P IEEE GLOBECOM