{"title":"Radio resource scheduling for low-latency communications in LTE and beyond","authors":"E. Khorov, A. Krasilov, A. Malyshev","doi":"10.1109/IWQoS.2017.7969162","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the problem of radio resource scheduling for Industrial Internet and Tactile Internet. Both paradigms — being revolutionary drivers of 5G — are tightly connected with low-latency communications (i.e. latency of the order of 10 ms or even less). We give an original mathematical statement of the radio resource scheduling problem and propose a novel algorithm which solves this problem using the dynamic programming method. With simulations we show that the proposed algorithm outperforms ones found in literature both in terms of goodput (i.e. the amount of data delivered to users within delay budget) and number of users with satisfied QoS requirements. Finally, we discuss how the developed algorithm can be implemented in real networking equipment.","PeriodicalId":422861,"journal":{"name":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE/ACM 25th International Symposium on Quality of Service (IWQoS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWQoS.2017.7969162","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
In this paper, we consider the problem of radio resource scheduling for Industrial Internet and Tactile Internet. Both paradigms — being revolutionary drivers of 5G — are tightly connected with low-latency communications (i.e. latency of the order of 10 ms or even less). We give an original mathematical statement of the radio resource scheduling problem and propose a novel algorithm which solves this problem using the dynamic programming method. With simulations we show that the proposed algorithm outperforms ones found in literature both in terms of goodput (i.e. the amount of data delivered to users within delay budget) and number of users with satisfied QoS requirements. Finally, we discuss how the developed algorithm can be implemented in real networking equipment.