In recent years, interest in measuring air quality has spiked due to rising environmental and health concerns in South Korea. In particular, microfine dust (microdust) is known to cause serious health issues to people...
详细信息
Energy consumption is a primary concern for datacenter (DC) management. Its cost represents a significant part of the total cost of ownership (about 80% [2]) and it is estimated that in 2020, US DCs will spend about $...
详细信息
ISBN:
(纸本)9781450358460
Energy consumption is a primary concern for datacenter (DC) management. Its cost represents a significant part of the total cost of ownership (about 80% [2]) and it is estimated that in 2020, US DCs will spend about $13 billion on energy bills [3]. A majority of DCs implements the Infrastructure as a Service (IaaS) model where customers buy (from providers) VMs with a set of reserved resources. The VMs host general purpose applications (e.g. web services), as well as High Performance Computing applications. In such IaaS DCs, virtualization is a fundamental technology which allows optimizing the infrastructure by colocating several VMs on the same physical server. Such colocation can be achieved at deployment time by starting as many VMs as possible on each physical machine, or at runtime by dynamically migrating VMs on a reduced set of physical machines, thus implementing a consolidation strategy [4]. Ideally, consolidation should lead to highly loaded servers. Although consolidation may increase server utilization by about 5-10%, it is difficult to actually observe server loads greater than 50% for even the most adapted workloads [5–7]. The main reason is that VM collocation is memory bound, as memory saturates much faster than the CPU. This situation was accentuated over the last several years, as we have seen emerging new applications with growing memory demands, while physical platforms had an opposite tendency;they provide more CPU capacity than physical memory. This mismatch is referred to as the memory capacity wall [8]. However, the existing consolidation systems [9, 10] take the CPU as a pivot, i.e. the central element of the consolidation. The memory is considered constant (i.e. the initially booked value) all over the VM’s lifetime. Nevertheless, we consider that the memory should be the consolidation pivot since it is the limiting resource. In order to reduce the memory pressure, the consolidation should consider the memory actually consumed (i.e. the VM
This work covers deployment of contextual processing of measurement data in application to temporal modeling of pneumatic conveying industrial process. Electrical capacitance tomography (ECT) used as a non-invasive pr...
详细信息
ISBN:
(纸本)9788394941956
This work covers deployment of contextual processing of measurement data in application to temporal modeling of pneumatic conveying industrial process. Electrical capacitance tomography (ECT) used as a non-invasive process monitoring tool is supported by data mining for regularization of non-linear inverse problem solution. Processing of a larger number of archived experimental datasets enables extracting additional constraints for inference. Contextual data processing model (CDPM) extracts demanded information from the data in order to incorporate it as an expert knowledge about the process temporal behavior. Then it is incorporated into the Bayesian inference framework. Comparative analysis with previous work and domain expert prepared baseline to the proposed approach is demonstrated. Additionally, simplified parameterization is tested and verified by the quantitative experimental analysis.
The proceedings contain 56 papers. The topics discussed include: exchange of services in networks: competition, cooperation, and fairness;60 GHz indoor networking through flexible beams: a link-level profiling;queue-p...
ISBN:
(纸本)9781450334860
The proceedings contain 56 papers. The topics discussed include: exchange of services in networks: competition, cooperation, and fairness;60 GHz indoor networking through flexible beams: a link-level profiling;queue-proportional rate allocation with per-link information in multihop networks;online convex optimization using predictions;an online learning approach to improving the quality of crowd-sourcing;bandits with budgets: regret lower bounds and optimal algorithms;social network monetization via sponsored viral marketing;greedy-Bayes for targeted news dissemination;DiskAccel: accelerating disk-based experiments by representative sampling;combining phase identification and statistic modeling for automated parallel benchmark generation;reducing latency via redundant requests: exact analysis;impact of fairness and heterogeneity on delays in large-scale content delivery networks;fisher information-based experiment design for network tomography;and when virtual meets physical at the edge: a field study on datacenters' virtual traffic.
We study the optimal placement of content over a network of caches, a problem naturally arising in several networking applications. Given a demand of content request rates and paths followed, we wish to determine the ...
详细信息
In this paper, we bring various speculative scheduling strategies together under a unifying optimization framework, which defines a new metric, Probability of Completion before Deadlines (PoCD), to measure the probabi...
详细信息
The proceedings contain 51 papers. The topics discussed include: delay, memory, and messaging tradeoffs in distributed service systems;a necessary and sufficient condition for throughput scalability of fork and join n...
ISBN:
(纸本)9781450342667
The proceedings contain 51 papers. The topics discussed include: delay, memory, and messaging tradeoffs in distributed service systems;a necessary and sufficient condition for throughput scalability of fork and join networks with blocking;reverse ranking by graph structure: model and scalable algorithms;costly circuits, submodular schedules and approximate CaratheÁodory theorems;reducing latency through page-aware management of web objects by content delivery networks;optimizing TTL caches under heavy-tailed demands;adaptive caching networks with optimality guarantees;unsupervised clustering under temporal feature volatility in network stack fingerprinting;noisy bloom filters for multi-set membership testing;rumor source obfuscation on irregular trees;inference in OSNs via lightweight partial crawls;using predictions in online optimization: looking forward with an eye on the past;achieving low-delay and fast-convergence in stochastic network optimization: a Nesterovian approach;on the viability of a cloud virtual service provider;the value of privacy: strategic data subjects, incentive mechanisms and fundamental limits;instability in distributed mobility management: revisiting configuration management in 3G/4G mobile networks;on the duration and intensity of competitions in nonlinear PoÁlya urn processes with fitness;and understanding latency variation in modern DRAM chips: experimental characterization, analysis, and optimization.
In this paper, we characterize a state-of-The-Art 3D oating gate NAND ash memory through comprehensive experiments on an FPGA platform. Then, we present distinct observations on performance and reliability, such as op...
详细信息
Persistent spread measurement is to count the number of distinct elements that persist in each network flow for predefined time periods. It has many practical applications, including detecting long-Term stealthy netwo...
详细信息
To combat blind in-window attacks against TCP, changes proposed in RFC 5961 have been implemented by Linux since late 2012. While successfully eliminating the old vulnerabilities, the new TCP implementation was report...
详细信息
ISBN:
(纸本)9781450350327
To combat blind in-window attacks against TCP, changes proposed in RFC 5961 have been implemented by Linux since late 2012. While successfully eliminating the old vulnerabilities, the new TCP implementation was reported in August 2016 to have introduced a subtle yet serious security flaw. Assigned CVE-2016-5696, the flaw exploits the challenge ACK rate limiting feature that could allow an off-path attacker to infer the presence/absence of a TCP connection between two arbitrary hosts, terminate such a connection, and even inject malicious payload. In this work, we perform a comprehensive measurement of the impact of the new vulnerability. This includes (1) tracking the vulnerable Internet servers, (2) monitoring the patch behavior over time, (3) picturing the overall security status of TCP stacks at scale. Towards this goal, we design a scalable measurement methodology to scan the Alexa top 1 million websites for almost 6 months. We also present how notifications impact the patching behavior, and compare the result with the Heartbleed and the Debian PRNG vulnerability. The measurement represents a valuable data point in understanding how Internet servers react to serious security flaws in the operating system kernel.
暂无评论