Uplink Contention-based Transmission Schemes for URLLC Services

M. Deghel, P. Brown, S. Elayoubi, Ana Galindo-Serrano
{"title":"Uplink Contention-based Transmission Schemes for URLLC Services","authors":"M. Deghel, P. Brown, S. Elayoubi, Ana Galindo-Serrano","doi":"10.1145/3306309.3306323","DOIUrl":null,"url":null,"abstract":"We investigate in this paper uplink multiple transmission schemes for 5G Ultra-Reliable Low Latency Communications (URLLC) traffic. The URLLC class of services has been defined for applications requiring extremely stringent latency and reliability. We show that, in systems with episodic traffic and many users compared with the number of transmission resources, randomly transmitting multiple copies of a packet allows to meet the URLLC requirements. We develop analytical models for the packet loss rate for two contention based multiple transmission schemes and show that one dominates the other in the parameter range for which the URLLC requirements are met. We then show on a possible radio setting for 5G, an example of radio resource dimensioning for different user traffic levels and we illustrate how the latency constraint may limit the allowable traffic for a given radio bandwidth.","PeriodicalId":113198,"journal":{"name":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3306309.3306323","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

We investigate in this paper uplink multiple transmission schemes for 5G Ultra-Reliable Low Latency Communications (URLLC) traffic. The URLLC class of services has been defined for applications requiring extremely stringent latency and reliability. We show that, in systems with episodic traffic and many users compared with the number of transmission resources, randomly transmitting multiple copies of a packet allows to meet the URLLC requirements. We develop analytical models for the packet loss rate for two contention based multiple transmission schemes and show that one dominates the other in the parameter range for which the URLLC requirements are met. We then show on a possible radio setting for 5G, an example of radio resource dimensioning for different user traffic levels and we illustrate how the latency constraint may limit the allowable traffic for a given radio bandwidth.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于上行链路竞争的URLLC业务传输方案
本文研究了5G超可靠低延迟通信(URLLC)流量的上行多传输方案。URLLC服务类是为需要极其严格的延迟和可靠性的应用程序定义的。我们表明,在具有偶发流量和与传输资源数量相比的许多用户的系统中,随机传输数据包的多个副本允许满足URLLC要求。我们建立了两种基于争用的多传输方案的丢包率分析模型,并表明在满足URLLC要求的参数范围内,一个方案优于另一个方案。然后,我们展示了5G可能的无线电设置,一个针对不同用户流量级别的无线电资源维度的示例,并说明了延迟约束如何限制给定无线电带宽的允许流量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Revenue-Driven Scheduling in Drone Delivery Networks with Time-sensitive Service Level Agreements A proof of the conjecture in "Pricing surplus server capacity for mean waiting time sensitive customers" Tandem stochastic systems: Jackson networks, asymmetric exclusion processes, asymmetric inclusion processes and Catalan numbers Ultimately Stationary Policies to Approximate Risk-Sensitive Discounted MDPs A bottleneck with randomly distorted arrival times
×
引用
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