Cache Placement Solutions in Software-Defined Radio Access Networks

Ngoc-Dung Dào, H. Farmanbar, Han Zhang
{"title":"Cache Placement Solutions in Software-Defined Radio Access Networks","authors":"Ngoc-Dung Dào, H. Farmanbar, Han Zhang","doi":"10.1109/VTCFall.2017.8288091","DOIUrl":null,"url":null,"abstract":"In this paper, we present low-complexity algorithms for cache placement problem in software-defined radio access networks. Our key design target is that the packet delay from any cache to its associated users is below a threshold. This feature is a significant improvement compared to conventional approaches relying on the average hop count. We introduce a traffic engineering solution for joint multiserver selection and rate allocation. This algorithm is used to minimize the cache placement cost function, such as delivery cost per bit. Our cache placement method allows prediction of user throughput and thus the network throughput. Extensive simulation results verify that our method can give optimal or near optimal network throughput while guaranteeing packet delay performance.","PeriodicalId":375803,"journal":{"name":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 86th Vehicular Technology Conference (VTC-Fall)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VTCFall.2017.8288091","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we present low-complexity algorithms for cache placement problem in software-defined radio access networks. Our key design target is that the packet delay from any cache to its associated users is below a threshold. This feature is a significant improvement compared to conventional approaches relying on the average hop count. We introduce a traffic engineering solution for joint multiserver selection and rate allocation. This algorithm is used to minimize the cache placement cost function, such as delivery cost per bit. Our cache placement method allows prediction of user throughput and thus the network throughput. Extensive simulation results verify that our method can give optimal or near optimal network throughput while guaranteeing packet delay performance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
软件定义无线接入网络中的缓存放置解决方案
本文针对软件定义无线接入网络中的缓存放置问题,提出了一种低复杂度的算法。我们的主要设计目标是从任何缓存到其关联用户的数据包延迟低于阈值。与依赖于平均跳数的传统方法相比,该特性是一个显著的改进。介绍了一种联合多服务器选择和速率分配的流量工程解决方案。该算法用于最小化缓存放置成本函数,如每比特的传输成本。我们的缓存放置方法允许预测用户吞吐量,从而预测网络吞吐量。大量的仿真结果验证了我们的方法可以在保证包延迟性能的同时提供最优或接近最优的网络吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Novel Framework for Software Defined Wireless Sensor Networks Using LTE Networks for UAV Command and Control Link: A Rural-Area Coverage Analysis Interference Analysis for UAV Connectivity over LTE Using Aerial Radio Measurements Circular Convolution Filter Bank Multicarrier (FBMC) System with Index Modulation Dynamic Time and Power Allocation for Opportunistic Energy Efficient Cooperative Relay
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1