2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)最新文献_第6页

Pilot: A Framework that Understands How to Do Performance Benchmarks the Right Way 试点:了解如何以正确的方式进行性能基准测试的框架

2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2016-09-01 DOI: 10.1109/MASCOTS.2016.31

Yan Li, Yash Gupta, E. L. Miller, D. Long

{"title":"Pilot: A Framework that Understands How to Do Performance Benchmarks the Right Way","authors":"Yan Li, Yash Gupta, E. L. Miller, D. Long","doi":"10.1109/MASCOTS.2016.31","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.31","url":null,"abstract":"Carrying out even the simplest performance benchmark requires considerable knowledge of statistics and computer systems, and painstakingly following many error-prone steps, which are distinct skill sets yet essential for getting statistically valid results. As a result, many performance measurements in peer-reviewed publications are flawed. Among many problems, they fall short in one or more of the following requirements: accuracy, precision, comparability, repeatability, and control of overhead. This is a serious problem because poor performance measurements misguide system design and optimization. We propose a collection of algorithms and heuristics to automate these steps. They cover the collection, storing, analysis, and comparison of performance measurements. We implement these methods as a readily-usable open source software framework called Pilot, which can help to reduce human error and shorten benchmark time. Evaluation of Pilot on various benchmarks show that it can reduce the cost and complexity of running benchmarks, and can produce better measurement results.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124417256","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}

引用次数: 6

Is Multipath TCP (MPTCP) Beneficial for Video Streaming over DASH? 多路径TCP (MPTCP)对DASH上的视频流有利吗?

2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2016-09-01 DOI: 10.1109/MASCOTS.2016.75

Cyriac James, Emir Halepovic, Mea Wang, R. Jana, N. K. Shankaranarayanan

{"title":"Is Multipath TCP (MPTCP) Beneficial for Video Streaming over DASH?","authors":"Cyriac James, Emir Halepovic, Mea Wang, R. Jana, N. K. Shankaranarayanan","doi":"10.1109/MASCOTS.2016.75","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.75","url":null,"abstract":"HTTP-based adaptive protocols dominate today's video streaming over the Internet, and operate using multiple quality levels that video players request one segment at a time. Despite their popularity, studies have shown that performance of video streams still suffers from stalls, quality switches and startup delay. In wireless networks, it is well-known that high variability in network bandwidth affects video streaming. MultiPath TCP (MPTCP) is an emerging paradigm that could offer significant benefits to video streaming by combining bandwidth on multiple network interfaces, in particular for mobile devices that typically support both WiFi and cellular networks. In this paper, we explore whether MPTCP always benefits mobile video streaming. Our experimental study on video streaming using two wireless interfaces yields mixed results. While beneficial to user experience under ample and stable bandwidth, MPTCP may not offer any advantage under some network conditions. We find that when additional bandwidth on the secondary path is not sufficient to sustain an upgrade in video quality, it is generally better not to use MPTCP. We also identify that MPTCP can harm user experience when an unstable secondary path is added to the stable primary path.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131215287","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}

引用次数: 25

LayerMover: Storage Migration of Virtual Machine across Data Centers Based on Three-Layer Image Structure LayerMover:基于三层镜像结构的虚拟机跨数据中心存储迁移

2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2016-09-01 DOI: 10.1109/MASCOTS.2016.27

Fei Zhang, Xiaoming Fu, R. Yahyapour

{"title":"LayerMover: Storage Migration of Virtual Machine across Data Centers Based on Three-Layer Image Structure","authors":"Fei Zhang, Xiaoming Fu, R. Yahyapour","doi":"10.1109/MASCOTS.2016.27","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.27","url":null,"abstract":"Live Virtual Machine (VM) migration across data centers is an important support technology which will bring benefits to both cloud providers and users. At present, VM storage migration becomes the bottleneck of this technology as it explores only the static data feature of image files without much consideration on data semantics. In this paper, we propose a new space-efficient VM image structure-three-layer structure. According to different functions and features, the data of a VM are separated into an Operating System (OS) layer, a Working Environment (WE) layer, and a User Data (UD) layer. On basis of three-layer image structure, we design a novel VM storage migration system-LayerMover. It tries to improve the migration performance through optimizing current data deduplication methods. To evaluate the potential performance gains of LayerMover, we explore the similarity features of WE layer data. Our experimental results show that the similarity ratio between different images can reach 70%. Our experiments about the VM storage migration performance of LayerMover show that it can be 27% faster than current migration methods for twolayer image structures under our experimental environments. When migrating a VM in a second round or migrating a batch of VMs, LayerMover will see more performance improvement.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124085504","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}

引用次数: 10

Parallel Graph Processing on Modern Multi-core Servers: New Findings and Remaining Challenges 现代多核服务器上的并行图处理:新发现和遗留挑战

2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2016-09-01 DOI: 10.1109/MASCOTS.2016.66

Assaf Eisenman, L. Cherkasova, Guilherme Magalhaes, Qiong Cai, S. Katti

{"title":"Parallel Graph Processing on Modern Multi-core Servers: New Findings and Remaining Challenges","authors":"Assaf Eisenman, L. Cherkasova, Guilherme Magalhaes, Qiong Cai, S. Katti","doi":"10.1109/MASCOTS.2016.66","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.66","url":null,"abstract":"Big Data analytics and new problems in social networks, computational biology, and web connectivity led to a renewed research interest in graph processing. Due to \"irregularity\" of graph computations, efficient parallel graph processing faces a set of software and hardware challenges debated in literature. In this paper, by utilizing hardware performance counters, we characterize system bottlenecks, resource usage, and the efficiency of popular graph applications on the modern commodity hardware. We analyze selected graph applications (implemented in the Galois framework) on a variety of graph datasets: both scale-free graphs and meshes. Our profiling shows that with an increased number of cores the analyzed graph applications achieve a good speedup, which is highly correlated with utilized memory bandwidth. Contrary to traditional past stereotypes, we find that graph applications significantly benefit from hardware prefetchers. Moreover, the use of transparent huge pages (THP) exhibits a \"double win\" impact: (1) THP significantly decrease the TLB misses and page walk durations, and (2) THP boost the hardware prefetchers' performance. These insights shed light to understand the performance of emerging systems with large memories. Our profiling framework reports hardware counter values over time. It reveals the danger of using averages for a bottleneck and resource usage analysis: many applications have a time-varying behavior and stretch the usage of system resources to their peak. We discuss the new insights and remaining challenges for guiding the design of future hardware and software components for efficient graph processing.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122814117","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}

引用次数: 12

QoS-Aware CAPEX Minimization in Urban Off-Grid Radio Access Networks 城市离网无线接入网络中qos感知的资本支出最小化

2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2016-09-01 DOI: 10.1109/MASCOTS.2016.50

G. Rizzo, M. Marsan

{"title":"QoS-Aware CAPEX Minimization in Urban Off-Grid Radio Access Networks","authors":"G. Rizzo, M. Marsan","doi":"10.1109/MASCOTS.2016.50","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.50","url":null,"abstract":"Network densification is currently seen as one of the key techniques enabling Radio Access Networks (RANs) to meet the performance and functional requirements of the 5G paradigm in urban areas. Avoiding the connection of small cells to the power grid facilitates their deployment and reduces both capital and operational expenditures (CAPEX and OPEX). In this paper, we propose an approach to enable net-Zero Energy Networking (ZEN) in urban scenarios, based on dynamically managing the operating point of Base Stations (BSs), so as to drastically decrease their overall energy requirements. More specifically, we formalize the problem of optimizing the CAPEX of a ZEN, while guaranteeing quality of service (QoS) and a given level of service availability. Optimization is over power system parameters (solar panel area, battery capacity) as well as over BS power levels and user association over time. We propose a practical algorithm for the derivation of QoS-aware spatio-temporal strategies in terms of user association and BS power allocation, which, for a given expected pattern of renewable power generation, minimize the probability of service unavailability due to power shortage. Through extensive simulations using measured data, and realistic BS deployments, we show that our algorithm leads to substantial reduction in CAPEX, and to feasible power system requirements.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"177 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114084321","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

Exact Analysis of Energy-Aware Multiserver Queueing Systems with Setup Times 具有设置时间的能量感知多服务器排队系统的精确分析

2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2016-09-01 DOI: 10.1109/MASCOTS.2016.47

Vincent J. Maccio, D. Down

引用次数: 29

Experimental Calibration and Validation of a Speed Scaling Simulator 速度缩放模拟器的实验标定与验证

2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2016-09-01 DOI: 10.1109/MASCOTS.2016.49

Arsham Skrenes, C. Williamson

引用次数: 7

RAIDX: RAID without Striping RAIDX:无条带的RAID

2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2016-09-01 DOI: 10.1109/MASCOTS.2016.15

A. Fekete, Elizabeth Varki

{"title":"RAIDX: RAID without Striping","authors":"A. Fekete, Elizabeth Varki","doi":"10.1109/MASCOTS.2016.15","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.15","url":null,"abstract":"Each disk of traditional RAID is logically divided into stripe units, and stripe units at the same location on each disk form a stripe. Thus, RAID striping forces homogeneity on its disks. Now, consider a heterogeneous array of hard disks, solid state disks, and RAM storage devices, with various access speeds and sizes. If this array is organized as a RAID system, then larger disks have wasted space and faster disks are under utilized. This paper proposes RAIDX, a new organization for a heterogeneous array. RAIDX disks are divided into chunks, larger disks have more chunks. Chunks from one or more disks are grouped into bundles, and RAIDX bundles chunks of data across its disks. The heterogeneity of disks causes unbalanced load distribution with some under-utilized disks and some bottleneck disks. To balance load across disks, RAIDX moves most frequently accessed chunks to under-utilized, faster disks and least frequently used chunks to larger, slower disks. Chunk remapping is done at the RAIDX level and does not impact file system to storage addressing. Experiments comparing local and networked RAIDX against local RAID show that RAIDX has faster throughput than RAID when the array is composed of heterogeneous disks: local RAIDX is 2.5x faster than RAID, networked RAIDX is 1.6x faster than local RAID.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121356976","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

A Performance Approach to Mobile Security 移动安全的性能方法

2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2016-09-01 DOI: 10.1109/MASCOTS.2016.39

Mihajlo Pavloski

{"title":"A Performance Approach to Mobile Security","authors":"Mihajlo Pavloski","doi":"10.1109/MASCOTS.2016.39","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.39","url":null,"abstract":"Signaling related attacks, such as the signaling storms, threaten the stability of mobile networks and are a frequent cause of multiple service degradations and even several network outages. This paper proposes a performance evaluation approach to the problem using techniques from probability theory, in general Markov Chains and queueing networks. It proposes a model of a mobile network under signaling storm, including more detailed models of the data channels and the data service times. Two classes of packets, also referred as \"calls\", are introduced in the model: normal and an attack ones, with the possibility of calls joining and leaving the network. The proposed model is used to provide insights on the effects of the storm on both network and user sides, such as the load on the signaling servers and the rate of blocking legitimate calls. Results show that the inactivity timer, set by the network operator, could be adjusted accordingly to lower the impact of such attacks and maintain higher network performance. Therefore, the paper further proposes a dynamic inactivity timer setup, which is represented as a function of the load on the signaling server. The proposed technique is introduced in the model and results show the improvement, as well as the significance of the timer selection. Such mechanism could be implemented in real mobile networks, as an improvement of the current static inactivity timer.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123354402","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

Static Program Analysis for Identifying Energy Bugs in Graphics-Intensive Mobile Apps 静态程序分析识别图形密集型移动应用程序中的能量漏洞

2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS) Pub Date : 2016-09-01 DOI: 10.1109/MASCOTS.2016.28

C. Kim, D. Kroening, M. Kwiatkowska

{"title":"Static Program Analysis for Identifying Energy Bugs in Graphics-Intensive Mobile Apps","authors":"C. Kim, D. Kroening, M. Kwiatkowska","doi":"10.1109/MASCOTS.2016.28","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.28","url":null,"abstract":"A major drawback of mobile devices is limited battery life. Apps that use graphics are especially energy greedy and developers must invest significant effort to make such apps energy efficient. We propose a novel static optimization technique for eliminating drawing commands to produce energy-efficient apps. The key insight we exploit is that the static analysis is able to predict future behavior of the app, and we give three exemplars that demonstrate the value of this approach. Firstly, loop invariant texture analysis identifies repetitive texture transfers in the render loop so that they can be moved out of the loop and performed just once. Secondly, packing identifies images that are drawn together and therefore can be combined into a larger image to eliminate overhead associated with multiple smaller images. Finally, identical frames detection uses a combination of static and dynamic analysis to identify frames that are identical to the previous frame and therefore do not have to be drawn. We implemented the technique against LibGDX, an Android game engine, and evaluated it using open source projects. Our experiments indicate savings up to 44% of the total energy consumption of the device.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124453019","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}

引用次数: 8