SIGMETRICS '17 Abstracts: Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems

Full Citation in the ACM Digital Library

SESSION: SIGMETRICS Achievement Award: Sem Borst

Session details: SIGMETRICS Achievement Award: Sem Borst

Delay Scalings and Mean-Field Limits in Networked Systems

Load balancing mechanisms and scheduling algorithms play a critical role in achieving efficient server utilization and providing robust delay performance in a wide range of networked systems. We will review some celebrated schemes and optimality results ...

SESSION: Session 1: Load Balancing among Switch and Caches

Session details: Session 1: Load Balancing among Switch and Caches

A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints

A promising means to increase efficiency of cellular networks compared to existing architectures is to proactively cache data in the base stations. The idea is to store part of the data at the wireless edge and use the backhaul only to refresh the ...

Optimal Service Elasticity in Large-Scale Distributed Systems

A fundamental challenge in large-scale cloud networks and data centers is to achieve highly efficient server utilization and limit energy consumption, while providing excellent user-perceived performance in the presence of uncertain and time-varying ...

Queue-Proportional Sampling: A Better Approach to Crossbar Scheduling for Input-Queued Switches

Most present day switching systems, in Internet routers and data-center switches, employ a single input-queued crossbar to interconnect input ports with output ports. Such switches need to compute a matching, between input and output ports, for each ...

SESSION: Session 2: Algorithms for Massive Processing Applications

Session details: Session 2: Algorithms for Massive Processing Applications

Hieroglyph: Locally-Sufficient Graph Processing via Compute-Sync-Merge

Mainstream graph processing systems (such as Pregel [3] and PowerGraph [1]) follow the bulk synchronous parallel model. This design leads to the tight coupling of computation and communication, where no vertex can proceed to the next iteration of ...

A Simple Yet Effective Balanced Edge Partition Model for Parallel Computing

Graph edge partition models have recently become an appealing alternative to graph vertex partition models for distributed computing due to both their flexibility in balancing loads and their performance in reducing communication cost.

In this paper, we ...

Overcommitment in Cloud Services Bin packing with Chance Constraints

This paper considers a traditional problem of resource allocation, scheduling jobs on machines. One such recent application is cloud computing, where jobs arrive in an online fashion with capacity requirements and need to be immediately scheduled on ...

SESSION: Session 3: Assessing Vulnerability of Large Networks

Session details: Session 3: Assessing Vulnerability of Large Networks

Investigation of the 2016 Linux TCP Stack Vulnerability at Scale

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

Characterizing and Modeling Patching Practices of Industrial Control Systems

Industrial Control Systems (ICS) are widely deployed in mission critical infrastructures such as manufacturing, energy, and transportation. The mission critical nature of ICS devices poses important security challenges for ICS vendors and asset owners. ...

Security Game with Non-additive Utilities and Multiple Attacker Resources

There has been significant interest in studying security games for modeling the interplay of attacks and defenses on various systems involving critical infrastructure, financial system security, political campaigns, and civil safeguarding. However, ...

POSTER SESSION: Poster Session

Fluid-Model-Based Car Routing for Modern Ridesharing Systems

We consider a closed queueing network model of ridesharing systems such as Didi Chuxing, Lyft, and Uber. We focus on empty-car routing, a mechanism by which we control car flow in the network to optimize system-wide utility functions, e.g. the ...

Pseudo-Separation for Assessment of Structural Vulnerability of a Network

Based upon the idea that network functionality is impaired if two nodes in a network are sufficiently separated in terms of a given metric, we introduce two combinatorial pseudocut problems generalizing the classical min-cut and multi-cut problems. We ...

On the Capacity Requirement for Arbitrary End-to-End Deadline and Reliability Guarantees in Multi-hop Networks

It has been shown that it is impossible to achieve both stringent end-to-end deadline and reliability guarantees in a large network without having complete information of all future packet arrivals. In order to maintain desirable performance in the ...

Optimizing Speculative Execution of Deadline-Sensitive Jobs in Cloud

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 probability that MapReduce jobs meet their ...

A Spot Capacity Market to Increase Power Infrastructure Utilization in Multi-Tenant Data Centers

Despite the common practice of oversubscription, power capacity is largely under-utilized in data centers. A significant factor driving this under-utilization is fluctuation of the aggregate power demand, resulting in unused "spot (power) capacity". In ...

Hour-Ahead Offering Strategies in Electricity Market for Power Producers with Storage and Intermittent Supply

This paper proposes online offering strategies for a storage-assisted renewable power producer that participates in hour-ahead electricity market. The online strategy determines the offering price and volume, while no exact or stochastic future ...

Why "Some" Like It Hot Too: Thermal Attack on Data Centers

A trend in modern data centers is to raise the temperature and maintain all servers in a relatively hot environment. While this can save on cooling costs given benign workloads running in servers, the hot environment increases the risk of cooling ...

Incentivizing Reliable Demand Response with Customers' Uncertainties and Capacity Planning

