Performance Evaluation最新文献_第7页

Age of information minimization in hybrid cognitive radio networks under a timely throughput constraint 及时吞吐量约束下混合认知无线电网络的信息最小化时代

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2024-02-23 DOI: 10.1016/j.peva.2024.102407

Mohamed F. El-Sherif , Sherif I. Rabia , Ahmed H. Abd El-Malek , W.K. Zahra

{"title":"Age of information minimization in hybrid cognitive radio networks under a timely throughput constraint","authors":"Mohamed F. El-Sherif , Sherif I. Rabia , Ahmed H. Abd El-Malek , 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-02-23","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}

引用次数: 0

Average delay analysis of soft deadline messages scheduled in the dynamic segment of FlexRay protocol 在 FlexRay 协议动态段中调度的软截止时间报文的平均延迟分析

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2024-01-30 DOI: 10.1016/j.peva.2024.102404

Sunil Kumar P.R. , Vinod V. , Manjunath A.S.

引用次数: 0

On the sensitivity of stationary solutions of Markov regenerative processes 论马尔可夫再生过程静止解的敏感性

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2024-01-29 DOI: 10.1016/j.peva.2024.102397

Junjun Zheng , Hiroyuki Okamura , Tadashi Dohi

{"title":"On the sensitivity of stationary solutions of Markov regenerative processes","authors":"Junjun Zheng , Hiroyuki Okamura , 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-01-29","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}

引用次数: 0

Towards the optimal dynamic size-aware dispatching 实现最佳动态规模感知调度

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2024-01-26 DOI: 10.1016/j.peva.2024.102396

Esa Hyytiä , Rhonda Righter

{"title":"Towards the optimal dynamic size-aware dispatching","authors":"Esa Hyytiä , 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-01-26","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}

引用次数: 0

Decentralized fault tolerant source localization without sensor parameters in wireless sensor networks 无线传感器网络中无需传感器参数的分散容错源定位

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2023-12-08 DOI: 10.1016/j.peva.2023.102395

Akram Hussain, Yuan Luo

{"title":"Decentralized fault tolerant source localization without sensor parameters in wireless sensor networks","authors":"Akram Hussain, Yuan Luo","doi":"10.1016/j.peva.2023.102395","DOIUrl":"10.1016/j.peva.2023.102395","url":null,"abstract":"<div><p>In this paper, we study the source (event) localization problem in decentralized wireless sensor networks (WSNs) under faulty sensor nodes without knowledge of the sensor parameters. Source localization has many applications, such as localizing WiFi hotspots and mobile users. Some works in the literature localize the source by utilizing the knowledge or estimates of the fault probability of each sensor node or the region of influence of the source. However, this paper proposes two approaches: the hitting set and feature selection for estimating the source location without any knowledge of the sensor parameters under faulty sensor nodes in WSN. The proposed approaches provide better or comparable source localization performances. For the hitting set approach, we also derive a lower bound on the required number of samples. In addition, we extend the proposed methods for localizing multiple sources. Finally, we provide extensive simulations to illustrate the performances of the proposed methods against the centroid, maximum likelihood (ML), fault-tolerant ML (FTML), and subtract on negative add on positive (SNAP) estimators. The proposed approaches significantly outperform the centroid and maximum likelihood estimators for faulty sensor nodes while providing comparable or better performance to FTML or SNAP algorithm. In addition, we use real-world WiFi data set to localize the source in comparison to the support vector machine based estimator in the literature, where the proposed methods outperformed the estimator.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"163 ","pages":"Article 102395"},"PeriodicalIF":2.2,"publicationDate":"2023-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0166531623000652/pdfft?md5=917546a42fc91c4d2235d2f09f3e4318&pid=1-s2.0-S0166531623000652-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138553529","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}

引用次数: 0

Two families of indexable partially observable restless bandits and Whittle index computation 两类可转位的部分可观测的不动匪和Whittle指数计算

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2023-12-02 DOI: 10.1016/j.peva.2023.102394

Nima Akbarzadeh, Aditya Mahajan

引用次数: 0

The effect of network delays on Distributed Ledgers based on Directed Acyclic Graphs: A mathematical model 基于有向无环图的分布式账本网络时延影响:一个数学模型

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2023-11-25 DOI: 10.1016/j.peva.2023.102392

Navdeep Kumar , Alexandre Reiffers-Masson , Isabel Amigo , Santiago Ruano Rincón

{"title":"The effect of network delays on Distributed Ledgers based on Directed Acyclic Graphs: A mathematical model","authors":"Navdeep Kumar , Alexandre Reiffers-Masson , Isabel Amigo , Santiago Ruano Rincón","doi":"10.1016/j.peva.2023.102392","DOIUrl":"https://doi.org/10.1016/j.peva.2023.102392","url":null,"abstract":"<div><p>We present a new stochastic model for the evolution of Directed Acyclic Graphs (DAG)-based distributed ledgers (DL), under the presence of heterogeneous delay. This model is used to analyse the performance metrics of the DL, showing in particular that the number of unapproved messages, in expectation, does not diverge to infinity, even under the presence of delay. We propose an analysis based on conveniently defined sets, as well as an alternative drift-based analysis. The former allows to get a bound on the average number of unapproved messages, while the latter, through a simpler analysis, allows to prove the existence of such bound. For particular scenarios, we are able to derive the expected value of the drift of unapproved messages, through a Markov process-based approach. State-of-the-art mathematical models trying to capture the impact of delays on the performance of such DLs rely on some particular simplifications. In contrast, through our model, we are able to analytically derive similar performance guarantees, in a more realistic setup. In particular, we focus on IOTA foundation’s tangle, while our results can be extended to other DAG-based distributed ledgers. We compare our results to results obtained in a real testbed, showing good accordance between them.</p></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"163 ","pages":"Article 102392"},"PeriodicalIF":2.2,"publicationDate":"2023-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0166531623000627/pdfft?md5=418849af0d02f48109fd2defe85bc15f&pid=1-s2.0-S0166531623000627-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138474715","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}

引用次数: 0

Editorial: Special issue on IFIP performance 2023 社论:关于2023年IFIP绩效的特刊

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2023-11-19 DOI: 10.1016/j.peva.2023.102393

引用次数: 0

Marginal and joint distribution of inter-departure times for a PH/PH/c queue PH/PH/c队列出发时间的边际和联合分布

IF 2.2 4区计算机科学

Performance Evaluation Pub Date : 2023-11-04 DOI: 10.1016/j.peva.2023.102383

Ruth Sagron , Yoav Kerner

引用次数: 0

Fixed confidence community mode estimation 固定置信度社区模式估计

IF 2.2 4区计算机科学