D. Lee, Cheng-Shang Chang, Ruhui Zhang, Mao-Pin Lee
In this paper we consider two resource allocation problems of URLLC traffic and eMBB traffic in uplink 5G networks. We propose to divide frequencies into a common region and a grant-based region. Frequencies in the grant-based region can only be used by eMBB traffic, while frequencies in the common region can be used by eMBB traffic as well as URLLC traffic. In the first resource allocation problem we propose a two-player game to address the size of the grant-based region and the size of the common region. We show that this game has specific pure Nash equilibria. In the second resource allocation problem we determine the number of packets that each eMBB user can transmit in a request-grant cycle. We propose a constrained optimization problem to minimize the variance of the number of packets granted to the eMBB users. We show that a water-filling algorithm solves this constrained optimization problem. From simulation, we show that our scheme, consisting of resource allocation according to Nash equilibria of a game, persistent random retransmission of URLLC packets and allocation of eMBB packets by a water-filling algorithm, works better than four other heuristic methods.
{"title":"Resource Allocation for URLLC and eMBB Traffic in Uplink Wireless Networks","authors":"D. Lee, Cheng-Shang Chang, Ruhui Zhang, Mao-Pin Lee","doi":"10.2139/ssrn.4220800","DOIUrl":"https://doi.org/10.2139/ssrn.4220800","url":null,"abstract":"In this paper we consider two resource allocation problems of URLLC traffic and eMBB traffic in uplink 5G networks. We propose to divide frequencies into a common region and a grant-based region. Frequencies in the grant-based region can only be used by eMBB traffic, while frequencies in the common region can be used by eMBB traffic as well as URLLC traffic. In the first resource allocation problem we propose a two-player game to address the size of the grant-based region and the size of the common region. We show that this game has specific pure Nash equilibria. In the second resource allocation problem we determine the number of packets that each eMBB user can transmit in a request-grant cycle. We propose a constrained optimization problem to minimize the variance of the number of packets granted to the eMBB users. We show that a water-filling algorithm solves this constrained optimization problem. From simulation, we show that our scheme, consisting of resource allocation according to Nash equilibria of a game, persistent random retransmission of URLLC packets and allocation of eMBB packets by a water-filling algorithm, works better than four other heuristic methods.","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"109 1","pages":"102353"},"PeriodicalIF":0.0,"publicationDate":"2022-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80533287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Join-the-Shortest-Queue (JSQ) load-balancing scheme is known to minimise the average delay of jobs in homogeneous systems consisting of identical servers. However, it performs poorly in heterogeneous systems where servers have different processing rates. Finding a delay optimal scheme remains an open problem for heterogeneous systems. In this paper, we consider a speed-aware version of the JSQ scheme for heterogeneous systems and show that it achieves delay optimality in the fluid limit. One of the key issues in establishing this optimality result for heterogeneous systems is to show that the sequence of steady-state distributions indexed by the system size is tight in an appropriately defined space. The usual technique for showing tightness by coupling with a suitably defined dominant system does not work for heterogeneous systems. To prove tightness, we devise a new technique that uses the drift of exponential Lyapunov functions. Using the non-negativity of the drift, we show that the stationary queue length distribution has an exponentially decaying tail - a fact we use to prove tightness. Another technical difficulty arises due to the complexity of the underlying state-space and the separation of two time-scales in the fluid limit. Due to these factors, the fluid-limit turns out to be a function of the invariant distribution of a multi-dimensional Markov chain which is hard to characterise. By using some properties of this invariant distribution and using the monotonicity of the system, we show that the fluid limit is has a unique and globally attractive fixed point.
{"title":"Asymptotic optimality of speed-aware JSQ for heterogeneous service systems","authors":"Sanidhay Bhambay, Arpan Mukhopadhyay","doi":"10.2139/ssrn.4081867","DOIUrl":"https://doi.org/10.2139/ssrn.4081867","url":null,"abstract":"The Join-the-Shortest-Queue (JSQ) load-balancing scheme is known to minimise the average delay of jobs in homogeneous systems consisting of identical servers. However, it performs poorly in heterogeneous systems where servers have different processing rates. Finding a delay optimal scheme remains an open problem for heterogeneous systems. In this paper, we consider a speed-aware version of the JSQ scheme for heterogeneous systems and show that it achieves delay optimality in the fluid limit. One of the key issues in establishing this optimality result for heterogeneous systems is to show that the sequence of steady-state distributions indexed by the system size is tight in an appropriately defined space. The usual technique for showing tightness by coupling with a suitably defined dominant system does not work for heterogeneous systems. To prove tightness, we devise a new technique that uses the drift of exponential Lyapunov functions. Using the non-negativity of the drift, we show that the stationary queue length distribution has an exponentially decaying tail - a fact we use to prove tightness. Another technical difficulty arises due to the complexity of the underlying state-space and the separation of two time-scales in the fluid limit. Due to these factors, the fluid-limit turns out to be a function of the invariant distribution of a multi-dimensional Markov chain which is hard to characterise. By using some properties of this invariant distribution and using the monotonicity of the system, we show that the fluid limit is has a unique and globally attractive fixed point.","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"3 1","pages":"102320"},"PeriodicalIF":0.0,"publicationDate":"2022-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84276181","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-05-01DOI: 10.1016/j.peva.2021.102193
Chu Tien Dung, T. Hoang, Nguyen Nhu Thang, M. Tran, Phuong T. Tran
{"title":"Secrecy performance of multi-user multi-hop cluster-based network with joint relay and jammer selection under imperfect channel state information","authors":"Chu Tien Dung, T. Hoang, Nguyen Nhu Thang, M. Tran, Phuong T. Tran","doi":"10.1016/j.peva.2021.102193","DOIUrl":"https://doi.org/10.1016/j.peva.2021.102193","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"16 1","pages":"102193"},"PeriodicalIF":0.0,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83408313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-05-01DOI: 10.1016/j.peva.2021.102192
S. Chiaradonna, F. Giandomenico, Giulio Masetti
{"title":"On identity-aware replication in stochastic modeling for simulation-based dependability analysis of large interconnected systems","authors":"S. Chiaradonna, F. Giandomenico, Giulio Masetti","doi":"10.1016/j.peva.2021.102192","DOIUrl":"https://doi.org/10.1016/j.peva.2021.102192","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"16 1","pages":"102192"},"PeriodicalIF":0.0,"publicationDate":"2021-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76463334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-01-01DOI: 10.1016/j.peva.2021.102195
Y. Raaijmakers, S. Borst, O. Boxma
{"title":"Stability and tail behavior of redundancy systems with processor sharing","authors":"Y. Raaijmakers, S. Borst, O. Boxma","doi":"10.1016/j.peva.2021.102195","DOIUrl":"https://doi.org/10.1016/j.peva.2021.102195","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"311 1","pages":"102195"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74211502","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-06-01DOI: 10.1016/j.peva.2020.102085
Mingzhou Xie, Li Xia, Jun Xu
{"title":"On M/G[b]/1/K queue with multiple state-dependent vacations: A real problem from media-based cache in hard disk drives","authors":"Mingzhou Xie, Li Xia, Jun Xu","doi":"10.1016/j.peva.2020.102085","DOIUrl":"https://doi.org/10.1016/j.peva.2020.102085","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"153 1","pages":"102085"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86156700","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-06-26DOI: 10.1016/j.peva.2021.102196
N. Pappas, Ioannis Dimitriou, Zheng Chen
{"title":"On the benefits of network-level cooperation in IoT networks with aggregators","authors":"N. Pappas, Ioannis Dimitriou, Zheng Chen","doi":"10.1016/j.peva.2021.102196","DOIUrl":"https://doi.org/10.1016/j.peva.2021.102196","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"93 1","pages":"102196"},"PeriodicalIF":0.0,"publicationDate":"2018-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91543448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-01DOI: 10.1016/j.peva.2017.11.003
Hisashi Kobayashi
{"title":"Preface to the 35th anniversary Issue of Performance Evaluation","authors":"Hisashi Kobayashi","doi":"10.1016/j.peva.2017.11.003","DOIUrl":"https://doi.org/10.1016/j.peva.2017.11.003","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"134 1","pages":"5-7"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79397875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-02-01DOI: 10.1016/j.peva.2017.10.002
E. Evdokimova, K. D. Turck, D. Fiems
{"title":"Coupled queues with customer impatience","authors":"E. Evdokimova, K. D. Turck, D. Fiems","doi":"10.1016/j.peva.2017.10.002","DOIUrl":"https://doi.org/10.1016/j.peva.2017.10.002","url":null,"abstract":"","PeriodicalId":19766,"journal":{"name":"Perform. Evaluation","volume":"248 2 1","pages":"33-47"},"PeriodicalIF":0.0,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72815035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：