2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)最新文献

Simulation Modeling of Zoom Network Traffic 变焦网络流量仿真建模

2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2022-10-01 DOI: 10.1109/MASCOTS56607.2022.00016

Mehdi Karamollahi, C. Williamson

引用次数: 1

Securing OFDMA in V2V Communication Among Untrusted Platoons 不可信排间V2V通信中OFDMA的安全保护

2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2022-10-01 DOI: 10.1109/MASCOTS56607.2022.00027

Ruotong Zhao, Deepak Mishra, Aruna Seneviratne

{"title":"Securing OFDMA in V2V Communication Among Untrusted Platoons","authors":"Ruotong Zhao, Deepak Mishra, Aruna Seneviratne","doi":"10.1109/MASCOTS56607.2022.00027","DOIUrl":"https://doi.org/10.1109/MASCOTS56607.2022.00027","url":null,"abstract":"With the Internet of Things becoming an essential part of our lives, Vehicle-to-vehicle (V2V) communication is becoming very popular to meet the growing demands of having an Intelligent Transportation System (ITS). However, ensuring secure V2V communication is the key to realizing the full potential and utility of ITS. Therefore, this paper develops a secure framework for orthogonal frequency division multiple access (OFDMA) based V2V communication among the untrusted platoons. Specifically, we propose optimal subcarrier and power allocation policies to maximize the sum secrecy rate across the vehicles which share the subcarriers with the vehicles outside their platoons. We start with allocating sub-carriers to the vehicles inside each platoon based on their underlying channel power gains. After that, noting the non-convexity of the power allocation problem, we propose a high signal-to-interference-plus-noise ratio-based transformation to develop two optimal power control policies. While both are based on fractional programming (FP), one yield closed-form power allocation and the other provides the optimal global solution numerically at a higher computational complexity. Lastly, the numerical simulations verify the analytical claims, provide key design insights and demonstrate that our proposed power control policies can improve the sum secrecy rate of benchmark schemes by over 4dB for the eight vehicles setting.","PeriodicalId":220026,"journal":{"name":"2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121903164","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

Surrogate Models for Markov Reward Models with Uncertain Parameters 参数不确定马尔可夫奖励模型的代理模型

2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2022-10-01 DOI: 10.1109/MASCOTS56607.2022.00025

P. Buchholz

引用次数: 0

On the Impact of Internal Webpage Selection when Evaluating Ad Blocker Performance 评估广告拦截器性能时内部网页选择的影响

2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2022-10-01 DOI: 10.1109/MASCOTS56607.2022.00014

Philip Gunnarsson, Adam Jakobsson, Niklas Carlsson

{"title":"On the Impact of Internal Webpage Selection when Evaluating Ad Blocker Performance","authors":"Philip Gunnarsson, Adam Jakobsson, Niklas Carlsson","doi":"10.1109/MASCOTS56607.2022.00014","DOIUrl":"https://doi.org/10.1109/MASCOTS56607.2022.00014","url":null,"abstract":"Not all ad blockers achieve the same blocking success and, depending on their implementation, they can either improve or hurt the web performance experienced by users. Borgolte and Feamster (2020) recently provided the first extensive evaluation of how privacy-focused browser extensions affect a user's web performance. However, while their work provides a nice comparison of the performance impact that different extensions may have, their evaluation only considered landing pages of a single set of websites. In this paper, we focus specifically on performance comparisons when considering different sets of webpages. For example, we study the impact of whether a page is a landing page or an internal page, whether a page is popular or less popular, as well as the impact of in which country/region the company registering the website is operating (used as a proxy for the primary target market). For our evaluations, we use pairs of webpages carefully selected from the recently proposed Hispar list (Aqeel et al. 2020) and compare the performance of the most popular blocking extensions (Ad block Plus, uBlock Origin, Ghostery, and Private Badger) considered by Borgolte and Feamster with a baseline case in which we do not use any extension. While we observe clear differences in the distribution statistics of the metrics considered, several observations were consistent across all dimensions, including whether we consider landing pages or internal pages. The paper highlights some of these invariants and discusses their implications. In addition, our measurements (and the differences observed by different ad-blockers) also reveal new insights into how internal vs. landing pages of different web page categories (e.g., based on popularity or region) differ in their composition and resource usage.","PeriodicalId":220026,"journal":{"name":"2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128641595","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}

引用次数: 1

Orchestrating Heterogeneous Cyber-range Event Chains With Serverless-container Workflow 使用无服务器容器工作流编排异构网络范围事件链

2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2022-10-01 DOI: 10.1109/MASCOTS56607.2022.00021

Yongquan Fu, Weihong Han, Dong Yuan

{"title":"Orchestrating Heterogeneous Cyber-range Event Chains With Serverless-container Workflow","authors":"Yongquan Fu, Weihong Han, Dong Yuan","doi":"10.1109/MASCOTS56607.2022.00021","DOIUrl":"https://doi.org/10.1109/MASCOTS56607.2022.00021","url":null,"abstract":"Cyber ranges need to run versatile network applications to increase the fidelity of the tests. With the growing complexity of cyberspace events that involve tens to hundreds of diverse applications and flexible execution orders of applications, it is increasingly challenging to orchestrate large-scale, complicated chains of heterogeneous Internet applications. State-of-the-art orchestration techniques do not scale out well due to the inefficient representation model and scheduling of network-centric and correlated Internet application activities. We present a serverless-container workflow orchestration scheme called Wukong. First, we overcome the heterogeneity of events with a workflow model that encodes event chains with compositional DAGs and unified serverless-container event triggers. Second, Wukong scales the scheduling of serverless-container workflows by automatically decomposing DAGs and push-pull coordinated event executions over distributed serverless-container runtime agents. Our evaluation on a real-world cyber range shows that Wukong is expressive, scalable and efficient for automatically emulating diverse event chains, in that the compositional modeling reduces the storage footprint over 57 to 58 times compared to baseline models, the response delay of Wukong is 1.52 to 2.74 times shorter than state-of-the-art orchestration engines, and the scheduling delay is 1.14 to 2.16 times smaller than those of the baseline approach.","PeriodicalId":220026,"journal":{"name":"2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"01 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127282852","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

Energy Optimal Activation of Processors for the Execution of a Single Task with Unknown Size 执行未知大小单任务的处理器能量最优激活

2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2022-10-01 DOI: 10.1109/MASCOTS56607.2022.00017

Jonatha Anselmi, B. Gaujal

{"title":"Energy Optimal Activation of Processors for the Execution of a Single Task with Unknown Size","authors":"Jonatha Anselmi, B. Gaujal","doi":"10.1109/MASCOTS56607.2022.00017","DOIUrl":"https://doi.org/10.1109/MASCOTS56607.2022.00017","url":null,"abstract":"A key objective in the management of modern computer systems consists in minimizing the electrical energy consumed by processing resources while satisfying certain target performance criteria. In this paper, we consider the execution of a single task with unknown size on top of a service system that offers a limited number of processing speeds, say $N$, and investigate the problem of finding a speed profile that minimizes the resulting energy consumption subject to a deadline constraint. Existing works mainly investigated this problem when speed profiles are continuous functions. In contrast, the novelty of our work is to consider discontinuous speed profiles, i.e., a case that arises naturally when the underlying computational platform offers a finite number of speeds. In our main result, we show that the computation of an optimal speed profile boils down to solving a convex optimization problem. Under mild assumptions, for such convex optimization we prove some structural results that yield the formulation of an extremely efficient solution algorithm. Specifically, we show that the optimal speed profile can be computed by solving $O(log N)$ one-dimensional equations. Our results hold when the task size follows a known probability distribution function and the set of available speeds, if listed in increasing order, forms a sublinear concave sequence.","PeriodicalId":220026,"journal":{"name":"2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130107448","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}

引用次数: 1

RAST: Evaluating Performance of a Legacy System Using Regression Analysis and Simulation RAST:使用回归分析和仿真评估遗留系统的性能

2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2022-10-01 DOI: 10.1109/MASCOTS56607.2022.00015

Juri Tomak, S. Gorlatch

{"title":"RAST: Evaluating Performance of a Legacy System Using Regression Analysis and Simulation","authors":"Juri Tomak, S. Gorlatch","doi":"10.1109/MASCOTS56607.2022.00015","DOIUrl":"https://doi.org/10.1109/MASCOTS56607.2022.00015","url":null,"abstract":"A challenging aspect in developing and deploying distributed systems with strict real-time constraints is how to evaluate the performance of the system running in a production environment without disrupting its regular operation. The challenge is even greater when the System Under Evaluation (SUE) is a poorly documented legacy system with database-centric architecture that works within a resource-sharing environment. Current performance evaluation methods dealing with this challenge require live monitoring software or distributed tracing software tools that are typically unavailable in legacy systems and hard to establish. In this paper, we propose an alternative approach RAST (Regression Analysis, Simulation, and load Testing); it evaluates the response time as the major performance characteristic of a distributed real-time legacy system using the available system's log files. Our use case is a commercial alarm system in productive use that is provided and further developed by the GS company group in Germany. We show in extensive experiments that our approach allows to adequately estimate to what degree the workload of a legacy production system can rise in the future while complying with the strict requirements on the response time. We provide a GitHub repository with non-proprietary parts of our predictive model generation, simulation, and load testing software to reproduce our experiments.","PeriodicalId":220026,"journal":{"name":"2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115405584","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

IFLustre: Towards Interference-Free and Efficient Storage Allocation in Distributed File System 面向分布式文件系统的无干扰高效存储分配

2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2022-10-01 DOI: 10.1109/MASCOTS56607.2022.00022

Sunggon Kim, D. Sung, Yongseok Son

{"title":"IFLustre: Towards Interference-Free and Efficient Storage Allocation in Distributed File System","authors":"Sunggon Kim, D. Sung, Yongseok Son","doi":"10.1109/MASCOTS56607.2022.00022","DOIUrl":"https://doi.org/10.1109/MASCOTS56607.2022.00022","url":null,"abstract":"Distributed file systems (DFSs) are widely used in large scale computing environments such as cloud computing and high performance computing systems (HPC) where thousands of applications are executed simultaneously. To support applications that produce and process a large amount of data, DFSs manage limited storage resources in the system and allocate the resources to the applications. To efficiently utilize limited storage resources, it is important to consider the I/O characteristics of applications as well as the effect of resource sharing among multiple applications in the system. In this paper, we first perform empirical performance analysis and investigate the effect of I/O interference caused by storage resource allocation. Based on our empirical performance analysis, we propose IFLustre towards interference-free and efficient storage allocation in Lustre file system. IFLustre first utilizes previous execution logs to determine the necessary storage resources for the application and predict the throughput and runtime of the application. Then, it allocates storage resources via file system configurations based on the prediction results and the DFS allocation status. This allows IFLustre to allocate sufficient resources to the application while mitigating interference from resource sharing. The experimental results show that IFLustre can improve the performance by up to 47% compared with Lustre.","PeriodicalId":220026,"journal":{"name":"2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114548888","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

Foreword: MASCOTS 2022 前言:2022年奥运会吉祥物

2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2022-10-01 DOI: 10.1109/mascots56607.2022.00005

引用次数: 0

Efficient Error-Bounded Lossy Compression for CPU Architectures CPU架构的有效错误有界有损压缩

2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2022-10-01 DOI: 10.1109/MASCOTS56607.2022.00020

Griffin Dube, Jiannan Tian, S. Di, Dingwen Tao, Jon C. Calhoun, F. Cappello

{"title":"Efficient Error-Bounded Lossy Compression for CPU Architectures","authors":"Griffin Dube, Jiannan Tian, S. Di, Dingwen Tao, Jon C. Calhoun, F. Cappello","doi":"10.1109/MASCOTS56607.2022.00020","DOIUrl":"https://doi.org/10.1109/MASCOTS56607.2022.00020","url":null,"abstract":"Modern HPC applications produce increasingly large amounts of data, which limits the performance of current extreme-scale systems. Lossy compression, helps to mitigate this issue by decreasing the size of data generated by these applications. SZ, a current state-of-the-art lossy compressor, is able to achieve high compression ratios, but its prediction/quantization methods contain RAW dependencies that prevent parallelizing this step of the compression. Recent work proposes a parallel dual prediction/quantization algorithm for GPUs which removes these dependencies. However, some HPC systems and applications do not use GPUs, and could still benefit from the fine-grained parallelism of this method. Using the dual-quantization technique, we implement and optimize a SIMD vectorized CPU version of SZ (vecSZ), and create a heuristic for selecting the optimal block size and vector length. We propose a novel block padding algorithm to decrease the number of unpredictable values along compression block borders and find it reduces the number of prediction outliers by up to 100%. We measure performance of our vecSZ against an CPU version of SZ using dual-quantization, pSZ, as well as SZ-1.4. Using real-world scientific datasets, we evaluate vecSZ on the Intel Skylake and AMD Rome architectures. vecSZ results in up to 32% improvement in rate-distortion and up to 15× speedup over SZ-1.4, achieving a prediction and quantization bandwidth in excess of 3.4 GB/s.","PeriodicalId":220026,"journal":{"name":"2022 30th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127463600","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}

引用次数: 1