One of the major issues with the integration of renewable energy sources into the power grid is the increased uncertainty and variability that they bring. If this uncertainty is not sufficiently addressed, it will limit the further penetration of ...

A Study on Performance and Power Efficiency of Dense Non-Volatile Caches in Multi-Core Systems

This paper presents a novel cache design based on Multi-Level Cell Spin-Transfer Torque RAM (MLC STT-RAM).Our design exploits the asymmetric nature of the MLC STT-RAM to build cache lines featuring heterogeneous performances, that is, half of the cache ...

Scheduling Coflows in Datacenter Networks: Improved Bound for Total Weighted Completion Time

Coflow is a recently proposed networking abstraction to capture communication patterns in data-parallel computing frameworks. We consider the problem of efficiently scheduling coflows with release dates in a shared datacenter network so as to minimize ...

Characterizing 3D Floating Gate NAND Flash

In this paper, we characterize a state-of-the-art 3D floating gate NAND flash memory through comprehensive experiments on an FPGA platform. Then, we present distinct observations on performance and reliability, such as operation latencies and various ...

ECF: An MPTCP Path Scheduler to Manage Heterogeneous Paths

Multi-Path TCP (MPTCP) is a new standardized transport protocol that enables devices to utilize multiple network interfaces. The default MPTCP path scheduler prioritizes paths with the smallest round trip time (RTT). In this work, we examine whether the ...

Simplex Queues for Hot-Data Download

