Distributed Radio Slice Allocation in Wireless Network Virtualization: Matching Theory Meets Auctions

被引:17
作者
Kim, Do Hyeon [1 ]
Kazmi, S. M. Ahsan [1 ,2 ]
Ndikumana, Anselme [1 ,3 ]
Manzoor, Aunas [1 ]
Saad, Walid [1 ,4 ]
Hong, Choong Seon [1 ]
机构
[1] Kyung Hee Univ, Dept Comp Sci & Engn, Yongin 17104, South Korea
[2] Innopolis Univ, Networks & Blockchain Lab, Secure Syst & Network Engn, Innopolis 420500, Russia
[3] Univ Lay Adventists Kigali, Fac Comp & Informat Sci, Kigali, Rwanda
[4] Virginia Tech, Wireless VT Grp, Bradley Dept Elect & Comp Engn, Blacksburg, VA 24061 USA
基金
新加坡国家研究基金会;
关键词
Indium phosphide; III-V semiconductor materials; Resource management; Wireless networks; Games; Virtualization; Matching game; auction; resource allocation; winner determination problem; price determination problem; wireless network virtualization; SMALL-CELL NETWORKS; RESOURCE-ALLOCATION; MILLIMETER-WAVE; GAME; MECHANISMS; MANAGEMENT;
D O I
10.1109/ACCESS.2020.2987753
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Wireless network virtualization has been introduced to satisfy the ever-increasing user requirements through resource sharing, and it can reduce operating costs for the network. Virtualized resources of an infrastructure provider can be allocated as slices to mobile virtual network operators to satisfy their users & x2019; demands. Thus, an efficient resource allocation method is needed. Furthermore, existing works have mostly considered resource allocation methods using one infrastructure provider in the system model. However, in realistic and practical environments, multiple infrastructure providers should be considered so that the mobile virtual network operator can choose the appropriate infrastructure provider to maximize its revenue. Therefore, in this paper, a new approach based on matching theory and auctions is proposed for slice allocation for a system with multiple infrastructure providers. Moreover, a matching algorithm and an auction are utilized to work as the distributed methods for solving the user association problem and slice allocation problem, respectively. To connect these two problems, the user association result is used as an input of the auction model so that the mobile virtual network operator can decide on the appropriate infrastructure provider to submit the bidding value. Simulation results show that the developed solutions achieve stable matching and maximize the social welfare of all bidders.
引用
收藏
页码:73494 / 73507
页数:14
相关论文
共 58 条
  • [1] Spectrum sharing in Multi-Tenant 5G Cellar Networks: Modeling and Planning
    Al-Khatib, Obada
    Hardjawana, Wibowo
    Vucetic, Branka
    [J]. IEEE ACCESS, 2019, 7 : 1602 - 1616
  • [2] [Anonymous], 2015, INT J ENG MANAGE SCI
  • [3] [Anonymous], ARCH FORMAL PROOFS
  • [4] [Anonymous], 2017, P 11 INT C UB INF MA
  • [5] [Anonymous], P INT WIR COMM MOB C
  • [6] [Anonymous], 2004, 3rd international joint Conference on Autonomous Agent and Multi-Agent Systems
  • [7] Network bandwidth allocation via distributed auctions with time reservations
    Belzarena, Pablo
    Ferragut, Andre
    Paganini, Fernando
    [J]. IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, : 2816 - +
  • [8] Blumrosen L, 2007, ALGORITHMIC GAME THEORY, P267
  • [9] In Broker We Trust: A Double-Auction Approach for Resource Allocation in NFV Markets
    Borjigin, Wuyunzhaola
    Ota, Kaoru
    Dong, Mianxiong
    [J]. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2018, 15 (04): : 1322 - 1333
  • [10] Designing Random Allocation Mechanisms: Theory and Applications
    Budish, Eric
    Che, Yeon-Koo
    Kojima, Fuhito
    Milgrom, Paul
    [J]. AMERICAN ECONOMIC REVIEW, 2013, 103 (02) : 585 - 623