Israel Leyva-Mayorga, Jose Manuel Gimenez-Guzman, Lorenzo Valentini, Petar Popovski
{"title":"具有多个延迟目标的异构无线接入","authors":"Israel Leyva-Mayorga, Jose Manuel Gimenez-Guzman, Lorenzo Valentini, Petar Popovski","doi":"arxiv-2312.03131","DOIUrl":null,"url":null,"abstract":"Since the advent of ultra-reliable and low-latency communications (URLLC),\nthe requirements of low-latency applications tend to be completely\ncharacterized by a single pre-defined latency-reliability target. That is,\noperation is optimal whenever the pre-defined latency threshold is met but the\nsystem is assumed to be in error when the latency threshold is violated. This\nvision is severely limited and does not capture the real requirements of most\napplications, where multiple latency thresholds can be defined, together with\nincentives or rewards associated with meeting each of them. Such formulation is\na generalization of the single-threshold case popularized by URLLC and, in the\nasymptotic case, approximates to defining a cost for each point in the support\nof the latency distribution. In this paper, we explore the implications of\ndefining multiple latency targets on the design of access protocols and on the\noptimization of repetition-based access strategies in orthogonal and\nnon-orthogonal multiple access scenarios with users that present heterogeneous\ntraffic characteristics and requirements. We observe that the access strategies\nof the users can be effectively adapted to the requirements of the application\nby carefully defining the latency targets and the associated rewards.","PeriodicalId":501433,"journal":{"name":"arXiv - CS - Information Theory","volume":"62 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Heterogeneous radio access with multiple latency targets\",\"authors\":\"Israel Leyva-Mayorga, Jose Manuel Gimenez-Guzman, Lorenzo Valentini, Petar Popovski\",\"doi\":\"arxiv-2312.03131\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Since the advent of ultra-reliable and low-latency communications (URLLC),\\nthe requirements of low-latency applications tend to be completely\\ncharacterized by a single pre-defined latency-reliability target. That is,\\noperation is optimal whenever the pre-defined latency threshold is met but the\\nsystem is assumed to be in error when the latency threshold is violated. This\\nvision is severely limited and does not capture the real requirements of most\\napplications, where multiple latency thresholds can be defined, together with\\nincentives or rewards associated with meeting each of them. Such formulation is\\na generalization of the single-threshold case popularized by URLLC and, in the\\nasymptotic case, approximates to defining a cost for each point in the support\\nof the latency distribution. In this paper, we explore the implications of\\ndefining multiple latency targets on the design of access protocols and on the\\noptimization of repetition-based access strategies in orthogonal and\\nnon-orthogonal multiple access scenarios with users that present heterogeneous\\ntraffic characteristics and requirements. We observe that the access strategies\\nof the users can be effectively adapted to the requirements of the application\\nby carefully defining the latency targets and the associated rewards.\",\"PeriodicalId\":501433,\"journal\":{\"name\":\"arXiv - CS - Information Theory\",\"volume\":\"62 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2312.03131\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2312.03131","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Heterogeneous radio access with multiple latency targets
Since the advent of ultra-reliable and low-latency communications (URLLC),
the requirements of low-latency applications tend to be completely
characterized by a single pre-defined latency-reliability target. That is,
operation is optimal whenever the pre-defined latency threshold is met but the
system is assumed to be in error when the latency threshold is violated. This
vision is severely limited and does not capture the real requirements of most
applications, where multiple latency thresholds can be defined, together with
incentives or rewards associated with meeting each of them. Such formulation is
a generalization of the single-threshold case popularized by URLLC and, in the
asymptotic case, approximates to defining a cost for each point in the support
of the latency distribution. In this paper, we explore the implications of
defining multiple latency targets on the design of access protocols and on the
optimization of repetition-based access strategies in orthogonal and
non-orthogonal multiple access scenarios with users that present heterogeneous
traffic characteristics and requirements. We observe that the access strategies
of the users can be effectively adapted to the requirements of the application
by carefully defining the latency targets and the associated rewards.