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

Energy Efficient Policies for Upstream Content Server Selection 上游内容服务器选择的节能策略

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.51

S. Sahane, R. Lent

{"title":"Energy Efficient Policies for Upstream Content Server Selection","authors":"S. Sahane, R. Lent","doi":"10.1109/MASCOTS.2016.51","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.51","url":null,"abstract":"Reverse proxies are key performance elements of a content distribution network (CDN) and operate as intermediaries between client and upstream (or origin) server traffic. A typical reverse proxy server aims to distribute user workload, more or less equally, among multiple upstream servers. To keep the pace with the growing demand for content, CDNs regularly expand their capacity by adding extra upstream servers to handle the increased traffic. However, distributing traffic without consideration of the energy and performance features of the machines and keeping servers active all the time can reduce energy efficiency drastically because of the seasonal variation of traffic. This outcome is highly undesirable because of environmental and economic concerns. Policy-based management is an approach for large-scale network management that helps to simplify network administration through the use of event-action rules. We investigate the formulation of server selection policies for reverse proxies to improve the energy efficiency of the system while maintaining desired service-level objectives. In particular, we formulate four energy-efficient policies of varying complexity and performance, and evaluate them using realistic data obtained from a testbed. The results are also contrasted with the outcome of common load distribution methods that ship with a popular open-source proxy server to show the advantages of the proposed policy generation strategies.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"135 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":"128592496","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

Towards a Scalable Test Solution for the Analysis of Interconnect Shorts in On-chip Networks 片上网络互连短时间分析的可扩展测试解决方案

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.52

B. Bhowmik, J. Deka, S. Biswas

引用次数: 9

Stochastic Modeling of Hybrid Cache Systems 混合缓存系统的随机建模

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

Gaoying Ju, Yongkun Li, Yinlong Xu, Jiqiang Chen, John C.S. Lui

{"title":"Stochastic Modeling of Hybrid Cache Systems","authors":"Gaoying Ju, Yongkun Li, Yinlong Xu, Jiqiang Chen, John C.S. Lui","doi":"10.1109/MASCOTS.2016.36","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.36","url":null,"abstract":"In recent years, there is an increasing demand of big memory systems so to perform large scale data analytics. Since DRAM memories are expensive, some researchers are suggesting to use other memory systems such as non-volatile memory (NVM) technology to build large-memory computing systems. However, whether the NVM technology can be a viable alternative (either economically and technically) to DRAM remains an open question. To answer this question, it is important to consider how to design a memory system from a \"system perspective\",that is, incorporating different performance characteristics andprice ratios from hybrid memory devices. This paper presents an analytical model of a \"hybrid page cache system\" so to understand the diverse design space and performance impact of a hybrid cache system. We consider (1) various architectural choices, (2) design strategies, and (3) configuration of different memory devices. Using this model, we provide guidelines on how to design hybrid page cache to reach a good trade-off between high system throughput (in I/O per sec or IOPS) and fast cache reactivity which is defined by the time to fill the cache. We also show how one can configure the DRAM capacity and NVM capacity under a fixed budget. We pick PCM as an example for NVM and conduct numerical analysis. Our analysis indicates that incorporating PCM in a page cache system significantly improves the system performance, and it also shows larger benefit to allocate more PCM in page cache in some cases. Besides, for the common setting of performance-price ratio of PCM, \"flat architecture\" offers as a better choice, but \"layered architecture\" outperforms if PCM write performance can be significantly improved in the future.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129424877","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}

引用次数: 4

Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration 基于策略迭代的固定延迟CTMC中有效超时综合

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

Lubos Korenciak, A. Kucera, V. Rehák

{"title":"Efficient Timeout Synthesis in Fixed-Delay CTMC Using Policy Iteration","authors":"Lubos Korenciak, A. Kucera, V. Rehák","doi":"10.1109/MASCOTS.2016.34","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.34","url":null,"abstract":"We consider the fixed-delay synthesis problem for continuous-time Markov chains extended with fixed-delay transitions (fdCTMC). The goal is to synthesize concrete values of the fixed-delays (timeouts) that minimize the expected total cost incurred before reaching a given set of target states. The same problem has been considered and solved in previous works by computing an optimal policy in a certain discrete-time Markov decision process (MDP) with a huge number of actions that correspond to suitably discretized values of the timeouts. In this paper, we design a symbolic fixed-delay synthesis algorithm which avoids the explicit construction of large action spaces. Instead, the algorithm computes a small sets of \"promising\" candidate actions on demand. The candidate actions are selected by minimizing a certain objective function by computing its symbolic derivative and extracting a univariate polynomial whose roots are precisely the points where the derivative takes zero value. Since roots of high degree univariate polynomials can be isolated very efficiently using modern mathematical software, we achieve not only drastic memory savings but also speedup by three orders of magnitude compared to the previous methods.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129197417","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

Efficient Routing for Cost Effective Scale-Out Data Architectures 高效路由的成本效益的横向扩展数据架构

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

Ashwin Narayan, Vuk Markovic, Alejandro Morales

{"title":"Efficient Routing for Cost Effective Scale-Out Data Architectures","authors":"Ashwin Narayan, Vuk Markovic, Alejandro Morales","doi":"10.1109/MASCOTS.2016.29","DOIUrl":"https://doi.org/10.1109/MASCOTS.2016.29","url":null,"abstract":"In large scale-out data architectures, data are distributed and replicated across several machines. Queries/tasks to such data architectures, are sent to a router which determines the machines containing the requested data. Ideally, to reduce the overall cost of analytics, the smallest set of machines required to satisfy the query should be returned by the router. Mathematically, this can be modeled as the set cover problem, which is NP-hard. Given large number of incoming queries in real-time, it is often impractical to compute set cover for each incoming query to perform routing. In this paper, we propose a novel technique to speedup the routing of a large number of real-time queries while minimizing the number of machines that each query touches (query span). We demonstrate that by analyzing the correlation between known queries and performing query clustering, we can reduce the set cover computation time, thereby significantly speeding up routing of unknown queries. Experiments show that our incremental set cover-based routing is 2.5 times faster and can return on average 50% fewer machines per query when compared to repeated greedy set cover and baseline routing techniques.","PeriodicalId":129389,"journal":{"name":"2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123716172","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

An Uncertainty-Aware Approach to Optimal Configuration of Stream Processing Systems 流处理系统优化配置的不确定性感知方法

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

Pooyan Jamshidi, G. Casale

引用次数: 110