Resource Allocation with Vickrey-Dutch Auctioning Game for C-RAN Fronthaul

Doruk Şahinel, S. Rommel, I. Monroy
{"title":"Resource Allocation with Vickrey-Dutch Auctioning Game for C-RAN Fronthaul","authors":"Doruk Şahinel, S. Rommel, I. Monroy","doi":"10.1109/FNWF55208.2022.00110","DOIUrl":null,"url":null,"abstract":"The network slicing concept divides physical networks into logical networks and abstracts the network resources. With the help of virtualization technologies, these abstracted network resources can be allocated to service providers and resources can dynamically be added to these slices based on users' demands. The infrastructure sharing model with slicing makes it possible for services to lease the resources of the infrastructure provider. This study considers optical network resource allocation from a profit generation perspective with a game, in which service providers bid to lease C-RAN fronthaul paths via auctioning with Vickrey-Clarke-Groves outcomes. The game aims to distribute fronthaul resources with a social-welfare maximizing outcome. Service providers maximize their revenue by predicting user demand and requesting bandwidth resources from the infrastructure provider by bidding in the auction. Users have the option to change their association and switch between the service providers to maximize their utility. The results display that a balanced profit and social welfare trade-off can be achieved in converged optical and mmWave radio networks infrastructure sharing scenario with Vickrey-Dutch auctioning and distributed decision-making.","PeriodicalId":300165,"journal":{"name":"2022 IEEE Future Networks World Forum (FNWF)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Future Networks World Forum (FNWF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FNWF55208.2022.00110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The network slicing concept divides physical networks into logical networks and abstracts the network resources. With the help of virtualization technologies, these abstracted network resources can be allocated to service providers and resources can dynamically be added to these slices based on users' demands. The infrastructure sharing model with slicing makes it possible for services to lease the resources of the infrastructure provider. This study considers optical network resource allocation from a profit generation perspective with a game, in which service providers bid to lease C-RAN fronthaul paths via auctioning with Vickrey-Clarke-Groves outcomes. The game aims to distribute fronthaul resources with a social-welfare maximizing outcome. Service providers maximize their revenue by predicting user demand and requesting bandwidth resources from the infrastructure provider by bidding in the auction. Users have the option to change their association and switch between the service providers to maximize their utility. The results display that a balanced profit and social welfare trade-off can be achieved in converged optical and mmWave radio networks infrastructure sharing scenario with Vickrey-Dutch auctioning and distributed decision-making.
基于Vickrey-Dutch拍卖博弈的C-RAN前传资源分配
网络切片概念将物理网络划分为逻辑网络,对网络资源进行抽象。在虚拟化技术的帮助下,这些抽象的网络资源可以分配给服务提供商,并且可以根据用户的需求动态地将资源添加到这些切片中。带有切片的基础设施共享模型使得服务可以租用基础设施提供者的资源。本研究从利润产生的角度考虑光网络资源分配的博弈,其中服务提供商通过拍卖维克里-克拉克-格罗夫斯结果来竞标租用C-RAN前路。该游戏旨在以社会福利最大化的结果分配前传资源。服务提供商通过预测用户需求和通过在拍卖中投标向基础设施提供商请求带宽资源来实现收入最大化。用户可以选择更改其关联并在服务提供者之间切换,以最大化其效用。结果表明,在融合光和毫米波无线网络基础设施共享场景下,采用维克利-荷兰拍卖和分布式决策可以实现利润和社会福利的平衡权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信