In distributed systems, reliable data storage is accomplished through redundancy, which has traditionally been achieved by simple replication of data across multiple nodes [6]. A special class of erasure codes, known as locally repairable codes (LRCs) [...

An Empirical Analysis of Facebook's Free Basics

Multipath TCP on a VANET: A Performance Study

Highly dynamic vehicular networks use long-range radio technologies such as DSRC, WiMAX, and Cellular networks to maintain connectivity. Multipath TCP offers the possibility to combine these radio technologies to improve network performance, allow ...

A Fast, Small, and Dynamic Forwarding Information Base

Concise is a Forwarding information base (FIB) design that uses very little memory to support fast query of a large number of dynamic network names or flow IDs. Concise makes use of minimal perfect hashing and the SDN framework to design and implement ...

HFTraC: High-Frequency Traffic Control

We propose high-frequency traffic control (HFTraC), a rate control scheme that coordinates the transmission rates and buffer utilizations in routers network-wide at fast timescale. HFTraC can effectively deal with traffic demand fluctuation by utilizing ...

Adaptive TTL-Based Caching for Content Delivery

Content Delivery Networks (CDNs) cache and serve a majority of the user-requested content on the Internet, including web pages, videos, and software downloads. We propose two TTL-based caching algorithms that automatically adapt to the heterogeneity, ...

SESSION: SIGMETRICS Keynote Talk: Vahab Mirrokni

Session details: SIGMETRICS Keynote Talk: Vahab Mirrokni

Online Optimization for Markets and the Cloud: Theory and Practice

Internet applications provide interesting dynamic environments for online optimization techniques. In this talk, I will discuss a number of such problems in the context of online markets, and in serving cloud services. For online markets, I discuss ...

SESSION: Session 4: Performance Analysis of Very Large Systems

Session details: Session 4: Performance Analysis of Very Large Systems

Stein's Method for Mean-Field Approximations in Light and Heavy Traffic Regimes

Mean-field analysis is an analytical method for understanding large-scale stochastic systems such as large-scale data centers and communication networks. The idea is to approximate the stationary distribution of a large-scale stochastic system using the ...

Expected Values Estimated via Mean-Field Approximation are 1/N-Accurate: Extended Abstract

In this paper, we study the accuracy of mean-field approximation. We show that, under general conditions, the expectation of any performance functional converges at rate O(1/N) to its mean-field approximation. Our result applies for finite and infinite-...

Analysis of a Stochastic Model of Replication in Large Distributed Storage Systems: A Mean-Field Approach

Distributed storage systems such as Hadoop File System or Google File System (GFS) ensure data availability and durability using replication. Persistence is achieved by replicating the same data block on several nodes, and ensuring that a minimum number ...

SESSION: Session 5: Towards Efficient and Durable Storage

Session details: Session 5: Towards Efficient and Durable Storage

Understanding Reduced-Voltage Operation in Modern DRAM Devices: Experimental Characterization, Analysis, and Mechanisms

The energy consumption of DRAM is a critical concern in modern computing systems. Improvements in manufacturing process technology have allowed DRAM vendors to lower the DRAM supply voltage conservatively, which reduces some of the DRAM energy ...

Exploiting Data Longevity for Enhancing the Lifetime of Flash-based Storage Class Memory

This paper proposes to exploit the capability of retention time relaxation in flash memories for improving the lifetime of an SLC-based SSD. The main idea is that as a majority of I/O data in a typical workload do not need a retention time larger than a ...

Design-Induced Latency Variation in Modern DRAM Chips: Characterization, Analysis, and Latency Reduction Mechanisms

Variation has been shown to exist across the cells within a modern DRAM chip. Prior work has studied and exploited several forms of variation, such as manufacturing-process- or temperature-induced variation. We empirically demonstrate a new form of ...

SESSION: Session 6: New Design for Large Network Applications

Session details: Session 6: New Design for Large Network Applications

Hadoop on Named Data Networking: Experience and Results

In today's data centers, clusters of servers are arranged to perform various tasks in a massively distributed manner: handling web requests, processing scientific data, and running simulations of real-world problems. These clusters are very complex, and ...

Using Burstable Instances in the Public Cloud: Why, When and How?

To attract more customers, public cloud providers offer virtual machine (instance) types that trade off lower prices for poorer capacities. As one salient approach, the providers employ aggressive statistical multiplexing of multiple cheaper instances ...

Dandelion: Redesigning the Bitcoin Network for Anonymity

Cryptocurrencies are digital currencies that provide cryptographic verification of transactions. In recent years, they have transitioned from an academic research topic to a multi-billion dollar industry. Bitcoin is the best-known example of a ...

SESSION: SIGMETRICS Keynote Talk: Michael Jordan

Session details: SIGMETRICS Keynote Talk: Michael Jordan

On Gradient-Based Optimization: Accelerated, Distributed, Asynchronous and Stochastic

Many new theoretical challenges have arisen in the area of gradient-based optimization for large-scale statistical data analysis, driven by the needs of applications and the opportunities provided by new hardware and software platforms. I discuss ...

SESSION: Session 7: Resource Allocation & Economics

Session details: Session 7: Resource Allocation & Economics

Portfolio-driven Resource Management for Transient Cloud Servers

Cloud providers have begun to offer their surplus capacity in the form of low-cost transient servers, which can be revoked unilaterally at any time. While the low cost of transient servers makes them attractive for a wide range of applications, such as ...

Optimal Posted Prices for Online Cloud Resource Allocation

We study online resource allocation in a cloud computing platform, through a posted pricing mechanism: The cloud provider publishes a unit price for each resource type, which may vary over time; upon arrival at the cloud system, a cloud user either ...

On Optimal Two-Sided Pricing of Congested Networks

Internet Access Providers (APs) have built massive network platforms by which end-users and Content Providers (CPs) can connect and transmit data to each other. Traditionally, APs adopt one-sided pricing schemes and obtain revenues mainly from end-...

SESSION: SIGMETRICS Rising Star Award: Sewoong Oh

Session details: SIGMETRICS Rising Star Award: Sewoong Oh

Matrix Factorization at the Frontier of Non-convex Optimizations: Abstract for SIGMETRICS 2017 Rising Star Award Talk

Principal Component Analysis (PCA) and Canonical Component Analysis (CCA) are two of the few examples of non-convex optimization problems that can be solved efficiently with sharp guarantees. This is achieved by the classical and well-established ...

SESSION: Session 8: Analyzing and Controlling Network Interaction

Session details: Session 8: Analyzing and Controlling Network Interaction

Outward Influence and Cascade Size Estimation in Billion-scale Networks

Estimating cascade size and nodes' influence is a fundamental task in social, technological, and biological networks. Yet this task is extremely challenging due to the sheer size and the structural heterogeneity of networks. We investigate a new ...

Accelerating Performance Inference over Closed Systems by Asymptotic Methods

Recent years have seen a rapid growth of interest in exploiting monitoring data collected from enterprise applications for automated management and performance analysis. In spite of this trend, even simple performance inference problems involving ...

Quality and Cost of Deterministic Network Calculus: Design and Evaluation of an Accurate and Fast Analysis

Networks are integral parts of modern safety-critical systems and certification demands the provision of guarantees for data transmissions. Deterministic Network Calculus (DNC) can compute a worst-case bound on a data flow's end-to-end delay. Accuracy ...

SESSION: Session 9: Accurate and Efficient Performance Measurement

Session details: Session 9: Accurate and Efficient Performance Measurement

A Case Study in Power Substation Network Dynamics

The modern world is becoming increasingly dependent on computing and communication technology to function, but unfortunately its application and impact on areas such as critical infrastructure and industrial control system (ICS) networks remains to be ...

Persistent Spread Measurement for Big Network Data Based on Register Intersection

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 network activities in the background of ...

Deconstructing the Energy Consumption of the Mobile Page Load

Mobile Web page performance is critical to content providers, service providers, and users, as Web browsers are one of the most popular apps on phones. Slow Web pages are known to adversely affect profits and lead to user abandonment. While improving ...

TUTORIAL SESSION: Tutorial Session

Routing Money, Not Packets: A Tutorial on Internet Economics

is tutorial is in the broad area of Internet Economics, specifically applying ideas from game theory, both Cooperative and Non-Cooperative. We consider the origins of the Internet architecture, and the evolution of the Internet ecosystem from a protocol ...