Performance Evaluation最新文献

{"title":"Network slicing: Is it worth regulating in a network neutrality context?","authors":"Yassine Hadjadj-Aoul ,&nbsp;Maël Le Treust ,&nbsp;Patrick Maillé ,&nbsp;Bruno Tuffin","doi":"10.1016/j.peva.2024.102422","DOIUrl":"https://doi.org/10.1016/j.peva.2024.102422","url":null,"abstract":"<div><p>Network slicing is a key component of 5G-and-beyond networks but induces many questions related to an associated business model and its need to be regulated due to its difficult co-existence with the network neutrality debate. We propose in this paper a slicing model in the case of heterogeneous users/applications where a service provider may purchase a slice in a wireless network and offer a “premium” service where the improved quality stems from higher prices leading to less demand and less congestion than the basic service offered by the network owner, a scheme known as Paris Metro Pricing. We obtain thanks to game theory the economically-optimal slice size and prices charged by all actors. We also compare with the case of a unique “pipe” (no premium service) corresponding to a fully-neutral scenario and with the case of vertical integration to evaluate the impact of slicing on all actors and identify the “best” economic scenario and the eventual need for regulation.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"165 ","pages":"Article 102422"},"PeriodicalIF":2.2,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0166531624000270/pdfft?md5=5fc9a43434d102c218d3c6bee4bb9f76&pid=1-s2.0-S0166531624000270-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140645416","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"User-centric Markov reward model for state-dependent Erlang loss systems","authors":"Tobias Hoßfeld ,&nbsp;Poul E. Heegaard ,&nbsp;Martín Varela ,&nbsp;Michael Jarschel","doi":"10.1016/j.peva.2024.102425","DOIUrl":"10.1016/j.peva.2024.102425","url":null,"abstract":"<div><p>Markov reward models are commonly used in the analysis of systems by integrating a reward rate to each system state. Typically, rewards are defined based on system states and reflect the system’s perspective. From a user’s point of view, it is important to consider the changing system conditions and dynamics while the user consumes a service. The key contributions of this paper are proper definitions for (i) system-centric reward and (ii) user-centric reward of the Erlang loss model M/M/n-0 and M/M(x)/n with state-dependent service rates, as well as (iii) the analysis of the relationships between those metrics. Our key result allows a simple computation of the user-centric rewards. The differences between the system-centric and the user-centric rewards are demonstrated for a real-world cloud gaming use case. To the best of our knowledge, this is the first analysis showing the relationship between user-centric rewards and system-centric rewards. This work gives relevant and important insights in how to integrate the user’s perspective in the analysis of Markov reward models and is a blueprint for the analysis of other services beyond cloud gaming while also considering user engagement.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"165 ","pages":"Article 102425"},"PeriodicalIF":1.0,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0166531624000300/pdfft?md5=02058144737eebae5dcee4c833f88db3&pid=1-s2.0-S0166531624000300-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141397922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Age- and deviation-of-information of hybrid time- and event-triggered systems: What matters more, determinism or resource conservation?","authors":"Mahsa Noroozi,&nbsp;Markus Fidler","doi":"10.1016/j.peva.2024.102412","DOIUrl":"10.1016/j.peva.2024.102412","url":null,"abstract":"<div><p>Age-of-information is a metric that quantifies the freshness of information obtained by sampling a remote sensor. In signal-agnostic sampling, sensor updates are triggered at certain times without being conditioned on the actual sensor signal. Optimal update policies have been researched and it is accepted that periodic updates achieve smaller age-of-information than random updates. We contribute a study of a signal-aware policy, where updates are triggered randomly by a defined sensor event. By definition, this implies random updates and as a consequence inferior age-of-information. Considering a notion of deviation-of-information as a signal-aware metric, our results show, however, that event-triggered systems can perform equally well as time-triggered systems while causing smaller mean network utilization. We use the stochastic network calculus to derive bounds of age- and deviation-of-information that are exceeded at most with a small, defined probability. We include simulation results that confirm the tail decay of the bounds. We also evaluate a hybrid time- and event-triggered policy where the event-triggered system is complemented by a minimal and a maximal update interval.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"164 ","pages":"Article 102412"},"PeriodicalIF":2.2,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0166531624000178/pdfft?md5=8cf8b229cde1a9343b74d531721bff2d&pid=1-s2.0-S0166531624000178-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140170536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On the sensitivity of stationary solutions of Markov regenerative processes","authors":"Junjun Zheng ,&nbsp;Hiroyuki Okamura ,&nbsp;Tadashi Dohi","doi":"10.1016/j.peva.2024.102397","DOIUrl":"10.1016/j.peva.2024.102397","url":null,"abstract":"<div><p><span>Markov regenerative process (MRGP) is favored for modeling and evaluating system dependability due to its </span>high power<span><span><span> and flexibility. However, its analysis presents challenges because of its inherent renewal nature. The embedded Markov chain (EMC) method offers a stationary solution to the MRGP, while the phase expansion approach delivers both stationary and transient solutions. From these solutions, one can derive performance or dependability measures as outputs from the MRGP model. It is crucial to conduct a sensitivity analysis on MRGP to understand the influence of input factor changes on model outputs, aiding efficient system optimization. Yet, a clear analytical method for sensitivity analysis of MRGP models is currently lacking. Filling this gap, this paper introduces an analytical approach to assess </span>parametric sensitivity for steady-state MRGP, utilizing the EMC method for obtaining the stationary solution. Specifically, since </span>system availability closely correlates with the average system available duration, this paper also shifts its focus from mere model parameters to representative values, like the average available time of a system.</span></p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"164 ","pages":"Article 102397"},"PeriodicalIF":2.2,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139659358","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}

