Performance Evaluation最新文献_第9页

Resource allocation for URLLC and eMBB traffic in uplink wireless networks 无线上行网络中URLLC和eMBB业务的资源分配

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2023-09-01 DOI: 10.1016/j.peva.2023.102353

Duan-Shin Lee , Cheng-Shang Chang , Ruhui Zhang , Mao-Pin Lee

{"title":"Resource allocation for URLLC and eMBB traffic in uplink wireless networks","authors":"Duan-Shin Lee , Cheng-Shang Chang , Ruhui Zhang , Mao-Pin Lee","doi":"10.1016/j.peva.2023.102353","DOIUrl":"https://doi.org/10.1016/j.peva.2023.102353","url":null,"abstract":"<div>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 bits 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 bits 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 transmission of URLLC packets and allocation of eMBB packets by a water-filling algorithm, works better than four other heuristic methods.</div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"161 ","pages":"Article 102353"},"PeriodicalIF":2.2,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49701143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Stability of a stochastic ring network 随机环网络的稳定性

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2023-08-28 DOI: 10.1016/j.peva.2023.102355

Pieter Jacob Storm , Wouter Kager , Michel Mandjes , Sem Borst

引用次数: 1

Efficient and accurate Lyapunov function-based truncation technique for multi-dimensional Markov chains with applications to discriminatory processor sharing and priority queues 基于Lyapunov函数的多维马尔可夫链截断技术及其在判别处理器共享和优先级队列中的应用

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2023-08-10 DOI: 10.1016/j.peva.2023.102356

Gagan Somashekar , Mohammad Delasay , Anshul Gandhi

{"title":"Efficient and accurate Lyapunov function-based truncation technique for multi-dimensional Markov chains with applications to discriminatory processor sharing and priority queues","authors":"Gagan Somashekar , Mohammad Delasay , Anshul Gandhi","doi":"10.1016/j.peva.2023.102356","DOIUrl":"https://doi.org/10.1016/j.peva.2023.102356","url":null,"abstract":"<div>Online service providers aim to satisfy the tail performance requirements of customers through Service-Level Objectives (SLOs). One approach to ensure tail performance requirements is to model the service as a Markov chain and obtain its steady-state probability distribution. However, obtaining the distribution can be challenging, if not impossible, for certain types of Markov chains, such as those with multi-dimensional or infinite state-space and state-dependent transitions. Examples include M/M/1 with Discriminatory Processor Sharing (DPS) and preemptive M/M/c with multiple priority classes and customer abandonment.To address this fundamental problem, we propose a Lyapunov function-based state-space truncation technique that leverages moments or bounds on moments of the state variables. This technique allows us to obtain tight truncation bounds while ensuring arbitrary probability mass guarantees for the truncated chain. We highlight the efficacy of our technique for multi-dimensional DPS and M/M/c priority queue with abandonment, demonstrating a substantial reduction in state space (up to 74%) compared to existing approaches. Additionally, we present three practical use cases that highlight the applicability of our truncation technique by analyzing the performance of the DPS system.</div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"162 ","pages":"Article 102356"},"PeriodicalIF":2.2,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49874544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Reflections on good practice in evaluating Violence Reduction Units: Experiences from across England and Wales 对评估减少暴力单位良好做法的思考:来自英格兰和威尔士各地的经验

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2023-07-01 DOI: 10.1177/13563890231183993

L. Caulfield, Z. Quigg, Nicole M. Adams-Quackenbush, H. Timpson, Sophie Wilson

引用次数: 1

Giving critical theoretical and evaluation practice context to ‘Testing, Testing’ in Jamaica 为牙买加的“测试，测试”提供关键的理论和评估实践背景

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2023-07-01 DOI: 10.1177/13563890231184274

D. Leslie, Keenan Falconer, Chantol Dormer, Thelma White

引用次数: 0

Comprehensive evaluation framework building for integrated development program 综合发展规划综合评价框架构建

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2023-07-01 DOI: 10.1177/13563890231183990

Jae Eun Shin, Mi Joung Yu, Suk-won Lee

引用次数: 0

How to develop a realist programme theory using Margaret Archer’s structure–agency–culture framework: The case of adolescent accountability for sexual and reproductive health in urban resource-constrained settings 如何利用玛格丽特·阿彻的结构-机构-文化框架发展现实主义方案理论:在城市资源有限的环境中，青少年对性健康和生殖健康的责任案例

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2023-06-30 DOI: 10.1177/13563890231185167

Sara Van Belle, I. Abejirinde, A. Ssennyonjo, P. Srinivas, P. Hebbar, B. Marchal

{"title":"How to develop a realist programme theory using Margaret Archer’s structure–agency–culture framework: The case of adolescent accountability for sexual and reproductive health in urban resource-constrained settings","authors":"Sara Van Belle, I. Abejirinde, A. Ssennyonjo, P. Srinivas, P. Hebbar, B. Marchal","doi":"10.1177/13563890231185167","DOIUrl":"https://doi.org/10.1177/13563890231185167","url":null,"abstract":"Realist evaluation is in essence a theory-building and testing approach. We argue that in practice, the theory-building potential of realist evaluation, review and research is not fully exploited in the field of global health. Our assumption is that the Structure-Agency-Culture explanatory framework of critical realist Margaret Archer could stimulate realist evaluators to conceptualize and systematically explore how structural and cultural conditions interact with programmes that aim at introducing social change. We propose step-wise guidance towards integrating the Structure–Agency–Culture framework into the development of realist programme theories. We present a worked example from an urban adolescent health study in poor neighbourhoods of Kampala, Mumbai, New Delhi and Cotonou. The guidance aims to bring to the fore the role of agency and context through the analysis of the interactions between structure, culture, agency and mechanisms. This is helpful in realist research in general, and in evaluations of complex interventions oriented towards social change.","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"68 1","pages":"259 - 275"},"PeriodicalIF":2.2,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78644832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Understanding evaluation use from an organisational perspective: A review of the literature and a research agenda 从组织角度理解评估使用:文献回顾和研究议程

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2023-06-30 DOI: 10.1177/13563890231185164

T. Kupiec, Dorota Celińska-Janowicz, V. Pattyn

引用次数: 0

Challenges and strategies for implementers and evaluators working in conflict settings 在冲突环境中工作的实施者和评估者面临的挑战和策略

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2023-05-11 DOI: 10.1177/13563890231171608

Laura Bond, Elizabeth K. Klein, Emily F. Gates

引用次数: 0

An analysis of probabilistic forwarding of coded packets on random geometric graphs 随机几何图上编码数据包的概率转发分析

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2023-05-01 DOI: 10.1016/j.peva.2023.102343

B.R. Vinay Kumar , Navin Kashyap , D. Yogeshwaran

{"title":"An analysis of probabilistic forwarding of coded packets on random geometric graphs","authors":"B.R. Vinay Kumar , Navin Kashyap , D. Yogeshwaran","doi":"10.1016/j.peva.2023.102343","DOIUrl":"https://doi.org/10.1016/j.peva.2023.102343","url":null,"abstract":"<div>We consider the problem of energy-efficient broadcasting on large ad-hoc networks. Ad-hoc networks are generally modelled using random geometric graphs (RGGs). Here, nodes are deployed uniformly in a square area around the origin, and any two nodes which are within Euclidean distance of 1 are assumed to be able to receive each other’s broadcast. A source node at the origin encodes <math><mi>k</mi></math> data packets of information into <math><mrow><mi>n</mi><mspace></mspace><mrow><mo>(</mo><mo>></mo><mi>k</mi><mo>)</mo></mrow></mrow></math> coded packets and transmits them to all its one-hop neighbours. The encoding is such that, any node that receives at least <math><mi>k</mi></math> out of the <math><mi>n</mi></math> coded packets can retrieve the original <math><mi>k</mi></math> data packets. Every other node in the network follows a probabilistic forwarding protocol; upon reception of a previously unreceived packet, the node forwards it with probability <math><mi>p</mi></math> and does nothing with probability <math><mrow><mn>1</mn><mo>−</mo><mi>p</mi></mrow></math>. We are interested in the minimum forwarding probability which ensures that a large fraction of nodes can decode the information from the source. We deem this a near-broadcast. The performance metric of interest is the expected total number of transmissions at this minimum forwarding probability, where the expectation is over both the forwarding protocol as well as the realization of the RGG. In comparison to probabilistic forwarding with no coding, our treatment of the problem indicates that, with a judicious choice of <math><mi>n</mi></math>, it is possible to reduce the expected total number of transmissions while ensuring a near-broadcast.</div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"160 ","pages":"Article 102343"},"PeriodicalIF":2.2,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49901373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0