Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools最新文献_第3页

Partial Observed Fluid Queue Model for Rechargeable Batteries 可充电电池的部分观测流体队列模型

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-05-18 DOI: 10.1145/3388831.3388856

S. Dharmaraja, P. Tardelli

引用次数: 0

Regulating Workers in Federated Learning by Yardstick Competition 用尺度竞争规范联邦学习中的劳动者

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-05-18 DOI: 10.1145/3388831.3388843

Y. Sarikaya, Özgür Erçetin

引用次数: 4

Scalable Markov Decision Process Model for Advanced Sleep Modes Management in 5G Networks 5G网络高级睡眠模式管理的可扩展马尔可夫决策过程模型

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-05-18 DOI: 10.1145/3388831.3388852

F. Salem, T. Chahed, E. Altman, A. Gati, Z. Altman

引用次数: 2

Deriving Explicit Control Policies for Markov Decision Processes Using Symbolic Regression 用符号回归推导马尔可夫决策过程的显式控制策略

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-05-18 DOI: 10.1145/3388831.3388840

A. Hristov, J. Bosman, S. Bhulai, R. Mei

引用次数: 2

Quality-Dependent Stochastic Networks: Is FIFO Always Better Than LIFO? 质量相关随机网络:先进先出总是比后进先出好吗?

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-05-18 DOI: 10.1145/3388831.3388838

Y. Liberman, U. Yechiali

{"title":"Quality-Dependent Stochastic Networks: Is FIFO Always Better Than LIFO?","authors":"Y. Liberman, U. Yechiali","doi":"10.1145/3388831.3388838","DOIUrl":"https://doi.org/10.1145/3388831.3388838","url":null,"abstract":"In various service and production systems, such as metal processing, fresh food industry, polymer forming, etc., the quality of the final product is a function of its total sojourn time in the system. We consider (i) an M/G/1-type single-server queue, as well as (ii) open tandem Jackson networks, and analyze the quality of products traversing through each system under two service disciplines -- FIFO and LIFO. Although the mean sojourn times in an M/G/1 queue are equal under both service disciplines (that is, E [WLIFO] = E [WFIFO]), the variance of WLIFO is larger than the variance of WFIFO. We show that, when quality is the measure of performance, FIFO is not necessarily better than LIFO. We consider several service-time distributions and show under what values of the parameters one discipline is better (or worse) than the other. In particular, the mean quality under LIFO is better than the mean quality under FIFO for all values of the traffic intensity. Moreover, the mean quality under the FIFO service regime drops sharply to 0 when the traffic intensity approaches 1, while the mean quality under LIFO is bounded below. Numerical results as functions of the system parameters are presented and discussed for both the M/G/1 queue and the tandem Jackson network.","PeriodicalId":419829,"journal":{"name":"Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124526080","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}

引用次数: 0

Change Rate Estimation and Optimal Freshness in Web Page Crawling 网页抓取的变化率估计和最优新鲜度

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-04-05 DOI: 10.1145/3388831.3388846

Konstantin Avrachenkov, K. Patil, Gugan Thoppe

{"title":"Change Rate Estimation and Optimal Freshness in Web Page Crawling","authors":"Konstantin Avrachenkov, K. Patil, Gugan Thoppe","doi":"10.1145/3388831.3388846","DOIUrl":"https://doi.org/10.1145/3388831.3388846","url":null,"abstract":"For providing quick and accurate results, a search engine maintains a local snapshot of the entire web. And, to keep this local cache fresh, it employs a crawler for tracking changes across various web pages. However, finite bandwidth availability and server restrictions impose some constraints on the crawling frequency. Consequently, the ideal crawling rates are the ones that maximise the freshness of the local cache and also respect the above constraints. Azar et al. [2] recently proposed a tractable algorithm to solve this optimisation problem. However, they assume the knowledge of the exact page change rates, which is unrealistic in practice. We address this issue here. Specifically, we provide two novel schemes for online estimation of page change rates. Both schemes only need partial information about the page change process, i.e., they only need to know if the page has changed or not since the last crawled instance. For both these schemes, we prove convergence and, also, derive their convergence rates. Finally, we provide some numerical experiments to compare the performance of our proposed estimators with the existing ones (e.g., MLE).","PeriodicalId":419829,"journal":{"name":"Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134338457","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}

引用次数: 7

Hypothesis Testing Approach to Detecting Collusion in Competitive Environments 竞争环境中合谋检测的假设检验方法

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-03-22 DOI: 10.1145/3388831.3388847

P. Hespanhol, A. Aswani

引用次数: 1

Performance Analysis of Load Balancing Policies with Memory 带内存的负载均衡策略性能分析

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2020-02-17 DOI: 10.1145/3388831.3388839

T. Hellemans, B. V. Houdt

{"title":"Performance Analysis of Load Balancing Policies with Memory","authors":"T. Hellemans, B. V. Houdt","doi":"10.1145/3388831.3388839","DOIUrl":"https://doi.org/10.1145/3388831.3388839","url":null,"abstract":"Joining the shortest or least loaded queue among d randomly selected queues are two fundamental load balancing policies. Under both policies the dispatcher does not maintain any information on the queue length or load of the servers. In this paper we analyze the performance of these policies when the dispatcher has some memory available to store the ids of some of the idle servers. We consider methods where the dispatcher discovers idle servers as well as methods where idle servers inform the dispatcher about their state. We focus on large-scale systems and our analysis uses the cavity method. The main insight provided is that the performance measures obtained via the cavity method for a load balancing policy with memory reduce to the performance measures for the same policy without memory provided that the arrival rate is properly scaled. Thus, we can study the performance of load balancers with memory in the same manner as load balancers without memory. In particular this entails closed form solutions for joining the shortest or least loaded queue among d randomly selected queues with memory in case of exponential job sizes. We present simulation results that support our belief that the approximation obtained by the cavity method becomes exact as the number of servers tends to infinity.","PeriodicalId":419829,"journal":{"name":"Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122646751","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}

引用次数: 7

Stability of Redundancy Systems with Processor Sharing 具有处理器共享的冗余系统的稳定性

Proceedings of the 13th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2019-12-02 DOI: 10.1145/3388831.3388837

Y. Raaijmakers, S. Borst, O. Boxma

引用次数: 12