{"title":"Stepwise migration of a monolith to a microservice architecture: Performance and migration effort evaluation","authors":"Diogo Faustino ,&nbsp;Nuno Gonçalves ,&nbsp;Manuel Portela ,&nbsp;António Rito Silva","doi":"10.1016/j.peva.2024.102411","DOIUrl":"https://doi.org/10.1016/j.peva.2024.102411","url":null,"abstract":"<div><p>Due to scalability requirements and the split of large software development projects into small agile teams, there is a current trend toward the migration of monolith systems to the microservice architecture. However, the split of the monolith into microservices, its encapsulation through well-defined interfaces, and the introduction of inter-microservice communication add a cost in terms of performance. In this paper, we describe a case study of the migration of a monolith to a microservice architecture, where a modular monolith architecture is used as an intermediate step. The impact on migration effort and performance is measured for both steps. Current state-of-the-art analyses the migration of monolith systems to a microservice architecture, but we observed that migration effort and performance issues are already significant in the migration to a modular monolith. Therefore, a clear distinction is established for each of the steps, which may inform software architects on the planning of the migration of monolith systems. In particular, we consider the trade-offs of doing all the migration process or just migrating to a modular monolith.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"164 ","pages":"Article 102411"},"PeriodicalIF":2.2,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140141848","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}

{"title":"Enhanced performance prediction of ATL model transformations","authors":"Raffaela Groner ,&nbsp;Peter Bellmann ,&nbsp;Stefan Höppner ,&nbsp;Patrick Thiam ,&nbsp;Friedhelm Schwenker ,&nbsp;Hans A. Kestler ,&nbsp;Matthias Tichy","doi":"10.1016/j.peva.2024.102413","DOIUrl":"https://doi.org/10.1016/j.peva.2024.102413","url":null,"abstract":"<div><p>Model transformation languages are domain-specific languages used to define transformations of models. These transformations consist of the translation from one modeling formalism into another or just the updating of a given model. Such transformations are often described declaratively and are often implemented based on very small models that cover the language of the input model. As a result, transformation developers are often unable to assess the time required to transform a larger model.</p><p>Hence, we propose a prediction approach based on machine learning which uses a set of model characteristics as input and provides a prediction of the execution time of a transformation defined in the Atlas Transformation Language (ATL). In our previous work (Groner et al., 2023), we already showed that support vector regression in combination with a model characterization based on the number of model elements, the number of references, and the number of attributes is the best choice in terms of usability and prediction accuracy for the transformations considered in our experiments.</p><p>A major weakness of our previous approach is that it fails to predict the performance of transformations that also transform attribute values of arbitrary length, such as string values. Therefore, we investigate in this work whether an extension of our feature sets that describes the average size of string attributes can help to overcome this weakness.</p><p>Our results show that the random forest approach in combination with model characterizations based on the number of model elements, the number of references, the number of attributes, and the average size of string attributes filtered by the 85th percentile of their variance is the best choice in terms of the simple way to describe a model and the quality of the obtained prediction. With this combination, we obtained a mean absolute percentage error (MAPE) of 5.07% over all modules and a MAPE of 4.82% over all modules excluding the transformation for which our previous approach failed. Whereas, we obtained previously a MAPE of 38.48% over all modules and a MAPE of 4.45% over all modules excluding the transformation for which our previous approach failed.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"164 ","pages":"Article 102413"},"PeriodicalIF":2.2,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S016653162400018X/pdfft?md5=58a866ca1d0c949f2646b2162533ef3f&pid=1-s2.0-S016653162400018X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140555333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Age of information minimization in hybrid cognitive radio networks under a timely throughput constraint","authors":"Mohamed F. El-Sherif ,&nbsp;Sherif I. Rabia ,&nbsp;Ahmed H. Abd El-Malek ,&nbsp;W.K. Zahra","doi":"10.1016/j.peva.2024.102407","DOIUrl":"10.1016/j.peva.2024.102407","url":null,"abstract":"<div><p>Exchanging time-critical information is prevalent in various industrial applications where low latency and timely delivery are paramount. Through this work, we consider a cognitive radio network comprised of multiple secondary users with time-sensitive traffic, and they can access the licensed channel under the hybrid interweave/underlay scheme to enhance spectrum utilization. Traffic in the secondary system is divided into two distinct categories: deadline-constrained data and status updates. Quality of service of data with expiration time, such as multimedia streams, is assessed through the timely throughput metric. However, the age of information metric is used to characterize the freshness of the status update packets, which is vital in several emerging applications. Within an interference constraint imposed by the primary user, a dynamic scheduling policy is proposed to optimize the weighted sum of the average age of information of the status update users under a strict timely throughput requirement for each user with deadline-constrained traffic. We formulate the optimization problem as a constrained Markov decision process. Then, through the drift-plus-penalty method, the problem is reduced into a series of unconstrained Markov decision problems. Finally, each subproblem is tackled using the backward dynamic programming technique. Simulation results illustrate the effect of the main system parameters, such as the PU transmitted power and transmission rate level, on the performance of the secondary system. Moreover, the model feasibility regarding the fulfillment of the constraints against PU activity is experimentally investigated under the proposed hybrid mode and classical interweave mode. The performance of the proposed policy is compared to two other low-complexity scheduling schemes, which ensure the satisfaction of the constraints; results show the performance superiority of our proposed policy.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"164 ","pages":"Article 102407"},"PeriodicalIF":2.2,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139987786","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}

{"title":"Towards the optimal dynamic size-aware dispatching","authors":"Esa Hyytiä ,&nbsp;Rhonda Righter","doi":"10.1016/j.peva.2024.102396","DOIUrl":"10.1016/j.peva.2024.102396","url":null,"abstract":"<div><p>In this paper, we study dispatching systems that appear in manufacturing, service, healthcare systems, as well as, in various information, communication and computer systems. Such systems comprise a dispatcher and a pool of parallel servers, to which jobs are assigned upon arrival. A common objective is to minimize the mean waiting or response time. In large systems, due to the state-space explosion and scalability reasons, it is impossible to utilize full state information of the system. We therefore consider systems with a small number of servers, and assume that the job sizes become known upon arrival. In such settings, it is plausible to carefully evaluate each server for every new job. First we study a system with a Poisson arrival process, and derive Bellman equations. Then we generalize to the case with general i.i.d. inter-arrival times. The Bellman equations are essentially functional equations that can be solved numerically via value iteration. From their solutions, the optimal dispatching policy and corresponding mean performance can be determined. Our solution framework is illustrated with examples, which show that significant performance gains compared to popular heuristic policies are available in our setting.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"164 ","pages":"Article 102396"},"PeriodicalIF":2.2,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139585222","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}

{"title":"Accelerating multi-tier storage cache simulations using knee detection","authors":"Tyler Estro ,&nbsp;Mário Antunes ,&nbsp;Pranav Bhandari ,&nbsp;Anshul Gandhi ,&nbsp;Geoff Kuenning ,&nbsp;Yifei Liu ,&nbsp;Carl Waldspurger ,&nbsp;Avani Wildani ,&nbsp;Erez Zadok","doi":"10.1016/j.peva.2024.102410","DOIUrl":"https://doi.org/10.1016/j.peva.2024.102410","url":null,"abstract":"<div><p>Storage cache hierarchies include diverse topologies, assorted parameters and policies, and devices with varied performance characteristics. Simulation enables efficient exploration of their configuration space while avoiding expensive physical experiments. Miss Ratio Curves (MRCs) efficiently characterize the performance of a cache over a range of cache sizes, revealing “key points” for cache simulation, such as knees in the curve that immediately follow sharp cliffs. Unfortunately, there are no automated techniques for efficiently finding key points in MRCs, and the cross-application of existing knee-detection algorithms yields inaccurate results.</p><p>We present a multi-stage framework that identifies key points in <em>any</em> MRC, for both stack-based (<em>e.g.</em>, LRU) and more sophisticated eviction algorithms (<em>e.g.</em>, ARC). Our approach quickly locates candidates using efficient hash-based sampling, curve simplification, knee detection, and novel post-processing filters. We introduce <em>Z-Method</em>, a new multi-knee detection algorithm that employs statistical outlier detection to choose promising points robustly and efficiently.</p><p>We evaluated our framework against seven other knee-detection algorithms, identifying key points in multi-tier MRCs with both ARC and LRU policies for 106 diverse real-world workloads. Compared to naïve approaches, our framework reduced the total number of points needed to accurately identify the best two-tier cache hierarchies by an average factor of approximately <span><math><mrow><mn>5</mn><mo>.</mo><mn>5</mn><mo>×</mo></mrow></math></span> for ARC and <span><math><mrow><mn>7</mn><mo>.</mo><mn>7</mn><mo>×</mo></mrow></math></span> for LRU.</p><p>We also show how our framework can be used to seed the initial population for evolutionary algorithms. We ran 32,616 experiments requiring over three million cache simulations, on 151 samples, from three datasets, using a diverse set of population initialization techniques, evolutionary algorithms, knee-detection algorithms, cache replacement algorithms, and stopping criteria. Our results showed an overall acceleration rate of 34% across all configurations.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"164 ","pages":"Article 102410"},"PeriodicalIF":2.2,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140069358","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}

{"title":"Average delay analysis of soft deadline messages scheduled in the dynamic segment of FlexRay protocol","authors":"Sunil Kumar P.R. ,&nbsp;Vinod V. ,&nbsp;Manjunath A.S.","doi":"10.1016/j.peva.2024.102404","DOIUrl":"10.1016/j.peva.2024.102404","url":null,"abstract":"<div><p><span>The FlexRay<span> communication protocol provides high bandwidth for supporting both hard deadline and soft deadline traffic in in-vehicle communication networks. In this paper, we carry out delay analysis of soft deadline traffic which is handled by the dynamic segment of FlexRay. We model the arrival of these messages as Poisson processes, and use queuing theory to evaluate the average delay that they experience. Initially, we consider three nodes competing for service, assuming that two out of three can transmit messages in any FlexRay cycle and obtain expressions for the evolution of the corresponding queues. We also determine the range of message </span></span>arrival rates for which the queues are stable. These results are then extended to the general case of N queues. The analytical results are compared with those obtained by simulation for a typical system.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"164 ","pages":"Article 102404"},"PeriodicalIF":2.2,"publicationDate":"2024-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139656073","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}