Performance Evaluation最新文献

筛选
英文 中文
Modeling and performance analysis of hybrid systems by queues with setup time 具有建立时间的队列混合系统建模与性能分析
IF 2.2 4区 计算机科学
Performance Evaluation Pub Date : 2023-09-04 DOI: 10.1016/j.peva.2023.102366
Mitsuki Sato , Kohei Kawamura , Ken’ichi Kawanishi , Tuan Phung-Duc
{"title":"Modeling and performance analysis of hybrid systems by queues with setup time","authors":"Mitsuki Sato ,&nbsp;Kohei Kawamura ,&nbsp;Ken’ichi Kawanishi ,&nbsp;Tuan Phung-Duc","doi":"10.1016/j.peva.2023.102366","DOIUrl":"https://doi.org/10.1016/j.peva.2023.102366","url":null,"abstract":"<div><p>NFV (Network Functions Virtualization) is a technology to provide network services<span> by applying virtualization<span>. While the virtualization technology provides flexible architecture by itself, a specific environment where physical legacy equipment and virtualized machines coexist is also considered to meet a wide range of requirements from not only users but also service providers. Motivated by such hybrid systems, we propose queueing models with two types of service facilities: legacy servers and virtual machines. Key features to focus on are that while legacy servers are always on standby, virtual machines need setup time to be ready for service because they are shutdown to reduce the power consumption if no jobs are waiting. Keeping in mind delay-sensitive real-time services, we evaluate the performance of the queueing models, in particular, the delay and energy efficiency.</span></span></p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2023-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49874546","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
A loss queueing game for electric vehicle charging performance evaluation 一种用于电动汽车充电性能评价的损失排队博弈
IF 2.2 4区 计算机科学
Performance Evaluation Pub Date : 2023-09-01 DOI: 10.1016/j.peva.2023.102350
Alix Dupont , Yezekael Hayel , Tania Jiménez , Olivier Beaude , Jean-Baptiste Breal
{"title":"A loss queueing game for electric vehicle charging performance evaluation","authors":"Alix Dupont ,&nbsp;Yezekael Hayel ,&nbsp;Tania Jiménez ,&nbsp;Olivier Beaude ,&nbsp;Jean-Baptiste Breal","doi":"10.1016/j.peva.2023.102350","DOIUrl":"https://doi.org/10.1016/j.peva.2023.102350","url":null,"abstract":"<div><p><span>The demand of electricity at the Charging Stations (CSs) by Electric Vehicle (EV) users is tremendously increasing. However, EV users still face limited resources at the CSs, both in terms of the number of parking spaces equipped with a charging point, and in terms of available power. This paper deals with the choice of a CS among two CSs by the EV users in a competitive environment. The stochastic nature of arrivals and departures at the CSs is modeled by a queueing system. A queueing game is studied where the EV users are the players and choose the CS that gives the highest expected energy received. An </span>approximation of the expected energy received at the CSs is theoretically provided and the quality of this approximation is numerically illustrated and analyzed through simulations. The existence and uniqueness of the equilibrium of the game is proved, and bounds on the Price of Anarchy (PoA) are also provided. Moreover, the model is simulated using a discrete event framework and a sensitivity analysis of the main metrics of the system with respect to the average parking duration and the power sizing coefficient is provided. The results show that the utility of EV users at equilibrium is close to the optimal utility. This study can help a Charging Point Operator (CPO) to design incentives for EV users in order for instance to limit the parking duration so as to improve the social welfare of the EV users.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49700929","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
Optimizing recommendations under abandonment risks: Models and algorithms 放弃风险下的推荐优化:模型与算法
IF 2.2 4区 计算机科学
Performance Evaluation Pub Date : 2023-09-01 DOI: 10.1016/j.peva.2023.102351
Xuchuang Wang , Hong Xie , Pinghui Wang , John C.S. Lui
{"title":"Optimizing recommendations under abandonment risks: Models and algorithms","authors":"Xuchuang Wang ,&nbsp;Hong Xie ,&nbsp;Pinghui Wang ,&nbsp;John C.S. Lui","doi":"10.1016/j.peva.2023.102351","DOIUrl":"https://doi.org/10.1016/j.peva.2023.102351","url":null,"abstract":"<div><p>User abandonment behaviors are quite common in recommendation applications such as online shopping recommendation and news recommendation. To maximize its total “reward” under the risk of user abandonment, the online platform needs to carefully optimize its recommendations for its users. Because inappropriate recommendations can lead to user abandoning the platform, which results in a short learning duration and reduces the cumulative reward. To address this problem, we formulate a new online decision model and propose an algorithmic framework to <em>transfer similar users’ information</em><span> via parametric estimation, and employ this knowledge to </span><em>optimize later decisions</em><span>. The framework’s theoretical guarantees depend on requirements for its transfer learning oracle and online decision oracle. We then design an online learning algorithm consisting of two components that fulfills each corresponding oracle’s requirements. We also conduct extensive experiments to demonstrate our algorithm’s performance.</span></p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49757519","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
CLC: A cross-level program characterization method CLC:一种跨层次的程序表征方法
IF 2.2 4区 计算机科学
Performance Evaluation Pub Date : 2023-09-01 DOI: 10.1016/j.peva.2023.102354
Li Tang, Scott Pakin
{"title":"CLC: A cross-level program characterization method","authors":"Li Tang,&nbsp;Scott Pakin","doi":"10.1016/j.peva.2023.102354","DOIUrl":"https://doi.org/10.1016/j.peva.2023.102354","url":null,"abstract":"<div><p>Characterization of program execution plays a key role in performance improvement. There are numerous transformations applied to each step that a program takes on its lowering from source code to a compiler intermediate representation to machine language to microarchitecture-specific execution. The unpredictable benefit of each transformation step could lead a notionally superior algorithm to exhibit inferior performance once actually run, and it can be hard to discern which step in the transformation path contradicted the code developer’s assumptions.</p><p>Conventional approaches to program-execution characterization consider the behavior after only a single one of those steps, which limits the information that can be provided to the user. To help address the issue of myopic views of program execution, this paper presents a novel cross-level characterization approach for understanding the behavior of program execution at different levels in the process of writing, compiling, and running a program. We show that this approach provides a richer view of the sources of performance gains and losses and helps identify program execution in a more accurate manner.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49701144","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
Secrecy performance analysis of UAV-based full-duplex two-way relay NOMA system 基于无人机的全双工双向中继NOMA系统保密性能分析
IF 2.2 4区 计算机科学
Performance Evaluation Pub Date : 2023-09-01 DOI: 10.1016/j.peva.2023.102352
Thanh Trung Nguyen , Van Toan Hoang , Manh Hoang Tran , T. Thanh Huyen Le , Xuan Nam Tran
{"title":"Secrecy performance analysis of UAV-based full-duplex two-way relay NOMA system","authors":"Thanh Trung Nguyen ,&nbsp;Van Toan Hoang ,&nbsp;Manh Hoang Tran ,&nbsp;T. Thanh Huyen Le ,&nbsp;Xuan Nam Tran","doi":"10.1016/j.peva.2023.102352","DOIUrl":"https://doi.org/10.1016/j.peva.2023.102352","url":null,"abstract":"<div><p><span><span>In this paper, we investigate the secrecy performance of an unmanned aerial vehicle (UAV)-based full-duplex (FD) two-way relay non-orthogonal multiple access (TWR-NOMA) system with two terrestrial users and an eavesdropper. To ensure secure communications, a UAV acts as an aerial relay station, which not only forwards confidential information to legitimate users but also keeps emitting the jamming signal to degrade the performance of any potential eavesdropper. The ergodic secrecy rate (ESR) and secrecy outage </span>probability (SOP) of users and the system are successfully investigated under the assumption of imperfect successive interference and self-interference cancellation. In addition, to provide a better understanding of the secrecy performance, mathematical expressions of asymptotic ESR, secrecy slope, asymptotic SOP, and secrecy </span>diversity order<span> are also studied. Simulation results demonstrate that the FD TWR-NOMA system attains better secrecy performance than that of the FD TWR-NOMA system with a terrestrial relay, the FD TWR-NOMA system without jamming signal, as well as the half-duplex TWR-NOMA system. The secrecy performance of the system is significantly enhanced when UAVs approach the remote user. Furthermore, there is a reasonable power allocation value for jamming and legitimate signals on the UAV to improve secrecy performance.</span></p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49756691","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}
引用次数: 1
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 ,&nbsp;Cheng-Shang Chang ,&nbsp;Ruhui Zhang ,&nbsp;Mao-Pin Lee","doi":"10.1016/j.peva.2023.102353","DOIUrl":"https://doi.org/10.1016/j.peva.2023.102353","url":null,"abstract":"<div><p><span><span>In this paper we consider two resource allocation problems of URLLC<span> traffic and eMBB traffic in uplink </span></span>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 </span>Nash equilibria<span><span>. 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 </span>heuristic methods.</span></p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":null,"pages":null},"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
{"title":"Stability of a stochastic ring network","authors":"Pieter Jacob Storm ,&nbsp;Wouter Kager ,&nbsp;Michel Mandjes ,&nbsp;Sem Borst","doi":"10.1016/j.peva.2023.102355","DOIUrl":"https://doi.org/10.1016/j.peva.2023.102355","url":null,"abstract":"<div><p>In this paper we establish a necessary and sufficient stability condition for a stochastic ring network. Such networks naturally appear in a variety of applications within communication, computer, and road traffic systems. They typically involve <em>multiple customer types</em> and some form of <em>priority structure</em> to decide which customer receives service. These two system features tend to complicate the issue of identifying a stability condition, but we demonstrate how the ring topology can be leveraged to solve the problem.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2023-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49874547","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}
引用次数: 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 ,&nbsp;Mohammad Delasay ,&nbsp;Anshul Gandhi","doi":"10.1016/j.peva.2023.102356","DOIUrl":"https://doi.org/10.1016/j.peva.2023.102356","url":null,"abstract":"<div><p>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.</p><p>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.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":null,"pages":null},"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
{"title":"Reflections on good practice in evaluating Violence Reduction Units: Experiences from across England and Wales","authors":"L. Caulfield, Z. Quigg, Nicole M. Adams-Quackenbush, H. Timpson, Sophie Wilson","doi":"10.1177/13563890231183993","DOIUrl":"https://doi.org/10.1177/13563890231183993","url":null,"abstract":"Internationally, interpersonal violence places huge burdens on the health, wellbeing and prosperity of society. In response to a notable increase in serious knife crime, in 2019, the UK Government awarded £35 million for the establishment of 18 Violence Reduction Units (VRUs) across England and Wales. There has been limited evaluation of community-level approaches for violence, with almost no published literature on the impact of VRUs. The article presents the approaches and experiences of two interdisciplinary teams of researchers from public health, psychology, criminology, and systems change, working as evaluators of four VRUs in England and Wales. The article describes the value of adopting a whole-system approach to evaluations, outlines good practice in evaluating VRUs, and elicits challenges to developing and embedding evaluation within complex systems.","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81446590","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}
引用次数: 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
{"title":"Giving critical theoretical and evaluation practice context to ‘Testing, Testing’ in Jamaica","authors":"D. Leslie, Keenan Falconer, Chantol Dormer, Thelma White","doi":"10.1177/13563890231184274","DOIUrl":"https://doi.org/10.1177/13563890231184274","url":null,"abstract":"This article examines how evaluability assessments can be designed and conducted to generate meaningful and actionable results for reducing youth crime in Jamaica. It draws on case illustrations from the 2021 ‘Testing, Testing’ CAPRI research study report to highlight the nexus between research and evaluation and promote adopting practices that can enhance the quality and relevance of evaluations conducted within the Caribbean region and beyond. The findings suggest that data needed to inform evaluation and evidenced-based policymaking remain limited despite re-energised regional and global efforts to address this challenge. Particularly, low data quality, production, and use continue to hinder measuring progress on the Sustainable Development Goals. The article, therefore, offers an accessible decolonising framework for understanding, supporting and critically assessing how inertia within the context of evaluation practice can be challenged. Concrete suggestions for action include using local knowledge and underutilised techniques such as evaluability assessments.","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90322153","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信