提高HARQ池中内存利用率的研究

S. K. Vankayala, S. AshokKrishnanK., RaviTeja Gundeti, Konchady Gautam Shenoy
{"title":"提高HARQ池中内存利用率的研究","authors":"S. K. Vankayala, S. AshokKrishnanK., RaviTeja Gundeti, Konchady Gautam Shenoy","doi":"10.1109/SPCOM50965.2020.9179580","DOIUrl":null,"url":null,"abstract":"We consider a novel mechanism to pool HARQ (Hybrid Automatic Repeat Request) memory at the UE (User Equipment). In legacy systems, each carrier is allocated a separate section of the total HARQ memory. By pooling this memory and allocating as HARQ requests arrive, we significantly improve the memory utilization. Moreover, we can accommodate a larger fraction of arriving HARQ requests thus increasing HARQ throughput without increasing buffer requirement at the UE. In this work, we model the HARQ memory system as a multiserver queue, and obtain expressions for dropping probability and memory occupancy. We compare the pooling system to the legacy technology in an asymptotic regime, which is a good approximation in cases where the ratio of the largest to smallest packet size is large. This regime holds for scenarios with large Transport Block sizes, such as 5G New Radio. In this regime, under large load factor, we show that blocking probability reduces under the pooling mechanism and uses less resources.","PeriodicalId":208527,"journal":{"name":"2020 International Conference on Signal Processing and Communications (SPCOM)","volume":"53 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Improved Memory Utilization in HARQ Pooling\",\"authors\":\"S. K. Vankayala, S. AshokKrishnanK., RaviTeja Gundeti, Konchady Gautam Shenoy\",\"doi\":\"10.1109/SPCOM50965.2020.9179580\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a novel mechanism to pool HARQ (Hybrid Automatic Repeat Request) memory at the UE (User Equipment). In legacy systems, each carrier is allocated a separate section of the total HARQ memory. By pooling this memory and allocating as HARQ requests arrive, we significantly improve the memory utilization. Moreover, we can accommodate a larger fraction of arriving HARQ requests thus increasing HARQ throughput without increasing buffer requirement at the UE. In this work, we model the HARQ memory system as a multiserver queue, and obtain expressions for dropping probability and memory occupancy. We compare the pooling system to the legacy technology in an asymptotic regime, which is a good approximation in cases where the ratio of the largest to smallest packet size is large. This regime holds for scenarios with large Transport Block sizes, such as 5G New Radio. In this regime, under large load factor, we show that blocking probability reduces under the pooling mechanism and uses less resources.\",\"PeriodicalId\":208527,\"journal\":{\"name\":\"2020 International Conference on Signal Processing and Communications (SPCOM)\",\"volume\":\"53 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Signal Processing and Communications (SPCOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPCOM50965.2020.9179580\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Signal Processing and Communications (SPCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPCOM50965.2020.9179580","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们考虑了一种新的机制来池HARQ(混合自动重复请求)内存在UE(用户设备)。在遗留系统中,每个载波被分配到总HARQ内存的一个单独部分。通过池化这些内存并在HARQ请求到达时进行分配,我们可以显著提高内存利用率。此外,我们可以容纳更大比例的到达HARQ请求,从而在不增加UE缓冲区需求的情况下增加HARQ吞吐量。在本工作中,我们将HARQ存储系统建模为一个多服务器队列,并得到了丢失概率和内存占用的表达式。我们将池化系统与遗留技术在渐近状态下进行比较,这在最大与最小数据包大小之比较大的情况下是一个很好的近似。这种机制适用于传输块大小较大的场景,例如5G新无线电。在这种情况下,在较大的负载因子下,我们发现在池化机制下阻塞概率降低,占用的资源更少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On the Improved Memory Utilization in HARQ Pooling
We consider a novel mechanism to pool HARQ (Hybrid Automatic Repeat Request) memory at the UE (User Equipment). In legacy systems, each carrier is allocated a separate section of the total HARQ memory. By pooling this memory and allocating as HARQ requests arrive, we significantly improve the memory utilization. Moreover, we can accommodate a larger fraction of arriving HARQ requests thus increasing HARQ throughput without increasing buffer requirement at the UE. In this work, we model the HARQ memory system as a multiserver queue, and obtain expressions for dropping probability and memory occupancy. We compare the pooling system to the legacy technology in an asymptotic regime, which is a good approximation in cases where the ratio of the largest to smallest packet size is large. This regime holds for scenarios with large Transport Block sizes, such as 5G New Radio. In this regime, under large load factor, we show that blocking probability reduces under the pooling mechanism and uses less resources.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Wavelet based Fine-to-Coarse Retinal Blood Vessel Extraction using U-net Model Classification of Social Signals Using Deep LSTM-based Recurrent Neural Networks Classifying Cultural Music using Melodic Features Clustering tendency assessment for datasets having inter-cluster density variations Component-specific temporal decomposition: application to enhanced speech coding and co-articulation analysis
×
引用
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