Flexible Resource Allocation in 5G Ultra Dense Network with Self-Backhaul

Peng Hao, Xiao Yan, Jian Li, Yu-Ngok Ruyue Li, Huaming Wu
{"title":"Flexible Resource Allocation in 5G Ultra Dense Network with Self-Backhaul","authors":"Peng Hao, Xiao Yan, Jian Li, Yu-Ngok Ruyue Li, Huaming Wu","doi":"10.1109/GLOCOMW.2015.7414218","DOIUrl":null,"url":null,"abstract":"Self-backhaul is flexible and cost efficient for ultra dense network (UDN) since it provides backhaul using the same wireless technology as access link. Content prediction and caching can lower the load on backhaul and improve user experience. Therefore, an algorithm named tri-stage fairness (TSF) is proposed to solve the resource allocation problem in UDN with self-backhaul and caching, in which cells without direct network connection (rTP) access core network through donor TP (dTP). In TSF, rTP determines to transmit files cached in rTP (rTP files) or the files not cached in rTP (dTP files) according to delay and link capacity, and allocate access link resource using proportional fairness algorithm. dTP allocates backhaul resource among its users and rTPs with fairness considerations, and decides the time each rTP spends on backhaul link. Fairness, efficiency, overhead and complexity are jointly considered in TSF. To facilitate system level simulation, a traffic model considering the influence of caching is also introduced. Simulation results suggest flexible resource allocation between access and backhaul link yield substantial performance gain.","PeriodicalId":315934,"journal":{"name":"2015 IEEE Globecom Workshops (GC Wkshps)","volume":"50 6","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE Globecom Workshops (GC Wkshps)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOMW.2015.7414218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

Abstract

Self-backhaul is flexible and cost efficient for ultra dense network (UDN) since it provides backhaul using the same wireless technology as access link. Content prediction and caching can lower the load on backhaul and improve user experience. Therefore, an algorithm named tri-stage fairness (TSF) is proposed to solve the resource allocation problem in UDN with self-backhaul and caching, in which cells without direct network connection (rTP) access core network through donor TP (dTP). In TSF, rTP determines to transmit files cached in rTP (rTP files) or the files not cached in rTP (dTP files) according to delay and link capacity, and allocate access link resource using proportional fairness algorithm. dTP allocates backhaul resource among its users and rTPs with fairness considerations, and decides the time each rTP spends on backhaul link. Fairness, efficiency, overhead and complexity are jointly considered in TSF. To facilitate system level simulation, a traffic model considering the influence of caching is also introduced. Simulation results suggest flexible resource allocation between access and backhaul link yield substantial performance gain.
基于自回程的5G超密集网络中的灵活资源分配
自回程采用与接入链路相同的无线技术提供回程,对于超密集网络(UDN)具有灵活性和成本效益。内容预测和缓存可以降低回程负载并改善用户体验。为此,提出了一种三阶段公平性算法(TSF)来解决具有自回程和缓存的UDN中的资源分配问题,其中没有直接网络连接(rTP)的单元通过dTP (donor TP)访问核心网。在TSF中,rTP根据时延和链路容量决定传输缓存在rTP中的文件(rTP文件)还是未缓存在rTP中的文件(dTP文件),并使用比例公平算法分配接入链路资源。dTP在用户和rTP之间公平分配回程资源,并决定每个rTP在回程链路上花费的时间。TSF综合考虑了公平性、效率、开销和复杂性。为了便于系统级仿真,还引入了考虑缓存影响的流量模型。仿真结果表明,在接入链路和回程链路之间灵活的资源分配可以获得可观的性能增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信