Valid HTML 4.0! Valid CSS!
%%% -*-BibTeX-*-
%%% ====================================================================
%%%  BibTeX-file{
%%%     author          = "Nelson H. F. Beebe",
%%%     version         = "1.01",
%%%     date            = "29 March 2021",
%%%     time            = "11:14:42 MDT",
%%%     filename        = "pomacs.bib",
%%%     address         = "University of Utah
%%%                        Department of Mathematics, 110 LCB
%%%                        155 S 1400 E RM 233
%%%                        Salt Lake City, UT 84112-0090
%%%                        USA",
%%%     telephone       = "+1 801 581 5254",
%%%     FAX             = "+1 801 581 4148",
%%%     URL             = "http://www.math.utah.edu/~beebe",
%%%     checksum        = "45689 6908 33656 317437",
%%%     email           = "beebe at math.utah.edu, beebe at acm.org,
%%%                        beebe at computer.org (Internet)",
%%%     codetable       = "ISO/ASCII",
%%%     keywords        = "bibliography; BibTeX; Proceedings of the ACM
%%%                        on Measurement and Analysis of Computing
%%%                        Systems (POMACS)",
%%%     license         = "public domain",
%%%     supported       = "yes",
%%%     docstring       = "This is a COMPLETE BibTeX bibliography for
%%%                        Proceedings of the ACM on Measurement and
%%%                        Analysis of Computing Systems (POMACS) (CODEN
%%%                        ????, ISSN 2476-1249).  The journal appears
%%%                        annually, and publication began with volume
%%%                        1, number 1, in June 2017.
%%%
%%%                        At version 1.01, the COMPLETE journal
%%%                        coverage looked like this:
%%%
%%%                             2017 (  44)    2019 (  58)    2021 (   9)
%%%                             2018 (  40)    2020 (  48)
%%%
%%%                             Article:        199
%%%
%%%                             Total entries:  199
%%%
%%%                        The journal Web pages can be found at:
%%%
%%%                            http://pomacs.acm.org/
%%%                            http://pomacs.acm.org/archive-toc.cfm
%%%
%%%                        The journal table of contents page is at:
%%%
%%%                            http://dl.acm.org/pub.cfm?id=J1567
%%%
%%%                        Qualified subscribers can retrieve the full
%%%                        text of recent articles in PDF form.
%%%
%%%                        The initial draft was extracted from the ACM
%%%                        Web pages.
%%%
%%%                        ACM copyrights explicitly permit abstracting
%%%                        with credit, so article abstracts, keywords,
%%%                        and subject classifications have been
%%%                        included in this bibliography wherever
%%%                        available.  Article reviews have been
%%%                        omitted, until their copyright status has
%%%                        been clarified.
%%%
%%%                        bibsource keys in the bibliography entries
%%%                        below indicate the entry originally came
%%%                        from the computer science bibliography
%%%                        archive, even though it has likely since
%%%                        been corrected and updated.
%%%
%%%                        URL keys in the bibliography point to
%%%                        World Wide Web locations of additional
%%%                        information about the entry.
%%%
%%%                        BibTeX citation tags are uniformly chosen
%%%                        as name:year:abbrev, where name is the
%%%                        family name of the first author or editor,
%%%                        year is a 4-digit number, and abbrev is a
%%%                        3-letter condensation of important title
%%%                        words. Citation tags were automatically
%%%                        generated by software developed for the
%%%                        BibNet Project.
%%%
%%%                        In this bibliography, entries are sorted in
%%%                        publication order, using ``bibsort -byvolume.''
%%%
%%%                        The checksum field above contains a CRC-16
%%%                        checksum as the first value, followed by the
%%%                        equivalent of the standard UNIX wc (word
%%%                        count) utility output of lines, words, and
%%%                        characters.  This is produced by Robert
%%%                        Solovay's checksum utility.",
%%%  }
%%% ====================================================================
@Preamble{"\input bibnames.sty" #
    "\def \TM {${}^{\sc TM}$}"
}

%%% ====================================================================
%%% Acknowledgement abbreviations:
@String{ack-nhfb = "Nelson H. F. Beebe,
                    University of Utah,
                    Department of Mathematics, 110 LCB,
                    155 S 1400 E RM 233,
                    Salt Lake City, UT 84112-0090, USA,
                    Tel: +1 801 581 5254,
                    FAX: +1 801 581 4148,
                    e-mail: \path|beebe@math.utah.edu|,
                            \path|beebe@acm.org|,
                            \path|beebe@computer.org| (Internet),
                    URL: \path|http://www.math.utah.edu/~beebe/|"}

%%% ====================================================================
%%% Journal abbreviations:
@String{j-POMACS                = "Proceedings of the ACM on Measurement and
                                   Analysis of Computing Systems (POMACS)"}

%%% ====================================================================
%%% Bibliography entries:
@Article{Chaintreau:2017:E,
  author =       "Augustin Chaintreau and Leana Golubchik and Zhi-Li
                 Zhang",
  title =        "Editorial",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "1:1--1:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3105875",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3105875",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Gibbens:2017:HND,
  author =       "Mathias Gibbens and Chris Gniady and Lei Ye and
                 Beichuan Zhang",
  title =        "{Hadoop} on Named Data Networking: Experience and
                 Results",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "2:1--2:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084439",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084439",
  abstract =     "The Named Data Networking (NDN) architecture retrieves
                 content by names rather than connecting to specific
                 hosts. It provides benefits such as highly efficient
                 and resilient content distribution, which fit well to
                 data-intensive distributed computing. This paper
                 presents and discusses our experience in modifying
                 Apache Hadoop, a popular MapReduce framework, to
                 operate on an NDN network. Through this
                 first-of-its-kind implementation process, we
                 demonstrate the feasibility of running an existing,
                 large, and complex piece of distributed software
                 commonly seen in data centers over NDN. We show
                 advantages such as simplified network code and reduced
                 network traffic which are beneficial in a data center
                 environment. There are also challenges faced by NDN,
                 that are being addressed by the community, which can be
                 magnified under data center traffic. Through detailed
                 evaluation, we show a reduction of 16\% for overall
                 data transmission between Hadoop nodes while writing
                 data with default replication settings. Preliminary
                 results also show promise for in-network caching of
                 repeated reads in distributed applications. We also
                 show that overall performance is currently slower under
                 NDN, and we identify challenges and opportunities for
                 further NDN improvements.",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Gong:2017:QPS,
  author =       "Long Gong and Paul Tune and Liang Liu and Sen Yang and
                 Jun (Jim) Xu",
  title =        "Queue-Proportional Sampling: A Better Approach to
                 Crossbar Scheduling for Input-Queued Switches",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "3:1--3:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084440",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084440",
  abstract =     "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 switching
                 cycle (time slot). The main challenge in designing such
                 matching algorithms is to deal with the unfortunate
                 tradeoff between the quality of the computed matching
                 and the computational complexity of the algorithm. In
                 this paper, we propose a general approach that can
                 significantly boost the performance of both SERENA and
                 iSLIP, yet incurs only O(1) additional computational
                 complexity at each input/output port. Our approach is a
                 novel proposing strategy, called Queue-Proportional
                 Sampling (QPS), that generates an excellent starter
                 matching. We show, through rigorous simulations, that
                 when starting with this starter matching, iSLIP and
                 SERENA can output much better final matching decisions,
                 as measured by the resulting throughput and delay
                 performance, than they otherwise can.",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Quach:2017:ILT,
  author =       "Alan Quach and Zhongjie Wang and Zhiyun Qian",
  title =        "Investigation of the 2016 {Linux TCP} Stack
                 Vulnerability at Scale",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "4:1--4:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084441",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084441",
  abstract =     "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 payload into an unsecured TCP connection. 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.",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Sharma:2017:PDR,
  author =       "Prateek Sharma and David Irwin and Prashant Shenoy",
  title =        "Portfolio-driven Resource Management for Transient
                 Cloud Servers",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "5:1--5:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084442",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib;
                 http://www.math.utah.edu/pub/tex/bib/pvm.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084442",
  abstract =     "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 data
                 processing and scientific computing, failures due to
                 server revocation can severely degrade application
                 performance. Since different transient server types
                 offer different cost and availability tradeoffs, we
                 present the notion of server portfolios that is based
                 on financial portfolio modeling. Server portfolios
                 enable construction of an 'optimal' mix of severs to
                 meet an application's sensitivity to cost and
                 revocation risk. We implement model-driven portfolios
                 in a system called ExoSphere, and show how diverse
                 applications can use portfolios and
                 application-specific policies to gracefully handle
                 transient servers. We show that ExoSphere enables
                 widely-used parallel applications such as Spark, MPI,
                 and BOINC to be made transiency-aware with modest
                 effort. Our experiments show that allowing the
                 applications to use suitable transiency-aware policies,
                 ExoSphere is able to achieve 80\% cost savings when
                 compared to on-demand servers and greatly reduces
                 revocation risk compared to existing approaches.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Cao:2017:DEC,
  author =       "Yi Cao and Javad Nejati and Muhammad Wajahat and Aruna
                 Balasubramanian and Anshul Gandhi",
  title =        "Deconstructing the Energy Consumption of the Mobile
                 Page Load",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "6:1--6:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084443",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084443",
  abstract =     "Modeling the energy consumption of applications on
                 mobile devices is an important topic that has received
                 much attention in recent years. However, there has been
                 very little research on modeling the energy consumption
                 of the mobile Web. This is primarily due to the
                 short-lived yet complex page load process that makes it
                 infeasible to rely on coarse-grained resource
                 monitoring for accurate power estimation. We present
                 RECON, a modeling approach that accurately estimates
                 the energy consumption of any Web page load and
                 deconstructs it into the energy contributions of
                 individual page load activities. Our key intuition is
                 to leverage low-level application semantics in addition
                 to coarse-grained resource utilizations for modeling
                 the page load energy consumption. By exploiting
                 fine-grained information about the individual
                 activities that make up the page load, RECON enables
                 fast and accurate energy estimations without requiring
                 complex models. Experiments across 80 Web pages and
                 under four different optimizations show that RECON can
                 estimate the energy consumption for a Web page load
                 with an average error of less than 7\%. Importantly,
                 RECON helps to analyze and explain the energy effects
                 of an optimization on the individual components of Web
                 page loads.",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Wang:2017:OTS,
  author =       "Xin Wang and Richard T. B. Ma and Yinlong Xu",
  title =        "On Optimal Two-Sided Pricing of Congested Networks",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "7:1--7:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084444",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084444",
  abstract =     "Traditionally, Internet Access Providers (APs) only
                 charge end-users for Internet access services; however,
                 to recoup infrastructure costs and increase revenues,
                 some APs have recently adopted two-sided pricing
                 schemes under which both end-users and content
                 providers are charged. Meanwhile, with the rapid growth
                 of traffic, network congestion could seriously degrade
                 user experiences and influence providers' utility. To
                 optimize profit and social welfare, APs and regulators
                 need to design appropriate pricing strategies and
                 regulatory policies that take the effects of network
                 congestion into consideration. In this paper, we model
                 two-sided networks under which users' traffic demands
                 are influenced by exogenous pricing and endogenous
                 congestion parameters and derive the system congestion
                 under an equilibrium. We characterize the structures
                 and sensitivities of profit- and welfare-optimal
                 two-sided pricing schemes and reveal that (1) the
                 elasticity of system throughput plays a crucial role in
                 determining the structures of optimal pricing, (2) the
                 changes of optimal pricing under varying AP's capacity
                 and users' congestion sensitivity are largely driven by
                 the type of data traffic, e.g., text or video, and (3)
                 APs and regulators will be incentivized to shift from
                 one-sided to two-sided pricing when APs' capacities and
                 user demand for video traffic grow. Our results can
                 help APs design optimal two-sided pricing and guide
                 regulators to legislate desirable policies.",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Casale:2017:API,
  author =       "Giuliano Casale",
  title =        "Accelerating Performance Inference over Closed Systems
                 by Asymptotic Methods",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "8:1--8:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084445",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084445",
  abstract =     "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 queueing
                 theoretic formulas often incur computational
                 bottlenecks, for example upon computing likelihoods in
                 models of batch systems. Motivated by this issue, we
                 revisit the solution of multiclass closed queueing
                 networks, which are popular models used to describe
                 batch and distributed applications with parallelism
                 constraints. We first prove that the normalizing
                 constant of the equilibrium state probabilities of a
                 closed model can be reformulated exactly as a
                 multidimensional integral over the unit simplex. This
                 gives as a by-product novel explicit expressions for
                 the multiclass normalizing constant. We then derive a
                 method based on cubature rules to efficiently evaluate
                 the proposed integral form in small and medium-sized
                 models. For large models, we propose novel asymptotic
                 expansions and Monte Carlo sampling methods to
                 efficiently and accurately approximate normalizing
                 constants and likelihoods. We illustrate the resulting
                 accuracy gains in problems involving optimization-based
                 inference.",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Ju:2017:HLS,
  author =       "Xiaoen Ju and Hani Jamjoom and Kang G. Shin",
  title =        "{Hieroglyph}: Locally-Sufficient Graph Processing via
                 Compute--Sync--Merge",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "9:1--9:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084446",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084446",
  abstract =     "Despite their widespread adoption, large-scale graph
                 processing systems do not fully decouple computation
                 and communication, often yielding suboptimal
                 performance. Locally-sufficient computation-computation
                 that relies only on the graph state local to a
                 computing host-can mitigate the effects of this
                 coupling. In this paper, we present
                 Compute--Sync--Merge (CSM), a new programming
                 abstraction that achieves efficient locally-sufficient
                 computation. CSM enforces local sufficiency at the
                 programming abstraction level and enables the
                 activation of vertex-centric computation on all vertex
                 replicas, thus supporting vertex-cut partitioning. We
                 demonstrate the simplicity of expressing several
                 fundamental graph algorithms in CSM. Hieroglyph-our
                 implementation of a graph processing system with CSM
                 support-outperforms state of the art by up to 53x, with
                 a median speedup of 3.5x and an average speedup of 6x
                 across a wide range of datasets.",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Chang:2017:URV,
  author =       "Kevin K. Chang and A. Giray Ya{\u{a}}lik{\c{c}}i and
                 Saugata Ghose and Aditya Agrawal and Niladrish
                 Chatterjee and Abhijith Kashyap and Donghyuk Lee and
                 Mike O'Connor and Hasan Hassan and Onur Mutlu",
  title =        "Understanding Reduced-Voltage Operation in Modern
                 {DRAM} Devices: Experimental Characterization,
                 Analysis, and Mechanisms",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "10:1--10:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084447",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084447",
  abstract =     "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
                 consumption. We would like to reduce the DRAM supply
                 voltage more aggressively, to further reduce energy.
                 Aggressive supply voltage reduction requires a thorough
                 understanding of the effect voltage scaling has on DRAM
                 access latency and DRAM reliability. In this paper, we
                 take a comprehensive approach to understanding and
                 exploiting the latency and reliability characteristics
                 of modern DRAM when the supply voltage is lowered below
                 the nominal voltage level specified by DRAM standards.
                 Using an FPGA-based testing platform, we perform an
                 experimental study of 124 real DDR3L (low-voltage) DRAM
                 chips manufactured recently by three major DRAM
                 vendors. We find that reducing the supply voltage below
                 a certain point introduces bit errors in the data, and
                 we comprehensively characterize the behavior of these
                 errors. We discover that these errors can be avoided by
                 increasing the latency of three major DRAM operations
                 (activation, restoration, and precharge). We perform
                 detailed DRAM circuit simulations to validate and
                 explain our experimental findings. We also characterize
                 the various relationships between reduced supply
                 voltage and error locations, stored data patterns, DRAM
                 temperature, and data retention. Based on our
                 observations, we propose a new DRAM energy reduction
                 mechanism, called Voltron. The key idea of Voltron is
                 to use a performance model to determine by how much we
                 can reduce the supply voltage without introducing
                 errors and without exceeding a user-specified threshold
                 for performance loss. Our evaluations show that Voltron
                 reduces the average DRAM and system energy consumption
                 by 10.5\% and 7.3\%, respectively, while limiting the
                 average system performance loss to only 1.8\%, for a
                 variety of memory-intensive quad-core workloads. We
                 also show that Voltron significantly outperforms prior
                 dynamic voltage and frequency scaling mechanisms for
                 DRAM.",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Wang:2017:UBI,
  author =       "Cheng Wang and Bhuvan Urgaonkar and Neda Nasiriani and
                 George Kesidis",
  title =        "Using Burstable Instances in the Public Cloud: Why,
                 When and How?",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "11:1--11:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084448",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib;
                 http://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084448",
  abstract =     "Amazon EC2 and Google Compute Engine (GCE) have
                 recently introduced a new class of virtual machines
                 called 'burstable' instances that are cheaper than even
                 the smallest traditional/regular instances. These lower
                 prices come with reduced average capacity and increased
                 variance. Using measurements from both EC2 and GCE, we
                 identify key idiosyncrasies of resource capacity
                 dynamism for burstable instances that set them apart
                 from other instance types. Most importantly, certain
                 resources for these instances appear to be regulated by
                 deterministic token bucket like mechanisms. We find
                 widely different types of disclosures by providers of
                 the parameters governing these regulation mechanisms:
                 full disclosure (e.g., CPU capacity for EC2 t2
                 instances), partial disclosure (e.g., CPU capacity and
                 remote disk IO bandwidth for GCE shared-core
                 instances), or no disclosure (network bandwidth for EC2
                 t2 instances). A tenant modeling these variations as
                 random phenomena (as some recent work suggests) might
                 make sub-optimal procurement and operation decisions.
                 We present modeling techniques for a tenant to infer
                 the properties of these regulation mechanisms via
                 simple offline measurements. We also present two case
                 studies of how certain memcached workloads might
                 benefit from our modeling when operating on EC2 by: (i)
                 augmenting cheap but low availability in-memory storage
                 offered by spot instances with backup of popular
                 content on burstable instances, and (ii) temporal
                 multiplexing of multiple burstable instances to achieve
                 the CPU or network bandwidth (and thereby throughput)
                 equivalent of a more expensive regular EC2 instance.",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Ying:2017:SMM,
  author =       "Lei Ying",
  title =        "{Stein}'s Method for Mean Field Approximations in
                 Light and Heavy Traffic Regimes",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "12:1--12:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084449",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084449",
  abstract =     "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
                 equilibrium point (called the mean-field limit) of a
                 dynamical system (called the mean-field model). This
                 approximation is often justified by proving the weak
                 convergence of stationary distributions to its
                 mean-field limit. Most existing mean-field models
                 concerned the light-traffic regime where the load of
                 the system, denote by $ \rho $, is strictly less than
                 one and is independent of the size of the system. This
                 is because a traditional mean-field model represents
                 the limit of the corresponding stochastic system.
                 Therefore, the load of the mean-field model is $ \rho =
                 l i m N \to \infty \rho (N) $, where $ \rho (N) $ is
                 the load of the stochastic system of size $N$. Now if $
                 \rho (N) \to 1$ as $ N \to \infty $ (i.e., in the
                 heavy-traffic regime), then $ \rho = 1$. For most
                 systems, the mean-field limits when $ \rho = 1$ are
                 trivial and meaningless. To overcome this difficulty of
                 traditional mean-field models, this paper takes a
                 different point of view on mean-field models. Instead
                 of regarding a mean-field model as the limiting system
                 of large-scale stochastic system, it views the
                 equilibrium point of the mean-field model, called a
                 mean-field solution, simply as an approximation of the
                 stationary distribution of the finite-size system.
                 Therefore both mean-field models and solutions can be
                 functions of $N$. This paper first outlines an
                 analytical method to bound the approximation error
                 based on Stein's method and the perturbation theory. We
                 further present two examples: the M/M/N queueing system
                 and the supermarket model under the
                 power-of-two-choices algorithm. For both applications,
                 the method enables us to characterize the system
                 performance under a broad range of traffic loads. For
                 the supermarket model, this is the first paper that
                 rigorously quantifies the steady-state performance of
                 the-power-of-two-choices in the heavy-traffic regime.
                 These results in the heavy-traffic regime cannot be
                 obtained using the traditional mean-field analysis and
                 the interchange of the limits.",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Wang:2017:SGN,
  author =       "Sinong Wang and Ness Shroff",
  title =        "Security Game with Non-additive Utilities and Multiple
                 Attacker Resources",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "13:1--13:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084450",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084450",
  abstract =     "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, existing
                 security game models typically either assume additive
                 utility functions, or that the attacker can attack only
                 one target. Such assumptions lead to tractable
                 analysis, but miss key inherent dependencies that exist
                 among different targets in current complex networks. In
                 this paper, we generalize the classical security game
                 models to allow for non-additive utility functions. We
                 also allow attackers to be able to attack multiple
                 targets. We examine such a general security game from a
                 theoretical perspective and provide a unified view. In
                 particular, we show that each security game is
                 equivalent to a combinatorial optimization problem over
                 a set system $ \epsilon $, which consists of defender's
                 pure strategy space. The key technique we use is based
                 on the transformation, projection of a polytope, and
                 the ellipsoid method. This work settles several open
                 questions in security game domain and significantly
                 extends the state-of-the-art of both the polynomial
                 solvable and NP-hard class of the security game.",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Li:2017:SYE,
  author =       "Lingda Li and Robel Geda and Ari B. Hayes and Yanhao
                 Chen and Pranav Chaudhari and Eddy Z. Zhang and Mario
                 Szegedy",
  title =        "A Simple Yet Effective Balanced Edge Partition Model
                 for Parallel Computing",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "14:1--14:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084451",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084451",
  abstract =     "Graph edge partition models have recently become an
                 appealing alternative to graph vertex partition models
                 for distributed computing due to their flexibility in
                 balancing loads and their performance in reducing
                 communication cost [6, 16]. In this paper, we propose a
                 simple yet effective graph edge partitioning algorithm.
                 In practice, our algorithm provides good partition
                 quality (and better than similar state-of-the-art edge
                 partition approaches, at least for power-law graphs)
                 while maintaining low partition overhead. In theory,
                 previous work [6] showed that an approximation
                 guarantee of $ O(d_{\rm max} \sqrt {\log n \log k}) $
                 apply to the graphs with $ m = \Omega (k^2) $ edges
                 ($k$ is the number of partitions). We further
                 rigorously proved that this approximation guarantee
                 hold for all graphs. We show how our edge partition
                 model can be applied to parallel computing. We draw our
                 example from GPU program locality enhancement and
                 demonstrate that the graph edge partition model does
                 not only apply to distributed computing with many
                 computer nodes, but also to parallel computing in a
                 single computer node with a many-core processor.",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Zhou:2017:PSM,
  author =       "You Zhou and Yian Zhou and Min Chen and Shigang Chen",
  title =        "Persistent Spread Measurement for Big Network Data
                 Based on Register Intersection",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "15:1--15:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084452",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084452",
  abstract =     "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 normal-user
                 activities, such as stealthy DDoS attack, stealthy
                 network scan, or faked network trend, which cannot be
                 detected by traditional flow cardinality measurement.
                 With big network data, one challenge is to measure the
                 persistent spreads of a massive number of flows without
                 incurring too much memory overhead as such measurement
                 may be performed at the line speed by network
                 processors with fast but small on-chip memory. We
                 propose a highly compact Virtual Intersection
                 HyperLogLog (VI-HLL) architecture for this purpose. It
                 achieves far better memory efficiency than the best
                 prior work of V-Bitmap, and in the meantime drastically
                 extends the measurement range. Theoretical analysis and
                 extensive experiments demonstrate that VI-HLL provides
                 good measurement accuracy even in very tight memory
                 space of less than 1 bit per flow.",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Bondorf:2017:QCD,
  author =       "Steffen Bondorf and Paul Nikolaus and Jens B.
                 Schmitt",
  title =        "Quality and Cost of Deterministic Network Calculus:
                 Design and Evaluation of an Accurate and Fast
                 Analysis",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "16:1--16:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084453",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084453",
  abstract =     "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 of DNC
                 results has been improved steadily, resulting in two
                 DNC branches: the classical algebraic analysis and the
                 more recent optimization-based analysis. The
                 optimization-based branch provides a theoretical
                 solution for tight bounds. Its computational cost
                 grows, however, (possibly super-)exponentially with the
                 network size. Consequently, a heuristic optimization
                 formulation trading accuracy against computational
                 costs was proposed. In this article, we challenge
                 optimization-based DNC with a new algebraic DNC
                 algorithm. We show that: no current optimization
                 formulation scales well with the network size and
                 algebraic DNC can be considerably improved in both
                 aspects, accuracy and computational cost. To that end,
                 we contribute a novel DNC algorithm that transfers the
                 optimization's search for best attainable delay bounds
                 to algebraic DNC. It achieves a high degree of accuracy
                 and our novel efficiency improvements reduce the cost
                 of the analysis dramatically. In extensive numerical
                 experiments, we observe that our delay bounds deviate
                 from the optimization-based ones by only 1.142\% on
                 average while computation times simultaneously decrease
                 by several orders of magnitude.",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Gast:2017:EVE,
  author =       "Nicolas Gast",
  title =        "Expected Values Estimated via Mean-Field Approximation
                 are {$ 1 / N $}-Accurate",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "17:1--17:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084454",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084454",
  abstract =     "Mean-field approximation is a powerful tool to study
                 large-scale stochastic systems such as data-centers ---
                 one example being the famous power of two-choice
                 paradigm. It is shown in the literature that under
                 quite general conditions, the empirical measure of a
                 system of $N$ interacting objects converges at rate $
                 O(1 \sqrt {N}) $ to a deterministic dynamical system,
                 called its mean-field approximation. In this paper, we
                 revisit the accuracy of mean-field approximation by
                 focusing on expected values. We show that, under almost
                 the same 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-dimensional mean-field models. We
                 also develop a new perturbation theory argument that
                 shows that the result holds for the stationary regime
                 if the dynamical system is asymptotically exponentially
                 stable. We provide numerical experiments that
                 demonstrate that this rate of convergence is tight and
                 that illustrate the necessity of our conditions. As an
                 example, we apply our result to the classical
                 two-choice model. By combining our theory with
                 numerical experiments, we claim that, as the load rho
                 goes to 1, the average queue length of a two-choice
                 system with $N$ servers is $ \log 2 1 / (1 - \rho) + 1
                 / (2 N (1 - \rho) + O(1 / N^2))$.",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Wang:2017:CMP,
  author =       "Brandon Wang and Xiaoye Li and Leandro P. de Aguiar
                 and Daniel S. Menasche and Zubair Shafiq",
  title =        "Characterizing and Modeling Patching Practices of
                 Industrial Control Systems",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "18:1--18:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084455",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084455",
  abstract =     "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. In
                 particular, the patching of ICS devices is usually
                 deferred to scheduled production outages so as to
                 prevent potential operational disruption of critical
                 systems. Unfortunately, anecdotal evidence suggests
                 that ICS devices are riddled with security
                 vulnerabilities that are not patched in a timely
                 manner, which leaves them vulnerable to exploitation by
                 hackers, nation states, and hacktivist organizations.
                 In this paper, we present the results from our
                 longitudinal measurement and characterization study of
                 ICS patching behavior. Our study is based on IP scan
                 data collected from Shodan over the duration of three
                 years for more than 500 known industrial ICS protocols
                 and products. Our longitudinal measurements reveal the
                 impact of vulnerability disclosures on ICS patching.
                 Our analysis of more than 100 thousand Internet-exposed
                 ICS devices reveals that about 50\% upgrade to newer
                 patched versions within 60 days of a vulnerability
                 disclosure. Based on our measurement and analysis, we
                 further propose a variation of the Bass model to
                 forecast the patching behavior of ICS devices. The
                 evaluation shows that our proposed models have
                 comparable prediction accuracy when contrasted against
                 traditional ARIMA timeseries forecasting models, while
                 requiring less parameters and being amenable to direct
                 physical interpretation.",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Formby:2017:CSP,
  author =       "David Formby and Anwar Walid and Raheem Beyah",
  title =        "A Case Study in Power Substation Network Dynamics",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "19:1--19:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084456",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084456",
  abstract =     "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 thoroughly studied.
                 Significant research has been conducted to address the
                 myriad security concerns in these areas, but they are
                 virtually all based on artificial testbeds or
                 simulations designed on assumptions about their
                 behavior either from knowledge of traditional IT
                 networking or from basic principles of ICS operation.
                 In this work, we provide the most detailed
                 characterization of an example ICS to date in order to
                 determine if these common assumptions hold true. A live
                 power distribution substation is observed over the
                 course of two and a half years to measure its behavior
                 and evolution over time. Then, a horizontal study is
                 conducted that compared this behavior with three other
                 substations from the same company. Although most
                 predictions were found to be correct, some unexpected
                 behavior was observed that highlights the fundamental
                 differences between ICS and IT networks including round
                 trip times dominated by processing speed as opposed to
                 network delay, several well known TCP features being
                 largely irrelevant, and surprisingly large jitter from
                 devices running real-time operating systems. The impact
                 of these observations is discussed in terms of
                 generality to other embedded networks, network security
                 applications, and the suitability of the TCP protocol
                 for this environment.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Nguyen:2017:OIC,
  author =       "Hung T. Nguyen and Tri P. Nguyen and Tam N. Vu and
                 Thang N. Dinh",
  title =        "Outward Influence and Cascade Size Estimation in
                 Billion-scale Networks",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "20:1--20:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084457",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084457",
  abstract =     "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
                 influence measure, termed outward influence (OI),
                 defined as the (expected) number of nodes that a subset
                 of nodes S will activate, excluding the nodes in S.
                 Thus, OI equals, the de facto standard measure,
                 influence spread of S minus | S |. OI is not only more
                 informative for nodes with small influence, but also,
                 critical in designing new effective sampling and
                 statistical estimation methods. Based on OI, we propose
                 SIEA/SOIEA, novel methods to estimate influence
                 spread/outward influence at scale and with rigorous
                 theoretical guarantees. The proposed methods are built
                 on two novel components (1) IICP an important sampling
                 method for outward influence; and (2) RSA, a robust
                 mean estimation method that minimize the number of
                 samples through analyzing variance and range of random
                 variables. Compared to the state-of-the art for
                 influence estimation, SIEA is $ \Omega (\log 4 n) $
                 times faster in theory and up to several orders of
                 magnitude faster in practice. For the first time,
                 influence of nodes in the networks of billions of edges
                 can be estimated with high accuracy within a few
                 minutes. Our comprehensive experiments on real-world
                 networks also give evidence against the popular
                 practice of using a fixed number, e.g. 10K or 20K, of
                 samples to compute the 'ground truth' for influence
                 spread.",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Choi:2017:EDL,
  author =       "Wonil Choi and Mohammad Arjomand and Myoungsoo Jung
                 and Mahmut Kandemir",
  title =        "Exploiting Data Longevity for Enhancing the Lifetime
                 of Flash-based Storage Class Memory",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "21:1--21:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084458",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084458",
  abstract =     "Storage-class memory (SCM) combines the benefits of a
                 solid-state memory, such as high-performance and
                 robustness, with the archival capabilities and low cost
                 of conventional hard-disk magnetic storage. Among
                 candidate solid-state nonvolatile memory technologies
                 that could potentially be used to construct SCM, flash
                 memory is a well-established technology and have been
                 widely used in commercially available SCM incarnations.
                 Flash-based SCM enables much better tradeoffs between
                 performance, space and power than disk-based systems.
                 However, write endurance is a significant challenge for
                 a flash-based SCM (each act of writing a bit may
                 slightly damage a cell, so one flash cell can be
                 written $10^4$--$10^5$ times, depending on the flash
                 technology, before it becomes unusable). This is a
                 well-documented problem and has received a lot of
                 attention by manufactures that are using some
                 combination of write reduction and wear-leveling
                 techniques for achieving longer lifetime. In an effort
                 to improve flash lifetime, first, by quantifying data
                 longevity in an SCM, we show that a majority of the
                 data stored in a solid-state SCM do not require long
                 retention times provided by flash memory (i.e., up to
                 10 years in modern devices); second, by exploiting
                 retention time relaxation, we propose a novel
                 mechanism, called Dense-SLC (D-SLC), which enables us
                 perform multiple writes into a cell during each erase
                 cycle for lifetime extension; and finally, we discuss
                 the required changes in the flash management software
                 (FTL) in order to use D-SLC mechanism for extending the
                 lifetime of the solid-state part of an SCM. Using an
                 extensive simulation-based analysis of an SLC
                 flash-based SCM, we demonstrate that D-SLC is able to
                 significantly improve device lifetime (between 5.1X and
                 8.6X) with no performance overhead and also very small
                 changes at the FTL software.",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Venkatakrishnan:2017:DRB,
  author =       "Shaileshh Bojja Venkatakrishnan and Giulia Fanti and
                 Pramod Viswanath",
  title =        "{Dandelion}: Redesigning the {Bitcoin} Network for
                 Anonymity",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "22:1--22:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084459",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084459",
  abstract =     "Bitcoin and other cryptocurrencies have surged in
                 popularity over the last decade. Although Bitcoin does
                 not claim to provide anonymity for its users, it enjoys
                 a public perception of being a privacy preserving
                 financial system. In reality, cryptocurrencies publish
                 users' entire transaction histories in plaintext,
                 albeit under a pseudonym; this is required for
                 transaction validation. Therefore, if a user's
                 pseudonym can be linked to their human identity, the
                 privacy fallout can be significant. Recently,
                 researchers have demonstrated deanonymization attacks
                 that exploit weaknesses in the Bitcoin network's
                 peer-to-peer (P2P) networking protocols. In particular,
                 the P2P network currently forwards content in a
                 structured way that allows observers to deanonymize
                 users. In this work, we redesign the P2P network from
                 first principles with the goal of providing strong,
                 provable anonymity guarantees. We propose a simple
                 networking policy called Dandelion which provides
                 quasi-optimal, network-wide anonymity, with minimal
                 cost to the network's utility. We also discuss
                 practical implementation challenges and propose
                 heuristic solutions.",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Zhang:2017:OPP,
  author =       "Zijun Zhang and Zongpeng Li and Chuan Wu",
  title =        "Optimal Posted Prices for Online Cloud Resource
                 Allocation",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "23:1--23:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084460",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084460",
  abstract =     "We study online resource allocation in a cloud
                 computing platform through posted pricing: 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 takes the current prices,
                 renting resources to execute its job, or refuses the
                 prices without running its job there. We design pricing
                 functions based on current resource utilization ratios,
                 in a wide array of demand-supply relationships and
                 resource occupation durations, and prove worst-case
                 competitive ratios in social welfare. In the basic case
                 of a single-type, non-recycled resource (allocated
                 resources are not later released for reuse), we prove
                 that our pricing function design is optimal, in that it
                 achieves the smallest competitive ratio among all
                 possible pricing functions. Insights obtained from the
                 basic case are then used to generalize the pricing
                 functions to more realistic cloud systems with multiple
                 types of resources, where a job occupies allocated
                 resources for a number of time slots till completion,
                 upon which time the resources are returned to the cloud
                 resource pool.",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Sun:2017:ASM,
  author =       "Wen Sun and Veronique Simon and Sebastien Monnet and
                 Philippe Robert and Pierre Sens",
  title =        "Analysis of a Stochastic Model of Replication in Large
                 Distributed Storage Systems: A Mean-Field Approach",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "24:1--24:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084462",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084462",
  abstract =     "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 of copies are
                 available on the system at any time. Whenever the
                 contents of a node are lost, for instance due to a hard
                 disk crash, the system regenerates the data blocks
                 stored before the failure by transferring them from the
                 remaining replicas. This paper is focused on the
                 analysis of the efficiency of replication mechanism
                 that determines the location of the copies of a given
                 file at some server. The variability of the loads of
                 the nodes of the network is investigated for several
                 policies. Three replication mechanisms are tested
                 against simulations in the context of a real
                 implementation of a such a system: Random, Least Loaded
                 and Power of Choice. The simulations show that some of
                 these policies may lead to quite unbalanced situations:
                 if $ \beta $ is the average number of copies per node
                 it turns out that, at equilibrium, the load of the
                 nodes may exhibit a high variability. It is shown in
                 this paper that a simple variant of a power of choice
                 type algorithm has a striking effect on the loads of
                 the nodes: at equilibrium, the distribution of the load
                 of a node has a bounded support, most of nodes have a
                 load less than $ 2 \beta $ which is an interesting
                 property for the design of the storage space of these
                 systems. Stochastic models are introduced and
                 investigated to explain this interesting phenomenon.",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Mukherjee:2017:OSE,
  author =       "Debankur Mukherjee and Souvik Dhara and Sem C. Borst
                 and Johan S. H. van Leeuwaarden",
  title =        "Optimal Service Elasticity in Large-Scale Distributed
                 Systems",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "25:1--25:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084463",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084463",
  abstract =     "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 demand patterns.
                 Auto-scaling provides a popular paradigm for
                 automatically adjusting service capacity in response to
                 demand while meeting performance targets, and
                 queue-driven auto-scaling techniques have been widely
                 investigated in the literature. In typical data center
                 architectures and cloud environments however, no
                 centralized queue is maintained, and load balancing
                 algorithms immediately distribute incoming tasks among
                 parallel queues. In these distributed settings with
                 vast numbers of servers, centralized queue-driven
                 auto-scaling techniques involve a substantial
                 communication overhead and major implementation burden,
                 or may not even be viable at all. Motivated by the
                 above issues, we propose a joint auto-scaling and load
                 balancing scheme which does not require any global
                 queue length information or explicit knowledge of
                 system parameters, and yet provides provably
                 near-optimal service elasticity. We establish the
                 fluid-level dynamics for the proposed scheme in a
                 regime where the total traffic volume and nominal
                 service capacity grow large in proportion. The
                 fluid-limit results show that the proposed scheme
                 achieves asymptotic optimality in terms of
                 user-perceived delay performance as well as energy
                 consumption. Specifically, we prove that both the
                 waiting time of tasks and the relative energy portion
                 consumed by idle servers vanish in the limit. At the
                 same time, the proposed scheme operates in a
                 distributed fashion and involves only constant
                 communication overhead per task, thus ensuring
                 scalability in massive data center operations.
                 Extensive simulation experiments corroborate the
                 fluid-limit results, and demonstrate that the proposed
                 scheme can match the user performance and energy
                 consumption of state-of-the-art approaches that do take
                 full advantage of a centralized queue.",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Lee:2017:DIL,
  author =       "Donghyuk Lee and Samira Khan and Lavanya Subramanian
                 and Saugata Ghose and Rachata Ausavarungnirun and
                 Gennady Pekhimenko and Vivek Seshadri and Onur Mutlu",
  title =        "Design-Induced Latency Variation in Modern {DRAM}
                 Chips: Characterization, Analysis, and Latency
                 Reduction Mechanisms",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "26:1--26:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084464",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084464",
  abstract =     "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
                 variation that exists within a real DRAM chip, induced
                 by the design and placement of different components in
                 the DRAM chip: different regions in DRAM, based on
                 their relative distances from the peripheral
                 structures, require different minimum access latencies
                 for reliable operation. In particular, we show that in
                 most real DRAM chips, cells closer to the peripheral
                 structures can be accessed much faster than cells that
                 are farther. We call this phenomenon design-induced
                 variation in DRAM. Our goals are to (i) understand
                 design-induced variation that exists in real,
                 state-of-the-art DRAM chips, (ii) exploit it to develop
                 low-cost mechanisms that can dynamically find and use
                 the lowest latency at which to operate a DRAM chip
                 reliably, and, thus, (iii) improve overall system
                 performance while ensuring reliable system operation.
                 To this end, we first experimentally demonstrate and
                 analyze designed-induced variation in modern DRAM
                 devices by testing and characterizing 96 DIMMs (768
                 DRAM chips). Our characterization identifies DRAM
                 regions that are vulnerable to errors, if operated at
                 lower latency, and finds consistency in their locations
                 across a given DRAM chip generation, due to
                 design-induced variation. Based on our extensive
                 experimental analysis, we develop two mechanisms that
                 reliably reduce DRAM latency. First, DIVA Profiling
                 uses runtime profiling to dynamically identify the
                 lowest DRAM latency that does not introduce failures.
                 DIVA Profiling exploits design-induced variation and
                 periodically profiles only the vulnerable regions to
                 determine the lowest DRAM latency at low cost. It is
                 the first mechanism to dynamically determine the lowest
                 latency that can be used to operate DRAM reliably. DIVA
                 Profiling reduces the latency of read/write requests by
                 35.1\% / 57.8\%, respectively, at 55$^\ocirc $C. Our
                 second mechanism, DIVA Shuffling, shuffles data such
                 that values stored in vulnerable regions are mapped to
                 multiple error-correcting code (ECC) codewords. As a
                 result, DIVA Shuffling can correct 26\% more multi-bit
                 errors than conventional ECC. Combined together, our
                 two mechanisms reduce read/write latency by
                 40.0\%/60.5\%, which translates to an overall system
                 performance improvement of 14.7\%/13.7\%/13.8\% (in
                 2-/4-/8-core systems) across a variety of workloads,
                 while ensuring reliable operation.",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

@Article{Avrachenkov:2017:LCA,
  author =       "Konstantin Avrachenkov and Jasper Goseling and Berksan
                 Serbetci",
  title =        "A Low-Complexity Approach to Distributed Cooperative
                 Caching with Geographic Constraints",
  journal =      j-POMACS,
  volume =       "1",
  number =       "1",
  pages =        "27:1--27:??",
  month =        jun,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3084465",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Fri Jun 16 09:11:52 MDT 2017",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "http://dl.acm.org/citation.cfm?id=3084465",
  abstract =     "We consider caching in cellular networks in which each
                 base station is equipped with a cache that can store a
                 limited number of files. The popularity of the files is
                 known and the goal is to place files in the caches such
                 that the probability that a user at an arbitrary
                 location in the plane will find the file that she
                 requires in one of the covering caches is maximized. We
                 develop distributed asynchronous algorithms for
                 deciding which contents to store in which cache. Such
                 cooperative algorithms require communication only
                 between caches with overlapping coverage areas and can
                 operate in asynchronous manner. The development of the
                 algorithms is principally based on an observation that
                 the problem can be viewed as a potential game. Our
                 basic algorithm is derived from the best response
                 dynamics. We demonstrate that the complexity of each
                 best response step is independent of the number of
                 files, linear in the cache capacity and linear in the
                 maximum number of base stations that cover a certain
                 area. Then, we show that the overall algorithm
                 complexity for a discrete cache placement is polynomial
                 in both network size and catalog size. In practical
                 examples, the algorithm converges in just a few
                 iterations. Also, in most cases of interest, the basic
                 algorithm finds the best Nash equilibrium corresponding
                 to the global optimum. We provide two extensions of our
                 basic algorithm based on stochastic and deterministic
                 simulated annealing which find the global optimum.
                 Finally, we demonstrate the hit probability evolution
                 on real and synthetic networks numerically and show
                 that our distributed caching algorithm performs
                 significantly better than storing the most popular
                 content, probabilistic content placement policy and
                 Multi-LRU caching policies.",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "http://dl.acm.org/pub.cfm?id=J1567",
}

%%% [29-Mar-2021] Article 27 is missing from the ACM archive
@Article{Yang:2017:SRL,
  author =       "Sen Yang and Bill Lin and Jun Xu",
  title =        "Safe Randomized Load-Balanced Switching By Diffusing
                 Extra Loads",
  journal =      j-POMACS,
  volume =       "1",
  number =       "2",
  pages =        "29:1--29:37",
  month =        dec,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3154487",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:26 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3154487",
  abstract =     "Load-balanced switch architectures are known to be
                 scalable in both size and speed, which is of interest
                 due to the continued exponential growth in Internet
                 traffic. However, the main drawback of load-balanced
                 switches is that packets can depart out of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Yang:2017:PIA,
  author =       "Sen Yang and Yan He and Zihui Ge and Dongmei Wang and
                 Jun Xu",
  title =        "Predictive Impact Analysis for Designing a Resilient
                 Cellular Backhaul Network",
  journal =      j-POMACS,
  volume =       "1",
  number =       "2",
  pages =        "30:1--30:33",
  month =        dec,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3154488",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:26 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3154488",
  abstract =     "Backhaul transport network design and optimization for
                 cellular service providers involve a unique challenge
                 stemming from the fact that an end-user's equipment
                 (UE) is within the radio reach of multiple cellular
                 towers: It is hard to evaluate the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Amjad:2017:CDE,
  author =       "Muhammad J. Amjad and Devavrat Shah",
  title =        "Censored Demand Estimation in Retail",
  journal =      j-POMACS,
  volume =       "1",
  number =       "2",
  pages =        "31:1--31:28",
  month =        dec,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3154489",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:26 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3154489",
  abstract =     "In this paper, the question of interest is estimating
                 true demand of a product at a given store location and
                 time period in the retail environment based on a single
                 noisy and potentially censored observation. To address
                 this question, we introduce a \%. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Magureanu:2017:OLO,
  author =       "Stefan Magureanu and Alexandre Proutiere and Marcus
                 Isaksson and Boxun Zhang",
  title =        "Online Learning of Optimally Diverse Rankings",
  journal =      j-POMACS,
  volume =       "1",
  number =       "2",
  pages =        "32:1--32:26",
  month =        dec,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3154490",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:26 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3154490",
  abstract =     "Search engines answer users' queries by listing
                 relevant items (e.g. documents, songs, products, web
                 pages, \ldots{}). These engines rely on algorithms that
                 learn to rank items so as to present an ordered list
                 maximizing the probability that it contains \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Gast:2017:RMF,
  author =       "Nicolas Gast and Benny {Van Houdt}",
  title =        "A Refined Mean Field Approximation",
  journal =      j-POMACS,
  volume =       "1",
  number =       "2",
  pages =        "33:1--33:28",
  month =        dec,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3154491",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:26 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3154491",
  abstract =     "Mean field models are a popular means to approximate
                 large and complex stochastic models that can be
                 represented as N interacting objects. Recently it was
                 shown that under very general conditions the
                 steady-state expectation of any performance \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Wang:2017:TFC,
  author =       "Sinong Wang and Ness Shroff",
  title =        "Towards Fast-Convergence, Low-Delay and Low-Complexity
                 Network Optimization",
  journal =      j-POMACS,
  volume =       "1",
  number =       "2",
  pages =        "34:1--34:32",
  month =        dec,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3154492",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:26 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3154492",
  abstract =     "Distributed network optimization has been studied for
                 well over a decade. However, we still do not have a
                 good idea of how to design schemes that can
                 simultaneously provide good performance across the
                 dimensions of utility optimality, convergence speed,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Psychas:2017:NPV,
  author =       "Konstantinos Psychas and Javad Ghaderi",
  title =        "On Non-Preemptive {VM} Scheduling in the Cloud",
  journal =      j-POMACS,
  volume =       "1",
  number =       "2",
  pages =        "35:1--35:29",
  month =        dec,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3154493",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:26 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3154493",
  abstract =     "We study the problem of scheduling VMs (Virtual
                 Machines) in a distributed server platform, motivated
                 by cloud computing applications. The VMs arrive
                 dynamically over time to the system, and require a
                 certain amount of resources (e.g. memory, CPU, etc)
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Yang:2017:ORO,
  author =       "Lin Yang and Wing Shing Wong and Mohammad H.
                 Hajiesmaili",
  title =        "An Optimal Randomized Online Algorithm for {QoS}
                 Buffer Management",
  journal =      j-POMACS,
  volume =       "1",
  number =       "2",
  pages =        "36:1--36:26",
  month =        dec,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3154494",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:26 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3154494",
  abstract =     "The QoS (Quality of Service) buffer management
                 problem, with significant and diverse computer
                 applications, e.g., in online cloud resource allocation
                 problems, is a classic online admission control problem
                 in the presence of resource constraints. In its
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Doan:2017:CRD,
  author =       "Thinh T. Doan and Carolyn L. Beck and R. Srikant",
  title =        "On the Convergence Rate of Distributed Gradient
                 Methods for Finite-Sum Optimization under Communication
                 Delays",
  journal =      j-POMACS,
  volume =       "1",
  number =       "2",
  pages =        "37:1--37:27",
  month =        dec,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3154496",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:26 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3154496",
  abstract =     "Motivated by applications in machine learning and
                 statistics, we study distributed optimization problems
                 over a network of processors, where the goal is to
                 optimize a global objective composed of a sum of local
                 functions. In these problems, due to the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Aghajani:2017:PMA,
  author =       "Reza Aghajani and Xingjie Li and Kavita Ramanan",
  title =        "The {PDE} Method for the Analysis of Randomized Load
                 Balancing Networks",
  journal =      j-POMACS,
  volume =       "1",
  number =       "2",
  pages =        "38:1--38:28",
  month =        dec,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3154497",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:26 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3154497",
  abstract =     "We introduce a new framework for the analysis of
                 large-scale load balancing networks with general
                 service time distributions, motivated by applications
                 in server farms, distributed memory machines, cloud
                 computing and communication systems. For a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Zhou:2017:DLC,
  author =       "Xingyu Zhou and Fei Wu and Jian Tan and Yin Sun and
                 Ness Shroff",
  title =        "Designing Low-Complexity Heavy-Traffic Delay-Optimal
                 Load Balancing Schemes: Theory to Algorithms",
  journal =      j-POMACS,
  volume =       "1",
  number =       "2",
  pages =        "39:1--39:30",
  month =        dec,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3154498",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:26 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3154498",
  abstract =     "In this paper, we establish a unified analytical
                 framework for designing load balancing algorithms that
                 can simultaneously achieve low latency, low complexity,
                 and low communication overhead. We first propose a
                 general class \Pi of load balancing \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Berg:2017:TOP,
  author =       "Benjamin Berg and Jan-Pieter Dorsman and Mor
                 Harchol-Balter",
  title =        "Towards Optimality in Parallel Scheduling",
  journal =      j-POMACS,
  volume =       "1",
  number =       "2",
  pages =        "40:1--40:30",
  month =        dec,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3154499",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:26 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3154499",
  abstract =     "To keep pace with Moore's law, chip designers have
                 focused on increasing the number of cores per chip
                 rather than single core performance. In turn, modern
                 jobs are often designed to run on any number of cores.
                 However, to effectively leverage these \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Bonald:2017:PBF,
  author =       "Thomas Bonald and C{\'e}line Comte and Fabien
                 Mathieu",
  title =        "Performance of Balanced Fairness in Resource Pools: a
                 Recursive Approach",
  journal =      j-POMACS,
  volume =       "1",
  number =       "2",
  pages =        "41:1--41:25",
  month =        dec,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3154500",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:26 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3154500",
  abstract =     "Understanding the performance of a pool of servers is
                 crucial for proper dimensioning. One of the main
                 challenges is to take into account the complex
                 interactions between servers that are pooled to process
                 jobs. In particular, a job can generally not be
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Pignolet:2017:TNP,
  author =       "Yvonne-Anne Pignolet and Stefan Schmid and Gilles
                 Tredan",
  title =        "Tomographic Node Placement Strategies and the Impact
                 of the Routing Model",
  journal =      j-POMACS,
  volume =       "1",
  number =       "2",
  pages =        "42:1--42:23",
  month =        dec,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3154501",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:26 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3154501",
  abstract =     "Fault-tolerant computer networks rely on mechanisms
                 supporting the fast detection of link failures.
                 Tomographic techniques can be used to implement such
                 mechanisms at low cost: it is often sufficient to
                 deploy a small number of tomography nodes \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Schardl:2017:CFC,
  author =       "Tao B. Schardl and Tyler Denniston and Damon Doucet
                 and Bradley C. Kuszmaul and I-Ting Angelina Lee and
                 Charles E. Leiserson",
  title =        "The {CSI} Framework for Compiler-Inserted Program
                 Instrumentation",
  journal =      j-POMACS,
  volume =       "1",
  number =       "2",
  pages =        "43:1--43:25",
  month =        dec,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3154502",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:26 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3154502",
  abstract =     "The CSI framework provides comprehensive static
                 instrumentation that a compiler can insert into a
                 program-under-test so that dynamic-analysis tools ---
                 memory checkers, race detectors, cache simulators,
                 performance profilers, code-coverage analyzers, etc.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Chen:2017:DSM,
  author =       "Yudong Chen and Lili Su and Jiaming Xu",
  title =        "Distributed Statistical Machine Learning in
                 Adversarial Settings: {Byzantine} Gradient Descent",
  journal =      j-POMACS,
  volume =       "1",
  number =       "2",
  pages =        "44:1--44:25",
  month =        dec,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3154503",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:26 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3154503",
  abstract =     "We consider the distributed statistical learning
                 problem over decentralized systems that are prone to
                 adversarial attacks. This setup arises in many
                 practical applications, including Google's Federated
                 Learning. Formally, we focus on a decentralized
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Chen:2017:FGE,
  author =       "Xiaomeng Chen and Jiayi Meng and Y. Charlie Hu and
                 Maruti Gupta and Ralph Hasholzner and Venkatesan
                 Nallampatti Ekambaram and Ashish Singh and
                 Srikathyayani Srikanteswara",
  title =        "A Fine-grained Event-based Modem Power Model for
                 Enabling In-depth Modem Energy Drain Analysis",
  journal =      j-POMACS,
  volume =       "1",
  number =       "2",
  pages =        "45:1--45:28",
  month =        dec,
  year =         "2017",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3154504",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:26 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3154504",
  abstract =     "Cellular modems enable ubiquitous Internet
                 connectivities to modern smartphones, but in doing so
                 they become a major contributor to the smartphone
                 energy drain. Understanding modem energy drain requires
                 a detailed power model. The prior art, an RRC-.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "45",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Zhang:2018:PSF,
  author =       "Shenglin Zhang and Ying Liu and Weibin Meng and
                 Zhiling Luo and Jiahao Bu and Sen Yang and Peixian
                 Liang and Dan Pei and Jun Xu and Yuzhi Zhang and Yu
                 Chen and Hui Dong and Xianping Qu and Lei Song",
  title =        "{PreFix}: Switch Failure Prediction in Datacenter
                 Networks",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "2:1--2:29",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179405",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179405",
  abstract =     "In modern datacenter networks (DCNs), failures of
                 network devices are the norm rather than the exception,
                 and many research efforts have focused on dealing with
                 failures after they happen. In this paper, we take a
                 different approach by predicting \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Freeman:2018:DPS,
  author =       "Rupert Freeman and Seyed Majid Zahedi and Vincent
                 Conitzer and Benjamin C. Lee",
  title =        "Dynamic Proportional Sharing: a Game-Theoretic
                 Approach",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "3:1--3:36",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179406",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179406",
  abstract =     "Sharing computational resources amortizes cost and
                 improves utilization and efficiency. When agents pool
                 their resources together, each becomes entitled to a
                 portion of the shared pool. Static allocations in each
                 round can guarantee entitlements and are \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Kuhnle:2018:NRL,
  author =       "Alan Kuhnle and Victoria G. Crawford and My T. Thai",
  title =        "Network Resilience and the Length-Bounded Multicut
                 Problem: Reaching the Dynamic Billion-Scale with
                 Guarantees",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "4:1--4:26",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179407",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179407",
  abstract =     "Motivated by networked systems in which the
                 functionality of the network depends on vertices in the
                 network being within a bounded distance T of each
                 other, we study the length-bounded multicut problem:
                 given a set of pairs, find a minimum-size set of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Tan:2018:RPS,
  author =       "Jian Tan and Guocong Quan and Kaiyi Ji and Ness
                 Shroff",
  title =        "On Resource Pooling and Separation for {LRU} Caching",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "5:1--5:31",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179408",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179408",
  abstract =     "Caching systems using the Least Recently Used (LRU)
                 principle have now become ubiquitous. A fundamental
                 question for these systems is whether the cache space
                 should be pooled together or divided to serve multiple
                 flows of data item requests in order to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Islam:2018:WSL,
  author =       "Mohammad A. Islam and Luting Yang and Kiran Ranganath
                 and Shaolei Ren",
  title =        "Why Some Like It Loud: Timing Power Attacks in
                 Multi-tenant Data Centers Using an Acoustic Side
                 Channel",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "6:1--6:33",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179409",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179409",
  abstract =     "The common practice of power infrastructure
                 oversubscription in data centers exposes dangerous
                 vulnerabilities to well-timed power attacks (i.e.,
                 maliciously timed power loads to overload the
                 infrastructure capacity), possibly creating outages and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Duran:2018:AOC,
  author =       "Santiago Duran and Ina Maria Verloop",
  title =        "Asymptotic Optimal Control of {Markov}-Modulated
                 Restless Bandits",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "7:1--7:25",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179410",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179410",
  abstract =     "This paper studies optimal control subject to changing
                 conditions. This is an area that recently received a
                 lot of attention as it arises in numerous situations in
                 practice. Some applications being cloud computing
                 systems where the arrival rates of new \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Tan:2018:SMV,
  author =       "Zhaowei Tan and Yuanjie Li and Qianru Li and Zhehui
                 Zhang and Zhehan Li and Songwu Lu",
  title =        "Supporting Mobile {VR} in {LTE} Networks: How Close
                 Are We?",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "8:1--8:31",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179411",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179411",
  abstract =     "Mobile virtual reality (VR) headsets (e.g., Google
                 Cardboard and Samsung Gear VR) seek to offer ``anytime,
                 anywhere'' panorama, immerse 3D experiences for users.
                 In this work, we study the viability of supporting
                 mobile VR over operational 4G LTE networks,. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Ahmadian:2018:ECH,
  author =       "Saba Ahmadian and Onur Mutlu and Hossein Asadi",
  title =        "{ECI-Cache}: a High-Endurance and Cost-Efficient {I/O}
                 Caching Scheme for Virtualized Platforms",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "9:1--9:34",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179412",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179412",
  abstract =     "In recent years, high interest in using Virtual
                 Machines (VMs) in data centers and Cloud computing has
                 significantly increased the demand for high-performance
                 data storage systems. A straightforward approach to
                 provide a high performance storage system \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Eliav:2018:BGD,
  author =       "Buchnik Eliav and Edith Cohen",
  title =        "Bootstrapped Graph Diffusions: Exposing the Power of
                 Nonlinearity",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "10:1--10:19",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179413",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179413",
  abstract =     "Graph-based semi-supervised learning (SSL) algorithms
                 predict labels for all nodes based on provided labels
                 of a small set of seed nodes. Classic methods capture
                 the graph structure through some underlying diffusion
                 process that propagates through the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Liang:2018:MQL,
  author =       "Qingkai Liang and Eytan Modiano",
  title =        "Minimizing Queue Length Regret Under Adversarial
                 Network Models",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "11:1--11:32",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179414",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179414",
  abstract =     "Stochastic models have been dominant in network
                 optimization theory for over two decades, due to their
                 analytical tractability. However, these models fail to
                 capture non-stationary or even adversarial network
                 dynamics which are of increasing importance \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Wei:2018:OLW,
  author =       "Xiaohan Wei and Hao Yu and Michael J. Neely",
  title =        "Online Learning in Weakly Coupled {Markov} Decision
                 Processes: a Convergence Time Study",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "12:1--12:38",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179415",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179415",
  abstract =     "We consider multiple parallel Markov decision
                 processes (MDPs) coupled by global constraints, where
                 the time varying objective and constraint functions can
                 only be observed after the decision is made. Special
                 attention is given to how well the decision \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Yun:2018:MAB,
  author =       "Donggyu Yun and Alexandre Proutiere and Sumyeong Ahn
                 and Jinwoo Shin and Yung Yi",
  title =        "Multi-armed Bandit with Additional Observations",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "13:1--13:22",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179416",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179416",
  abstract =     "We study multi-armed bandit (MAB) problems with
                 additional observations, where in each round, the
                 decision maker selects an arm to play and can also
                 observe rewards of additional arms (within a given
                 budget) by paying certain costs. In the case of
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Mukherjee:2018:AOL,
  author =       "Debankur Mukherjee and Sem C. Borst and Johan S. H.
                 van Leeuwaarden",
  title =        "Asymptotically Optimal Load Balancing Topologies",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "14:1--14:29",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179417",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179417",
  abstract =     "We consider a system of N servers inter-connected by
                 some underlying graph topology G$_N$. Tasks with
                 unit-mean exponential processing times arrive at the
                 various servers as independent Poisson processes of
                 rate \lambda . Each incoming task is irrevocably
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Anand:2018:WIB,
  author =       "Arjun Anand and Gustavo de Veciana",
  title =        "A {Whittle}'s Index Based Approach for {QoE}
                 Optimization in Wireless Networks",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "15:1--15:39",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179418",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179418",
  abstract =     "The design of schedulers to optimize heterogeneous
                 users' Quality of Experience (QoE) remains a
                 challenging and important problem for wireless systems.
                 This paper explores three inter-related aspects of this
                 problem: (1) non-linear relationships between
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Scully:2018:SOC,
  author =       "Ziv Scully and Mor Harchol-Balter and Alan
                 Scheller-Wolf",
  title =        "{SOAP}: One Clean Analysis of All Age-Based Scheduling
                 Policies",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "16:1--16:30",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179419",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179419",
  abstract =     "We consider an extremely broad class of M/G/1
                 scheduling policies called SOAP: Schedule Ordered by
                 Age-based Priority. The SOAP policies include almost
                 all scheduling policies in the literature as well as an
                 infinite number of variants which have never \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Zheng:2018:HCL,
  author =       "Pengfei Zheng and Benjamin C. Lee",
  title =        "Hound: Causal Learning for Datacenter-scale Straggler
                 Diagnosis",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "17:1--17:36",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179420",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179420",
  abstract =     "Stragglers are exceptionally slow tasks within a job
                 that delay its completion. Stragglers, which are
                 uncommon within a single job, are pervasive in
                 datacenters with many jobs. A large body of research
                 has focused on mitigating datacenter stragglers,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Jiang:2018:CSM,
  author =       "Bo Jiang and Philippe Nain and Don Towsley and Saikat
                 Guha",
  title =        "On a Class of Stochastic Multilayer Networks",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "18:1--18:25",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179421",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179421",
  abstract =     "In this paper, we introduce a new class of stochastic
                 multilayer networks. A stochastic multilayer network is
                 the aggregation of M networks (one per layer) where
                 each is a subgraph of a foundational network G. Each
                 layer network is the result of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Nitu:2018:WSS,
  author =       "Vlad Nitu and Aram Kocharyan and Hannas Yaya and Alain
                 Tchana and Daniel Hagimont and Hrachya Astsatryan",
  title =        "Working Set Size Estimation Techniques in Virtualized
                 Environments: One Size Does not Fit All",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "19:1--19:22",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179422",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179422",
  abstract =     "Energy consumption is a primary concern for
                 datacenters? management. Numerous datacenters are
                 relying on virtualization, as it provides flexible
                 resource management means such as virtual machine (VM)
                 checkpoint/restart, migration and consolidation.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Zhou:2018:DQI,
  author =       "Xingyu Zhou and Fei Wu and Jian Tan and Kannan
                 Srinivasan and Ness Shroff",
  title =        "Degree of Queue Imbalance: Overcoming the Limitation
                 of Heavy-traffic Delay Optimality in Load Balancing
                 Systems",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "21:1--21:41",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179424",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179424",
  abstract =     "Heavy-traffic delay optimality is considered to be an
                 important metric in evaluating the delay performance of
                 load balancing schemes. In this paper, we argue that
                 heavy-traffic delay optimality is a coarse metric that
                 does not necessarily imply good \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Subramanian:2018:SFT,
  author =       "Kausik Subramanian and Loris D'Antoni and Aditya
                 Akella",
  title =        "Synthesis of Fault-Tolerant Distributed Router
                 Configurations",
  journal =      j-POMACS,
  volume =       "2",
  number =       "1",
  pages =        "22:1--22:26",
  month =        apr,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3179425",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:28 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3179425",
  abstract =     "Operators of modern networks require support for
                 diverse and complex end-to-end policies, such as,
                 middlebox traversals, isolation, and traffic
                 engineering. While Software-defined Networking (SDN)
                 provides centralized custom routing functionality in
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Wierman:2018:ME,
  author =       "Adam Wierman and Aditya Akella",
  title =        "Message from the {Editors}",
  journal =      j-POMACS,
  volume =       "2",
  number =       "2",
  pages =        "23:1--23:1",
  month =        jun,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3224418",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3224418",
  abstract =     "This issue marks the completion of the first year of
                 the Proceedings of the ACM on Measurement and Analysis
                 of Computing Systems (POMACS). POMACS was among the
                 first three journals joining the recently launched
                 Proceedings of the ACM (PACM) series, and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Yang:2018:OAO,
  author =       "Lin Yang and Lei Deng and Mohammad H. Hajiesmaili and
                 Cheng Tan and Wing Shing Wong",
  title =        "An Optimal Algorithm for Online Non-Convex Learning",
  journal =      j-POMACS,
  volume =       "2",
  number =       "2",
  pages =        "25:1--25:25",
  month =        jun,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3224420",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3224420",
  abstract =     "In many online learning paradigms, convexity plays a
                 central role in the derivation and analysis of online
                 learning algorithms. The results, however, fail to be
                 extended to the non-convex settings, while
                 non-convexity is necessitated by a large number
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Wang:2018:NNM,
  author =       "Mowei Wang and Yong Cui and Shihan Xiao and Xin Wang
                 and Dan Yang and Kai Chen and Jun Zhu",
  title =        "Neural Network Meets {DCN}: Traffic-driven Topology
                 Adaptation with Deep Learning",
  journal =      j-POMACS,
  volume =       "2",
  number =       "2",
  pages =        "26:1--26:25",
  month =        jun,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3224421",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3224421",
  abstract =     "The emerging optical/wireless topology reconfiguration
                 technologies have shown great potential in improving
                 the performance of data center networks. However, it
                 also poses a big challenge on how to find the best
                 topology configurations to support the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Hellemans:2018:PDC,
  author =       "Tim Hellemans and Benny {Van Houdt}",
  title =        "On the Power-of-d-choices with Least Loaded Server
                 Selection",
  journal =      j-POMACS,
  volume =       "2",
  number =       "2",
  pages =        "27:1--27:22",
  month =        jun,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3224422",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3224422",
  abstract =     "Motivated by distributed schedulers that combine the
                 power-of-d-choices with late binding and systems that
                 use replication with cancellation-on-start, we study
                 the performance of the LL(d) policy which assigns a job
                 to a server that currently has the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Oleksenko:2018:IME,
  author =       "Oleksii Oleksenko and Dmitrii Kuvaiskii and Pramod
                 Bhatotia and Pascal Felber and Christof Fetzer",
  title =        "{Intel MPX} Explained: a Cross-layer Analysis of the
                 {Intel MPX} System Stack",
  journal =      j-POMACS,
  volume =       "2",
  number =       "2",
  pages =        "28:1--28:30",
  month =        jun,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3224423",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3224423",
  abstract =     "Memory-safety violations are the primary cause of
                 security and reliability issues in software systems
                 written in unsafe languages. Given the limited adoption
                 of decades-long research in software-based memory
                 safety approaches, as an alternative, Intel \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Fanti:2018:DLC,
  author =       "Giulia Fanti and Shaileshh Bojja Venkatakrishnan and
                 Surya Bakshi and Bradley Denby and Shruti Bhargava and
                 Andrew Miller and Pramod Viswanath",
  title =        "Dandelion++: Lightweight Cryptocurrency Networking
                 with Formal Anonymity Guarantees",
  journal =      j-POMACS,
  volume =       "2",
  number =       "2",
  pages =        "29:1--29:35",
  month =        jun,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3224424",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3224424",
  abstract =     "Recent work has demonstrated significant anonymity
                 vulnerabilities in Bitcoin's networking stack. In
                 particular, the current mechanism for broadcasting
                 Bitcoin transactions allows third-party observers to
                 link transactions to the IP addresses that \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Sejourne:2018:PFM,
  author =       "Thibault S{\'e}journ{\`e} and Samitha Samaranayake and
                 Siddhartha Banerjee",
  title =        "The Price of Fragmentation in Mobility-on-Demand
                 Services",
  journal =      j-POMACS,
  volume =       "2",
  number =       "2",
  pages =        "30:1--30:26",
  month =        jun,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3224425",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3224425",
  abstract =     "Mobility-on-Demand platforms are a fast growing
                 component of the urban transit ecosystem. Though a
                 growing literature addresses the question of how to
                 make individual MoD platforms more efficient, much less
                 is known about the cost of market \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Hoffmann:2018:CUC,
  author =       "Jessica Hoffmann and Constantine Caramanis",
  title =        "The Cost of Uncertainty in Curing Epidemics",
  journal =      j-POMACS,
  volume =       "2",
  number =       "2",
  pages =        "31:1--31:33",
  month =        jun,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3224426",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3224426",
  abstract =     "Motivated by the study of controlling (curing)
                 epidemics, we consider the spread of an SI process on a
                 known graph, where we have a limited budget to use to
                 transition infected nodes back to the susceptible state
                 (i.e., to cure nodes). Recent work has \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Berger:2018:PBO,
  author =       "Daniel S. Berger and Nathan Beckmann and Mor
                 Harchol-Balter",
  title =        "Practical Bounds on Optimal Caching with Variable
                 Object Sizes",
  journal =      j-POMACS,
  volume =       "2",
  number =       "2",
  pages =        "32:1--32:38",
  month =        jun,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3224427",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3224427",
  abstract =     "Many recent caching systems aim to improve miss
                 ratios, but there is no good sense among practitioners
                 of how much further miss ratios can be improved. In
                 other words, should the systems community continue
                 working on this problem? Currently, there is no
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Vlachou:2018:LTL,
  author =       "Christina Vlachou and Ioannis Pefkianakis and Kyu-Han
                 Kim",
  title =        "{LTERadar}: Towards {LTE}-Aware {Wi-Fi} Access
                 Points",
  journal =      j-POMACS,
  volume =       "2",
  number =       "2",
  pages =        "33:1--33:31",
  month =        jun,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3224428",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3224428",
  abstract =     "Major cellular hardware vendors (e.g. Qualcomm,
                 Ericsson), mobile service providers (e.g. Verizon,
                 T-Mobile) and standardization bodies (LTE-U forum,
                 3GPP) are seeking to extend LTE networks into
                 unlicensed bands to boost LTE speeds and coverage.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Borst:2018:DSM,
  author =       "Sem Borst and Martin Zubeldia",
  title =        "Delay Scaling in Many-Sources Wireless Networks
                 without Queue State Information",
  journal =      j-POMACS,
  volume =       "2",
  number =       "2",
  pages =        "34:1--34:45",
  month =        jun,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3224429",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3224429",
  abstract =     "We examine a canonical scenario where several wireless
                 data sources generate sporadic delay-sensitive messages
                 that need to be transmitted to a common access point.
                 The access point operates in a time-slotted fashion,
                 and can instruct the various \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Jain:2018:QEC,
  author =       "Akshay Jain and Mahmoud Khairy and Timothy G. Rogers",
  title =        "A Quantitative Evaluation of Contemporary {GPU}
                 Simulation Methodology",
  journal =      j-POMACS,
  volume =       "2",
  number =       "2",
  pages =        "35:1--35:28",
  month =        jun,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3224430",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3224430",
  abstract =     "Contemporary Graphics Processing Units (GPUs) are used
                 to accelerate highly parallel compute workloads. For
                 the last decade, researchers in academia and industry
                 have used cycle-level GPU architecture simulators to
                 evaluate future designs. This paper \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Talebi:2018:LPF,
  author =       "Mohammad Sadegh Talebi and Alexandre Proutiere",
  title =        "Learning Proportionally Fair Allocations with Low
                 Regret",
  journal =      j-POMACS,
  volume =       "2",
  number =       "2",
  pages =        "36:1--36:31",
  month =        jun,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3224431",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3224431",
  abstract =     "This paper addresses a generic sequential resource
                 allocation problem, where in each round a decision
                 maker selects an allocation of resources (servers) to a
                 set of tasks consisting of a large number of jobs. A
                 job of task i assigned to server j is \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Luo:2018:INF,
  author =       "Yixin Luo and Saugata Ghose and Yu Cai and Erich F.
                 Haratsch and Onur Mutlu",
  title =        "Improving {$3$D NAND} Flash Memory Lifetime by
                 Tolerating Early Retention Loss and Process Variation",
  journal =      j-POMACS,
  volume =       "2",
  number =       "3",
  pages =        "37:1--37:48",
  month =        dec,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3224432",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3224432",
  abstract =     "Compared to planar (i.e., two-dimensional) NAND flash
                 memory, 3D NAND flash memory uses a new flash cell
                 design, and vertically stacks dozens of silicon layers
                 in a single chip. This allows 3D NAND flash memory to
                 increase storage density using a much \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Ghose:2018:WYD,
  author =       "Saugata Ghose and Abdullah Giray Yaglik{\c{c}}i and
                 Raghav Gupta and Donghyuk Lee and Kais Kudrolli and
                 William X. Liu and Hasan Hassan and Kevin K. Chang and
                 Niladrish Chatterjee and Aditya Agrawal and Mike
                 O'Connor and Onur Mutlu",
  title =        "What Your {DRAM} Power Models Are Not Telling You:
                 Lessons from a Detailed Experimental Study",
  journal =      j-POMACS,
  volume =       "2",
  number =       "3",
  pages =        "38:1--38:41",
  month =        dec,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3224419",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3224419",
  abstract =     "Main memory (DRAM) consumes as much as half of the
                 total system power in a computer today, due to the
                 increasing demand for memory capacity and bandwidth.
                 There is a growing need to understand and analyze DRAM
                 power consumption, which can be used to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Tang:2018:QDL,
  author =       "Xulong Tang and Ashutosh Pattnaik and Onur Kayiran and
                 Adwait Jog and Mahmut Taylan Kandemir and Chita Das",
  title =        "Quantifying Data Locality in Dynamic Parallelism in
                 {GPUs}",
  journal =      j-POMACS,
  volume =       "2",
  number =       "3",
  pages =        "39:1--39:24",
  month =        dec,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3287318",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3287318",
  abstract =     "GPUs are becoming prevalent in various domains of
                 computing and are widely used for streaming (regular)
                 applications. However, they are highly inefficient when
                 executing irregular applications with unstructured
                 inputs due to load imbalance. Dynamic \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Agarwal:2018:MAT,
  author =       "Anish Agarwal and Muhammad Jehangir Amjad and Devavrat
                 Shah and Dennis Shen",
  title =        "Model Agnostic Time Series Analysis via Matrix
                 Estimation",
  journal =      j-POMACS,
  volume =       "2",
  number =       "3",
  pages =        "40:1--40:39",
  month =        dec,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3287319",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3287319",
  abstract =     "We propose an algorithm to impute and forecast a time
                 series by transforming the observed time series into a
                 matrix, utilizing matrix estimation to recover missing
                 values and de-noise observed entries, and performing
                 linear regression to make \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Zhou:2018:HTD,
  author =       "Xingyu Zhou and Jian Tan and Ness Shroff",
  title =        "Heavy-traffic Delay Optimality in Pull-based Load
                 Balancing Systems: Necessary and Sufficient
                 Conditions",
  journal =      j-POMACS,
  volume =       "2",
  number =       "3",
  pages =        "41:1--41:33",
  month =        dec,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3287323",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3287323",
  abstract =     "In this paper, we consider a load balancing system
                 under a general pull-based policy. In particular, each
                 arrival is randomly dispatched to one of the servers
                 with queue length below a threshold; if none exists,
                 this arrival is randomly dispatched to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Tang:2018:CND,
  author =       "Xulong Tang and Mahmut Taylan Kandemir and Hui Zhao
                 and Myoungsoo Jung and Mustafa Karakoy",
  title =        "Computing with Near Data",
  journal =      j-POMACS,
  volume =       "2",
  number =       "3",
  pages =        "42:1--42:30",
  month =        dec,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3287321",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3287321",
  abstract =     "One cost that plays a significant role in shaping the
                 overall performance of both single-threaded and
                 multi-thread applications in modern computing systems
                 is the cost of moving data between compute elements and
                 storage elements. Traditional approaches \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Ciucu:2018:TEK,
  author =       "Florin Ciucu and Felix Poloczek",
  title =        "Two Extensions of {Kingman}'s {GI/G/1} Bound",
  journal =      j-POMACS,
  volume =       "2",
  number =       "3",
  pages =        "43:1--43:33",
  month =        dec,
  year =         "2018",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3287322",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:29 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3287322",
  abstract =     "A simple bound in GI/G/1 queues was obtained by
                 Kingman using a discrete martingale transform. We
                 extend this technique to (1) multiclass $ \Sigma $
                 {GI/G/1} queues and (2) Markov Additive Processes
                 (MAPs) whose background processes can be
                 time-inhomogeneous \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Nguyen:2019:NRA,
  author =       "Lan N. Nguyen and My T. Thai",
  title =        "Network Resilience Assessment via {QoS} Degradation
                 Metrics: an Algorithmic Approach",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "1:1--1:32",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311072",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311072",
  abstract =     "This paper focuses on network resilience to
                 perturbation of edge weight. Other than connectivity,
                 many network applications nowadays rely upon some
                 measure of network distance between a pair of connected
                 nodes. In these systems, a metric related to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "1",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Liu:2019:PCL,
  author =       "Ran Liu and Edmund Yeh and Atilla Eryilmaz",
  title =        "Proactive Caching for Low Access-Delay Services under
                 Uncertain Predictions",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "2:1--2:46",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311073",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311073",
  abstract =     "Network traffic of delay-sensitive services has become
                 a dominant part in the network. Proactive caching with
                 the aid of predictive information has been proposed as
                 a promising method to enhance the delay performance,
                 which is one of the principal \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "2",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Zhu:2019:UNP,
  author =       "Xiao Zhu and Yihua Ethan Guo and Ashkan Nikravesh and
                 Feng Qian and Z. Morley Mao",
  title =        "Understanding the Networking Performance of {Wear
                 OS}",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "3:1--3:25",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311074",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311074",
  abstract =     "Networking on wearable devices such as smartwatches is
                 becoming increasingly important as fueled by new
                 hardware, OS support, and applications. In this paper,
                 we conduct a first in-depth investigation of the
                 networking performance of Wear OS, one of the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "3",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{vanderBoor:2019:HSJ,
  author =       "Mark van der Boor and Sem Borst and Johan van
                 Leeuwaarden",
  title =        "Hyper-Scalable {JSQ} with Sparse Feedback",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "4:1--4:37",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311075",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311075",
  abstract =     "Load balancing algorithms play a vital role in
                 enhancing performance in data centers and cloud
                 networks. Due to the massive size of these systems,
                 scalability challenges, and especially the
                 communication overhead associated with load balancing
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "4",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Ngoc:2019:EYS,
  author =       "Tu Dinh Ngoc and Bao Bui and Stella Bitchebe and Alain
                 Tchana and Valerio Schiavoni and Pascal Felber and
                 Daniel Hagimont",
  title =        "Everything You Should Know About {Intel SGX}
                 Performance on Virtualized Systems",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "5:1--5:21",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311076",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://portal.acm.org/http://www.math.utah.edu/pub/tex/bib/pomacs.bib;
                 http://www.math.utah.edu/pub/tex/bib/virtual-machines.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311076",
  abstract =     "Intel SGX has attracted much attention from academia
                 and is already powering commercial applications. Cloud
                 providers have also started implementing SGX in their
                 cloud offerings. Research efforts on Intel SGX so far
                 have mainly concentrated on its \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Yu:2019:ALB,
  author =       "Haoran Yu and Ermin Wei and Randall A. Berry",
  title =        "Analyzing Location-Based Advertising for Vehicle
                 Service Providers Using Effective Resistances",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "6:1--6:35",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311077",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311077",
  abstract =     "Vehicle service providers can display commercial ads
                 in their vehicles based on passengers' origins and
                 destinations to create a new revenue stream. In this
                 work, we study a vehicle service provider who can
                 generate different ad revenues when displaying
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "6",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Combes:2019:CEE,
  author =       "Richard Combes and Mikael Touati",
  title =        "Computationally Efficient Estimation of the Spectral
                 Gap of a {Markov} Chain",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "7:1--7:21",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311078",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311078",
  abstract =     "We consider the problem of estimating from sample
                 paths the absolute spectral gap 1 - \lambda of a
                 reversible, irreducible and aperiodic Markov chain
                 (X_t)_t \in N over a finite state space \Omega . We
                 propose the UCPI (Upper Confidence Power Iteration)
                 algorithm for \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "7",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Han:2019:TWD,
  author =       "Youil Han and Bryan S. Kim and Jeseong Yeon and
                 Sungjin Lee and Eunji Lee",
  title =        "{TeksDB}: Weaving Data Structures for a
                 High-Performance Key--Value Store",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "8:1--8:23",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311079",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311079",
  abstract =     "In this paper, we examine the design tradeoffs of
                 existing in-memory data structures of a
                 state-of-the-art key-value store. We observe that no
                 data structures provide both fast point-accesses and
                 consistent ranged- retrievals, and naive amalgamations
                 of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "8",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Akram:2019:CGP,
  author =       "Shoaib Akram and Jennifer Sartor and Kathryn McKinley
                 and Lieven Eeckhout",
  title =        "Crystal Gazer: Profile-Driven Write-Rationing Garbage
                 Collection for Hybrid Memories",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "9:1--9:27",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311080",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311080",
  abstract =     "Non-volatile memories (NVM) offer greater capacity
                 than DRAM but suffer from high latency and low write
                 endurance. Hybrid memories combine DRAM and NVM to form
                 scalable memory systems with the promise of high
                 capacity, low energy consumption, and high \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "9",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Lin:2019:COO,
  author =       "Qiulin Lin and Hanling Yi and John Pang and Minghua
                 Chen and Adam Wierman and Michael Honig and Yuanzhang
                 Xiao",
  title =        "Competitive Online Optimization under Inventory
                 Constraints",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "10:1--10:28",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311081",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311081",
  abstract =     "This paper studies online optimization under inventory
                 (budget) constraints. While online optimization is a
                 well-studied topic, versions with inventory constraints
                 have proven difficult. We consider a formulation of
                 inventory-constrained optimization \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "10",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Su:2019:CLB,
  author =       "Lili Su and Martin Zubeldia and Nancy Lynch",
  title =        "Collaboratively Learning the Best Option on Graphs,
                 Using Bounded Local Memory",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "11:1--11:32",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311082",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311082",
  abstract =     "We consider multi-armed bandit problems in social
                 groups wherein each individual has bounded memory and
                 shares the common goal of learning the best arm/option.
                 We say an individual learns the best option if
                 eventually (as $ t \diverge $) it pulls only the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Su:2019:SDG,
  author =       "Lili Su and Jiaming Xu",
  title =        "Securing Distributed Gradient Descent in High
                 Dimensional Statistical Learning",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "12:1--12:41",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311083",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311083",
  abstract =     "We consider unreliable distributed learning systems
                 wherein the training data is kept confidential by
                 external workers, and the learner has to interact
                 closely with those workers to train a model. In
                 particular, we assume that there exists a system
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Henzinger:2019:EDW,
  author =       "Monika Henzinger and Stefan Neumann and Stefan
                 Schmid",
  title =        "Efficient Distributed Workload (Re-){Embedding}",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "13:1--13:38",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311084",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311084",
  abstract =     "Modern networked systems are increasingly
                 reconfigurable, enabling demand-aware infrastructures
                 whose resources can be adjusted according to the
                 workload they currently serve. Such dynamic adjustments
                 can be exploited to improve network utilization and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Tang:2019:RWB,
  author =       "Dengwang Tang and Vijay G. Subramanian",
  title =        "Random Walk Based Sampling for Load Balancing in
                 Multi-Server Systems",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "14:1--14:44",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311085",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311085",
  abstract =     "In multi-server systems, a classical job assignment
                 algorithm works as follows: at the arrival of each job,
                 pick d servers independently and uniformly at random
                 and send the job to the least loaded server among the d
                 servers. This model is known as the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Lee:2019:NMM,
  author =       "Chul-Ho Lee and Min Kang and Do Young Eun",
  title =        "Non-{Markovian} {Monte Carlo} on Directed Graphs",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "15:1--15:31",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311086",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311086",
  abstract =     "Markov Chain Monte Carlo (MCMC) has been the de facto
                 technique for sampling and inference of large graphs
                 such as online social networks. At the heart of MCMC
                 lies the ability to construct an ergodic Markov chain
                 that attains any given stationary \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "15",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Comden:2019:OOC,
  author =       "Joshua Comden and Sijie Yao and Niangjun Chen and
                 Haipeng Xing and Zhenhua Liu",
  title =        "Online Optimization in Cloud Resource Provisioning:
                 Predictions, Regrets, and Algorithms",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "16:1--16:30",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311087",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311087",
  abstract =     "Due to mainstream adoption of cloud computing and its
                 rapidly increasing usage of energy, the efficient
                 management of cloud computing resources has become an
                 important issue. A key challenge in managing the
                 resources lies in the volatility of their \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Zhang:2019:AMD,
  author =       "Lei Zhang and Zhemin Yang and Yuyu He and Mingqi Li
                 and Sen Yang and Min Yang and Yuan Zhang and Zhiyun
                 Qian",
  title =        "App in the Middle: Demystify Application
                 Virtualization in {Android} and its Security Threats",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "17:1--17:24",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311088",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311088",
  abstract =     "Customizability is a key feature of the Android
                 operating system that differentiates it from Apple's
                 iOS. One concrete feature that gaining popularity is
                 called ``app virtualization''. This feature allows
                 multiple copies of the same app to be installed
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Alijani:2019:STT,
  author =       "Reza Alijani and Siddhartha Banerjee and Sreenivas
                 Gollapudi and Kostas Kollias and Kamesh Munagala",
  title =        "The Segmentation-Thickness Tradeoff in Online
                 Marketplaces",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "18:1--18:26",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311089",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311089",
  abstract =     "A core tension in the operations of online
                 marketplaces is between segmentation (wherein platforms
                 can increase revenue by segmenting the market into ever
                 smaller sub-markets) and thickness (wherein the size of
                 the sub-market affects the utility \ldots{})",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Nikolopoulos:2019:RPS,
  author =       "Pavlos Nikolopoulos and Christos Pappas and Katerina
                 Argyraki and Adrian Perrig",
  title =        "Retroactive Packet Sampling for Traffic Receipts",
  journal =      j-POMACS,
  volume =       "3",
  number =       "1",
  pages =        "19:1--19:39",
  month =        mar,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3322205.3311090",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:30 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3322205.3311090",
  abstract =     "Is it possible to design a packet-sampling algorithm
                 that prevents the network node that performs the
                 sampling from treating the sampled packets
                 preferentially? We study this problem in the context of
                 designing a ``network transparency''' system. In this
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Bonald:2019:E,
  author =       "Thomas Bonald and Nick Duffield",
  title =        "Editorial",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "20:1--20:2",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326134",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326134",
  abstract =     "The Proceedings of the ACM series present the highest
                 quality research conducted in diverse areas of computer
                 science, as represented by the ACM Special Interest
                 Groups (SIGs). The ACM Proceedings of the ACM on
                 Measurement and Analysis of Computing \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Jose:2019:DAC,
  author =       "Lavanya Jose and Stephen Ibanez and Mohammad Alizadeh
                 and Nick McKeown",
  title =        "A Distributed Algorithm to Calculate Max-Min Fair
                 Rates Without Per-Flow State",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "21:1--21:42",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326135",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326135",
  abstract =     "Most congestion control algorithms, like TCP, rely on
                 a reactive control system that detects congestion, then
                 marches carefully towards a desired operating point
                 (e.g. by modifying the window size or adjusting a
                 rate). In an effort to balance stability \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Shi:2019:VLA,
  author =       "Ming Shi and Xiaojun Lin and Lei Jiao",
  title =        "On the Value of Look-Ahead in Competitive Online
                 Convex Optimization",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "22:1--22:42",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326136",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326136",
  abstract =     "Although using look-ahead information is known to
                 improve the competitive ratios of online convex
                 optimization (OCO) problems with switching costs, the
                 competitive ratios obtained from existing results often
                 depend on the cost coefficients of the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{VanHoudt:2019:GAO,
  author =       "Benny {Van Houdt}",
  title =        "Global Attraction of {ODE}-based Mean Field Models
                 with Hyperexponential Job Sizes",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "23:1--23:23",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326137",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326137",
  abstract =     "Mean field modeling is a popular approach to assess
                 the performance of large scale computer systems. The
                 evolution of many mean field models is characterized by
                 a set of ordinary differential equations that have a
                 unique fixed point. In order to prove \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Wei:2019:HBS,
  author =       "Song Wei and Kun Zhang and Bibo Tu",
  title =        "{HyperBench}: a Benchmark Suite for Virtualization
                 Capabilities",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "24:1--24:22",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326138",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326138",
  abstract =     "Virtualization is becoming increasingly common in data
                 centers due to its various advantages. However, how to
                 choose among different platforms, including both
                 software and hardware, is a considerable challenge. In
                 this context, evaluating the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Vial:2019:SRP,
  author =       "Daniel Vial and Vijay Subramanian",
  title =        "A Structural Result for Personalized {PageRank} and
                 its Algorithmic Consequences",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "25:1--25:88",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326140",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://portal.acm.org/http://www.math.utah.edu/pub/tex/bib/pomacs.bib;
                 http://www.math.utah.edu/pub/tex/bib/pagerank.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326140",
  abstract =     "Many systems, such as the Internet, social networks,
                 and the power grid, can be represented as graphs. When
                 analyzing graphs, it is often useful to compute scores
                 describing the relative importance or distance between
                 nodes. One example is Personalized PageRank (PPR),
                 which assigns to each node v a vector whose i-th entry
                 describes the importance of the i-th node from the
                 perspective of v. PPR has proven useful in many
                 applications, such as recommending who users should
                 follow on social networks (if this i-th entry is large,
                 v may be interested in following the i-th user).
                 Unfortunately, computing n PPR vectors exactly for a
                 graph of n nodes has complexity $O(n^3)$, which is
                 infeasible for many graphs of interest. In this work,
                 we devise a scheme to estimate all n PPR vectors with
                 bounded l_1 error and complexity O(nc), where c < 2
                 depends on the degrees of the graph at hand, the
                 desired error tolerance, and a parameter that defines
                 PPR. This improves upon existing methods, the best of
                 which have complexity $ O(n^2 \log n) $ in our setting.
                 Our complexity guarantee holds with high probability,
                 for certain choices of the PPR parameter, and for a
                 certain class of random graphs (roughly speaking, the
                 sparse directed configuration model with heavy-tailed
                 in-degrees); our accuracy guarantee holds with
                 probability 1 and for arbitrary graphs and PPR
                 parameters. The complexity result arises as a
                 consequence of our main (structural) result, which
                 shows that the dimensionality of the set of PPR vectors
                 scales sublinearly in n with high probability, for the
                 same class of random graphs and for a notion of
                 dimensionality similar to matrix rank. It is this
                 coupling of the PPR vectors for the nodes on a common
                 underlying graph that allows for estimating them
                 faster. Hence, at a high level, our scheme is analogous
                 to (but distinct from) low-rank matrix approximation.
                 We also note that our scheme is similar to one that was
                 proposed in [Jeh and Widom 2003] but lacked accuracy
                 and complexity guarantees, so another contribution of
                 our paper is to address this gap in the literature.",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Pourghassemi:2019:WIA,
  author =       "Behnam Pourghassemi and Ardalan Amiri Sani and Aparna
                 Chandramowlishwaran",
  title =        "What-If Analysis of Page Load Time in {Web} Browsers
                 Using Causal Profiling",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "27:1--27:23",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326142",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326142",
  abstract =     "Web browsers have become one of the most commonly used
                 applications for desktop and mobile users. Despite
                 recent advances in network speeds and several
                 techniques to speed up web page loading such as
                 speculative loading, smart caching, and multi-.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Ambati:2019:OCE,
  author =       "Pradeep Ambati and David Irwin",
  title =        "Optimizing the Cost of Executing Mixed Interactive and
                 Batch Workloads on Transient {VMs}",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "28:1--28:24",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326143",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326143",
  abstract =     "Container Orchestration Platforms (COPs), such as
                 Kubernetes, are increasingly used to manage large-scale
                 clusters by automating resource allocation between
                 applications encapsulated in containers. Increasingly,
                 the resources underlying COPs are virtual \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Kumar:2019:TBA,
  author =       "Dhruv Kumar and Jian Li and Abhishek Chandra and
                 Ramesh Sitaraman",
  title =        "A {TTL}-based Approach for Data Aggregation in
                 Geo-distributed Streaming Analytics",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "29:1--29:27",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326144",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326144",
  abstract =     "Streaming analytics require real-time aggregation and
                 processing of geographically distributed data streams
                 continuously over time. The typical analytics
                 infrastructure for processing such streams follow a
                 hub-and-spoke model, comprising multiple edges
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Sermpezis:2019:ICI,
  author =       "Pavlos Sermpezis and Vasileios Kotronis",
  title =        "Inferring Catchment in {Internet} Routing",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "30:1--30:31",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326145",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326145",
  abstract =     "BGP is the de-facto Internet routing protocol for
                 exchanging prefix reachability information between
                 Autonomous Systems (AS). It is a dynamic, distributed,
                 path-vector protocol that enables rich expressions of
                 network policies (typically treated as \ldots{})",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Ciucu:2019:QLD,
  author =       "Florin Ciucu and Felix Poloczek and Amr Rizk",
  title =        "Queue and Loss Distributions in Finite-Buffer Queues",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "31:1--31:29",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326146",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326146",
  abstract =     "We derive simple bounds on the queue distribution in
                 finite-buffer queues with Markovian arrivals. Our
                 technique relies on a subtle equivalence between tail
                 events and stopping times orderings. The bounds capture
                 a truncated exponential behavior, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Zarchy:2019:ACC,
  author =       "Doron Zarchy and Radhika Mittal and Michael Schapira
                 and Scott Shenker",
  title =        "Axiomatizing Congestion Control",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "33:1--33:33",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326148",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326148",
  abstract =     "The overwhelmingly large design space of congestion
                 control protocols, along with the increasingly diverse
                 range of application environments, makes evaluating
                 such protocols a daunting task. Simulation and
                 experiments are very helpful in evaluating the
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Radulovic:2019:PMS,
  author =       "Milan Radulovic and Rommel S{\'a}nchez Verdejo and
                 Paul Carpenter and Petar Radojkovi{\'c} and Bruce Jacob
                 and Eduard Ayguad{\'e}",
  title =        "{PROFET}: Modeling System Performance and Energy
                 Without Simulating the {CPU}",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "34:1--34:33",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326149",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326149",
  abstract =     "The approaching end of DRAM scaling and expansion of
                 emerging memory technologies is motivating a lot of
                 research in future memory systems. Novel memory systems
                 are typically explored by hardware simulators that are
                 slow and often have a simplified or \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Hellemans:2019:PAW,
  author =       "Tim Hellemans and Tejas Bodas and Benny {Van Houdt}",
  title =        "Performance Analysis of Workload Dependent Load
                 Balancing Policies",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "35:1--35:35",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326150",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326150",
  abstract =     "Load balancing plays a crucial role in achieving low
                 latency in large distributed systems. Recent load
                 balancing strategies often rely on replication or use
                 placeholders to further improve latency. However
                 assessing the performance and stability of \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Dai:2019:ACL,
  author =       "Osman Emre Dai and Daniel Cullina and Negar Kiyavash
                 and Matthias Grossglauser",
  title =        "Analysis of a Canonical Labeling Algorithm for the
                 Alignment of Correlated {Erd{\H{o}}s--R{\'e}nyi}
                 Graphs",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "36:1--36:25",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326151",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326151",
  abstract =     "Graph alignment in two correlated random graphs refers
                 to the task of identifying the correspondence between
                 vertex sets of the graphs. Recent results have
                 characterized the exact information-theoretic threshold
                 for graph alignment in correlated Erd{\H{o}}s--\ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Amjad:2019:MMD,
  author =       "Muhammad Amjad and Vishal Misra and Devavrat Shah and
                 Dennis Shen",
  title =        "{mRSC}: Multi-dimensional Robust Synthetic Control",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "37:1--37:27",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326152",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326152",
  abstract =     "When evaluating the impact of a policy (e.g., gun
                 control) on a metric of interest (e.g., crime-rate), it
                 may not be possible or feasible to conduct a randomized
                 control trial. In such settings where only
                 observational data is available, synthetic \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Karakoy:2019:AAA,
  author =       "Mustafa Karakoy and Orhan Kislal and Xulong Tang and
                 Mahmut Taylan Kandemir and Meenakshi Arunachalam",
  title =        "Architecture-Aware Approximate Computing",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "38:1--38:24",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326153",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326153",
  abstract =     "Deliberate use of approximate computing has been an
                 active research area recently. Observing that many
                 application programs from different domains can live
                 with less-than-perfect accuracy, existing techniques
                 try to trade off program output accuracy \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Quan:2019:NFM,
  author =       "Guocong Quan and Jian Tan and Atilla Eryilmaz and Ness
                 Shroff",
  title =        "A New Flexible Multi-flow {LRU} Cache Management
                 Paradigm for Minimizing Misses",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "39:1--39:30",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326154",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326154",
  abstract =     "The Least Recently Used (LRU) caching and its variants
                 are used in large-scale data systems in order to
                 provide high-speed data access for a wide class of
                 applications. Nonetheless, a fundamental question still
                 remains open: in order to minimize miss \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Hoffmann:2019:LGN,
  author =       "Jessica Hoffmann and Constantine Caramanis",
  title =        "Learning Graphs from Noisy Epidemic Cascades",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "40:1--40:34",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326155",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326155",
  abstract =     "We consider the problem of learning the weighted edges
                 of a graph by observing the noisy times of infection
                 for multiple epidemic cascades on this graph. Past work
                 has considered this problem when the cascade
                 information, i.e., infection times, are \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Wei:2019:QMO,
  author =       "Honghao Wei and Xiaohan Kang and Weina Wang and Lei
                 Ying",
  title =        "{QuickStop}: a {Markov} Optimal Stopping Approach for
                 Quickest Misinformation Detection",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "41:1--41:25",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326156",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326156",
  abstract =     "This paper combines data-driven and model-driven
                 methods for real-time misinformation detection. Our
                 algorithm, named QuickStop, is an optimal stopping
                 algorithm based on a probabilistic information
                 spreading model obtained from labeled data. The
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Grosof:2019:LBG,
  author =       "Isaac Grosof and Ziv Scully and Mor Harchol-Balter",
  title =        "Load Balancing Guardrails: Keeping Your Heavy Traffic
                 on the Road to Low Response Times",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "42:1--42:31",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326157",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326157",
  abstract =     "Load balancing systems, comprising a central
                 dispatcher and a scheduling policy at each server, are
                 widely used in practice, and their response time has
                 been extensively studied in the theoretical literature.
                 While much is known about the scenario where \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Cayci:2019:LCR,
  author =       "Semih Cayci and Atilla Eryilmaz and R. Srikant",
  title =        "Learning to Control Renewal Processes with Bandit
                 Feedback",
  journal =      j-POMACS,
  volume =       "3",
  number =       "2",
  pages =        "43:1--43:32",
  month =        jun,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3341617.3326158",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:31 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3341617.3326158",
  abstract =     "We consider a bandit problem with K task types from
                 which the controller activates one task at a time. Each
                 task takes a random and possibly heavy-tailed
                 completion time, and a reward is obtained only after
                 the task is completed. The task types are \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Mishra:2019:GIT,
  author =       "Ayush Mishra and Xiangpeng Sun and Atishya Jain and
                 Sameer Pande and Raj Joshi and Ben Leong",
  title =        "The {Great Internet TCP Congestion Control Census}",
  journal =      j-POMACS,
  volume =       "3",
  number =       "3",
  pages =        "45:1--45:24",
  month =        dec,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3366693",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:32 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3366693",
  abstract =     "In 2016, Google proposed and deployed a new TCP
                 variant called BBR. BBR represents a major departure
                 from traditional congestion-window-based congestion
                 control. Instead of using loss as a congestion signal,
                 BBR uses estimates of the bandwidth and round-.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "45",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Fleder:2019:FAD,
  author =       "Michael Fleder and Devavrat Shah",
  title =        "Forecasting with Alternative Data",
  journal =      j-POMACS,
  volume =       "3",
  number =       "3",
  pages =        "46:1--46:29",
  month =        dec,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3366694",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:32 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3366694",
  abstract =     "We consider the problem of forecasting fine-grained
                 company financials, such as daily revenue, from two
                 input types: noisy proxy signals a la alternative data
                 (e.g. credit card transactions) and sparse ground-truth
                 observations (e.g. quarterly earnings \ldots{})",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Yang:2019:AER,
  author =       "Zhenjie Yang and Yong Cui and Shihan Xiao and Xin Wang
                 and Minming Li and Chuming Li and Yadong Liu",
  title =        "Achieving Efficient Routing in Reconfigurable {DCNs}",
  journal =      j-POMACS,
  volume =       "3",
  number =       "3",
  pages =        "47:1--47:30",
  month =        dec,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3366695",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:32 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3366695",
  abstract =     "Heavy and highly dynamic traffic demands in today's
                 data center networks (DCNs) pose great challenges to
                 efficient traffic engineering. With gigabit bandwidth,
                 wireless communication technologies, such as free space
                 optics and 60GHz wireless, are \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "47",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{London:2019:LCD,
  author =       "Palma London and Shai Vardi and Adam Wierman",
  title =        "Logarithmic Communication for Distributed Optimization
                 in Multi-Agent Systems",
  journal =      j-POMACS,
  volume =       "3",
  number =       "3",
  pages =        "48:1--48:29",
  month =        dec,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3366696",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:32 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3366696",
  abstract =     "Classically, the design of multi-agent systems is
                 approached using techniques from distributed
                 optimization such as dual descent and consensus
                 algorithms. Such algorithms depend on convergence to
                 global consensus before any individual agent can
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "48",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Chang:2019:LBN,
  author =       "Yiyang Chang and Chuan Jiang and Ashish Chandra and
                 Sanjay Rao and Mohit Tawarmalani",
  title =        "{Lancet}: Better Network Resilience by Designing for
                 Pruned Failure Sets",
  journal =      j-POMACS,
  volume =       "3",
  number =       "3",
  pages =        "49:1--49:26",
  month =        dec,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3366697",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:32 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3366697",
  abstract =     "Recently, researchers have started exploring the
                 design of route protection schemes that ensure networks
                 can sustain traffic demand without congestion under
                 failures. Existing approaches focus on ensuring
                 worst-case performance over simultaneous f-. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Fu:2019:FLV,
  author =       "Xinzhe Fu and Eytan Modiano",
  title =        "Fundamental Limits of Volume-based Network {DoS}
                 Attacks",
  journal =      j-POMACS,
  volume =       "3",
  number =       "3",
  pages =        "50:1--50:36",
  month =        dec,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3366698",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:32 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3366698",
  abstract =     "Volume-based network denial-of-service (DoS) attacks
                 refer to a class of cyber attacks where an adversary
                 seeks to block user traffic from service by sending
                 adversarial traffic that reduces the available user
                 capacity. In this paper, we explore the \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Zhou:2019:GSF,
  author =       "You Zhou and Youlin Zhang and Chaoyi Ma and Shigang
                 Chen and Olufemi O. Odegbile",
  title =        "Generalized Sketch Families for Network Traffic
                 Measurement",
  journal =      j-POMACS,
  volume =       "3",
  number =       "3",
  pages =        "51:1--51:34",
  month =        dec,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3366699",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:32 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3366699",
  abstract =     "Traffic measurement provides critical information for
                 network management, resource allocation, traffic
                 engineering, and attack detection. Most prior art has
                 been geared towards specific application needs with
                 specific performance objectives. To support \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Wang:2019:FLA,
  author =       "Sinong Wang and Jiashang Liu and Ness Shroff",
  title =        "Fundamental Limits of Approximate Gradient Coding",
  journal =      j-POMACS,
  volume =       "3",
  number =       "3",
  pages =        "52:1--52:22",
  month =        dec,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3366700",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:32 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3366700",
  abstract =     "In the distributed gradient coding problem, it has
                 been established that, to exactly recover the gradient
                 under s slow machines, the mmimum computation load
                 (number of stored data partitions) of each worker is at
                 least linear ($ s + 1$), which incurs a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Sankararaman:2019:SLM,
  author =       "Abishek Sankararaman and Ayalvadi Ganesh and Sanjay
                 Shakkottai",
  title =        "Social Learning in Multi Agent Multi Armed Bandits",
  journal =      j-POMACS,
  volume =       "3",
  number =       "3",
  pages =        "53:1--53:35",
  month =        dec,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3366701",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:32 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3366701",
  abstract =     "Motivated by emerging need of learning algorithms for
                 large scale networked and decentralized systems, we
                 introduce a distributed version of the classical
                 stochastic Multi-Arm Bandit (MAB) problem. Our setting
                 consists of a large number of agents n that \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "53",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Cullina:2019:PRE,
  author =       "Daniel Cullina and Negar Kiyavash and Prateek Mittal
                 and H. Vincent Poor",
  title =        "Partial Recovery of {Erd{\H{o}}s--R{\'e}nyi} Graph
                 Alignment via $k$-Core Alignment",
  journal =      j-POMACS,
  volume =       "3",
  number =       "3",
  pages =        "54:1--54:21",
  month =        dec,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3366702",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:32 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3366702",
  abstract =     "We determine information theoretic conditions under
                 which it is possible to partially recover the alignment
                 used to generate a pair of sparse, correlated
                 Erd{\H{o}}s--Renyi graphs. To prove our achievability
                 result, we introduce the k-core alignment estimator.
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "54",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Sinclair:2019:ADE,
  author =       "Sean R. Sinclair and Siddhartha Banerjee and Christina
                 Lee Yu",
  title =        "Adaptive Discretization for Episodic Reinforcement
                 Learning in Metric Spaces",
  journal =      j-POMACS,
  volume =       "3",
  number =       "3",
  pages =        "55:1--55:44",
  month =        dec,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3366703",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:32 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3366703",
  abstract =     "We present an efficient algorithm for model-free
                 episodic reinforcement learning on large (potentially
                 continuous) state-action spaces. Our algorithm is based
                 on a novel Q-learning policy with adaptive data-driven
                 discretization. The central idea is to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "55",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Bronzino:2019:ISV,
  author =       "Francesco Bronzino and Paul Schmitt and Sara Ayoubi
                 and Guilherme Martins and Renata Teixeira and Nick
                 Feamster",
  title =        "Inferring Streaming Video Quality from Encrypted
                 Traffic: Practical Models and Deployment Experience",
  journal =      j-POMACS,
  volume =       "3",
  number =       "3",
  pages =        "56:1--56:25",
  month =        dec,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3366704",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:32 MDT 2021",
  bibsource =    "http://portal.acm.org/http://www.math.utah.edu/pub/tex/bib/pomacs.bib;
                 http://www.math.utah.edu/pub/tex/bib/cryptography2010.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3366704",
  abstract =     "Inferring the quality of streaming video applications
                 is important for Internet service providers, but the
                 fact that most video streams are encrypted makes it
                 difficult to do so. We develop models that infer
                 quality metrics(i.e., startup delay and resolution) for
                 encrypted streaming video services. Our paper builds on
                 previous work, but extends it in several ways. First,
                 the models work in deployment settings where the video
                 sessions and segments must be identified from a mix of
                 traffic and the time precision of the collected traffic
                 statistics is more coarse (e.g., due to aggregation).
                 Second, we develop a single composite model that works
                 for a range of different services (i.e., Netflix,
                 YouTube, Amazon, and Twitch), as opposed to just a
                 single service. Third, unlike many previous models, our
                 models perform predictions at finer granularity (e.g.,
                 the precise startup delay instead of just detecting
                 short versus long delays) allowing to draw better
                 conclusions on the ongoing streaming quality. Fourth,
                 we demonstrate the models are practical through a
                 16-month deployment in 66 homes and provide new
                 insights about the relationships between Internet
                 ``speed'' and the quality of the corresponding video
                 streams, for a variety of services; we find that higher
                 speeds provide only minimal improvements to startup
                 delay and resolution.",
  acknowledgement = ack-nhfb,
  articleno =    "56",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Horvath:2019:MFA,
  author =       "Ill{\'e}s Antal Horv{\'a}th and Ziv Scully and Benny
                 {Van Houdt}",
  title =        "Mean Field Analysis of Join-Below-Threshold Load
                 Balancing for Resource Sharing Servers",
  journal =      j-POMACS,
  volume =       "3",
  number =       "3",
  pages =        "57:1--57:21",
  month =        dec,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3366705",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:32 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3366705",
  abstract =     "Load balancing plays a crucial role in many large
                 scale computer systems. Much prior work has focused on
                 systems with First-Come-First-Served (FCFS) servers.
                 However, servers in practical systems are more
                 complicated. They serve multiple jobs at once,
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "57",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Mallick:2019:RCN,
  author =       "Ankur Mallick and Malhar Chaudhari and Utsav Sheth and
                 Ganesh Palanikumar and Gauri Joshi",
  title =        "Rateless Codes for Near-Perfect Load Balancing in
                 Distributed Matrix--Vector Multiplication",
  journal =      j-POMACS,
  volume =       "3",
  number =       "3",
  pages =        "58:1--58:40",
  month =        dec,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3366706",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:32 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3366706",
  abstract =     "Large-scale machine learning and data mining
                 applications require computer systems to perform
                 massive matrix-vector and matrix-matrix multiplication
                 operations that need to be parallelized across multiple
                 nodes. The presence of straggling nodes --- \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "58",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Ros-Giralt:2019:BSC,
  author =       "Jordi Ros-Giralt and Atul Bohara and Sruthi Yellamraju
                 and M. Harper Langston and Richard Lethin and Yuang
                 Jiang and Leandros Tassiulas and Josie Li and Yuanlong
                 Tan and Malathi Veeraraghavan",
  title =        "On the Bottleneck Structure of Congestion-Controlled
                 Networks",
  journal =      j-POMACS,
  volume =       "3",
  number =       "3",
  pages =        "59:1--59:31",
  month =        dec,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3366707",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:32 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3366707",
  abstract =     "In this paper, we introduce the Theory of Bottleneck
                 Ordering, a mathematical framework that reveals the
                 bottleneck structure of data networks. This theoretical
                 framework provides insights into the inherent
                 topological properties of a network in at least
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "59",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Ghose:2019:DCW,
  author =       "Saugata Ghose and Tianshi Li and Nastaran Hajinazar
                 and Damla Senol Cali and Onur Mutlu",
  title =        "Demystifying Complex Workload-{DRAM} Interactions: an
                 Experimental Study",
  journal =      j-POMACS,
  volume =       "3",
  number =       "3",
  pages =        "60:1--60:50",
  month =        dec,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3366708",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:32 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3366708",
  abstract =     "It has become increasingly difficult to understand the
                 complex interactions between modern applications and
                 main memory, composed of Dynamic Random Access Memory
                 (DRAM) chips. Manufacturers are now selling and
                 proposing many different types of DRAM, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "60",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Ivkin:2019:KWY,
  author =       "Nikita Ivkin and Ran {Ben Basat} and Zaoxing Liu and
                 Gil Einziger and Roy Friedman and Vladimir Braverman",
  title =        "{I} Know What You Did Last Summer: Network Monitoring
                 using Interval Queries",
  journal =      j-POMACS,
  volume =       "3",
  number =       "3",
  pages =        "61:1--61:28",
  month =        dec,
  year =         "2019",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3366709",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:32 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3366709",
  abstract =     "Modern network telemetry systems collect and analyze
                 massive amounts of raw data in a space efficient
                 manner. These require advanced capabilities such as
                 drill down queries that allow iterative refinement of
                 the search space. We present a first integral
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "61",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Doshi:2020:FVA,
  author =       "Vishwaraj Doshi and Do Young Eun",
  title =        "{Fiedler} Vector Approximation via Interacting Random
                 Walks",
  journal =      j-POMACS,
  volume =       "4",
  number =       "1",
  pages =        "01:1--01:28",
  month =        may,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3379502",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:33 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3379502",
  abstract =     "The Fiedler vector of a graph, namely the eigenvector
                 corresponding to the second smallest eigenvalue of a
                 graph Laplacian matrix, plays an important role in
                 spectral graph theory with applications in problems
                 such as graph bi-partitioning and envelope \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "01",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Zubeldia:2020:DOP,
  author =       "Martin Zubeldia",
  title =        "Delay-optimal Policies in Partial Fork-Join Systems
                 with Redundancy and Random Slowdowns",
  journal =      j-POMACS,
  volume =       "4",
  number =       "1",
  pages =        "02:1--02:49",
  month =        may,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3379468",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:33 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3379468",
  abstract =     "We consider a large distributed service system
                 consisting of n homogeneous servers with infinite
                 capacity FIFO queues. Jobs arrive as a Poisson process
                 of rate \lambda n/k_n (for some positive constant
                 \lambda and integer k_n). Each incoming job consists of
                 k_n \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "02",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Kuo:2020:SCH,
  author =       "Hsuan-Chi Kuo and Jianyan Chen and Sibin Mohan and
                 Tianyin Xu",
  title =        "Set the Configuration for the Heart of the {OS}: On
                 the Practicality of Operating System Kernel
                 Debloating",
  journal =      j-POMACS,
  volume =       "4",
  number =       "1",
  pages =        "03:1--03:27",
  month =        may,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3379469",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:33 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3379469",
  abstract =     "This paper presents a study on the practicality of
                 operating system (OS) kernel debloating---reducing
                 kernel code that is not needed by the target
                 applications---in real-world systems. Despite their
                 significant benefits regarding security (attack
                 \ldots{})",
  acknowledgement = ack-nhfb,
  articleno =    "03",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Alijani:2020:PMP,
  author =       "Reza Alijani and Siddhartha Banerjee and Sreenivas
                 Gollapudi and Kamesh Munagala and Kangning Wang",
  title =        "Predict and Match: Prophet Inequalities with Uncertain
                 Supply",
  journal =      j-POMACS,
  volume =       "4",
  number =       "1",
  pages =        "04:1--04:23",
  month =        may,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3379470",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:33 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3379470",
  abstract =     "We consider the problem of selling perishable items to
                 a stream of buyers in order to maximize social welfare.
                 A seller starts with a set of identical items, and each
                 arriving buyer wants any one item, and has a valuation
                 drawn i.i.d. from a known \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "04",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Song:2020:UCS,
  author =       "JinKe Song and Qiang Li and Haining Wang and Limin
                 Sun",
  title =        "Under the Concealing Surface: Detecting and
                 Understanding Live Webcams in the Wild",
  journal =      j-POMACS,
  volume =       "4",
  number =       "1",
  pages =        "05:1--05:25",
  month =        may,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3379471",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:33 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3379471",
  abstract =     "Given the central role of webcams in monitoring
                 physical surroundings, it behooves the research
                 community to understand the characteristics of webcams'
                 distribution and their privacy/security implications.
                 In this paper, we conduct the first systematic
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "05",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Zhang:2020:ODP,
  author =       "Lei Zhang and Reza Karimi and Irfan Ahmad and Ymir
                 Vigfusson",
  title =        "Optimal Data Placement for Heterogeneous Cache,
                 Memory, and Storage Systems",
  journal =      j-POMACS,
  volume =       "4",
  number =       "1",
  pages =        "06:1--06:27",
  month =        may,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3379472",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:33 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3379472",
  abstract =     "New memory technologies are blurring the previously
                 distinctive performance characteristics of adjacent
                 layers in the memory hierarchy. No longer are such
                 layers orders of magnitude different in request latency
                 or capacity. Beyond the traditional single-. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "06",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Shao:2020:YNM,
  author =       "Zhihui Shao and Mohammad A. Islam and Shaolei Ren",
  title =        "Your Noise, My Signal: Exploiting Switching Noise for
                 Stealthy Data Exfiltration from Desktop Computers",
  journal =      j-POMACS,
  volume =       "4",
  number =       "1",
  pages =        "07:1--07:39",
  month =        may,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3379473",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:33 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3379473",
  abstract =     "Attacks based on power analysis have been long
                 existing and studied, with some recent works focused on
                 data exfiltration from victim systems without using
                 conventional communications (e.g., WiFi). Nonetheless,
                 prior works typically rely on intrusive \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "07",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Scully:2020:SNO,
  author =       "Ziv Scully and Mor Harchol-Balter and Alan
                 Scheller-Wolf",
  title =        "Simple Near-Optimal Scheduling for the {M/G/1}",
  journal =      j-POMACS,
  volume =       "4",
  number =       "1",
  pages =        "11:1--11:29",
  month =        may,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3379477",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:33 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3379477",
  abstract =     "We consider the problem of preemptively scheduling
                 jobs to minimize mean response time of an M/G/1 queue.
                 When we know each job's size, the shortest remaining
                 processing time (SRPT) policy is optimal.
                 Unfortunately, in many settings we do not have
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "11",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Cai:2020:TPD,
  author =       "Yang Cai and Federico Echenique and Hu Fu and Katrina
                 Ligett and Adam Wierman and Juba Ziani",
  title =        "Third-Party Data Providers Ruin Simple Mechanisms",
  journal =      j-POMACS,
  volume =       "4",
  number =       "1",
  pages =        "12:1--12:31",
  month =        may,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3379478",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:33 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3379478",
  abstract =     "Motivated by the growing prominence of third-party
                 data providers in online marketplaces, this paper
                 studies the impact of the presence of third-party data
                 providers on mechanism design. When no data provider is
                 present, it has been shown that simple \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "12",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Zhu:2020:CTI,
  author =       "Pengxiong Zhu and Keyu Man and Zhongjie Wang and
                 Zhiyun Qian and Roya Ensafi and J. Alex Halderman and
                 Haixin Duan",
  title =        "Characterizing Transnational {Internet} Performance
                 and the {Great Bottleneck of China}",
  journal =      j-POMACS,
  volume =       "4",
  number =       "1",
  pages =        "13:1--13:23",
  month =        may,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3379479",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:33 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3379479",
  abstract =     "Transnational Internet performance is an important
                 indication of a country's level of infrastructure
                 investment, globalization, and openness. We conduct a
                 large-scale measurement study of transnational Internet
                 performance in and out of 29 countries and \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "13",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Combes:2020:UBC,
  author =       "Richard Combes and Alexandre Prouti{\`e}re and
                 Alexandre Fauquette",
  title =        "Unimodal Bandits with Continuous Arms: Order-optimal
                 Regret without Smoothness",
  journal =      j-POMACS,
  volume =       "4",
  number =       "1",
  pages =        "14:1--14:28",
  month =        may,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3379480",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:33 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3379480",
  abstract =     "We consider stochastic bandit problems with a
                 continuous set of arms and where the expected reward is
                 a continuous and unimodal function of the arm. For
                 these problems, we propose the Stochastic Polychotomy
                 (SP) algorithms, and derive finite-time upper
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "14",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Yang:2020:OLO,
  author =       "Lin Yang and Mohammad H. Hajiesmaili and Ramesh
                 Sitaraman and Adam Wierman and Enrique Mallada and Wing
                 S. Wong",
  title =        "Online Linear Optimization with Inventory Management
                 Constraints",
  journal =      j-POMACS,
  volume =       "4",
  number =       "1",
  pages =        "16:1--16:29",
  month =        may,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3379482",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:33 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3379482",
  abstract =     "This paper considers the problem of online linear
                 optimization with inventory management constraints.
                 Specifically, we consider an online scenario where a
                 decision maker needs to satisfy her time-varying demand
                 for some units of an asset, either from a \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "16",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Karsten:2020:ULT,
  author =       "Martin Karsten and Saman Barghi",
  title =        "User-level Threading: Have Your Cake and Eat It Too",
  journal =      j-POMACS,
  volume =       "4",
  number =       "1",
  pages =        "17:1--17:30",
  month =        may,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3379483",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:33 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3379483",
  abstract =     "An important class of computer software, such as
                 network servers, exhibits concurrency through many
                 loosely coupled and potentially long-running
                 communication sessions. For these applications, a
                 long-standing open question is whether
                 thread-per-session \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "17",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Lin:2020:OOP,
  author =       "Yiheng Lin and Gautam Goel and Adam Wierman",
  title =        "Online Optimization with Predictions and Non-convex
                 Losses",
  journal =      j-POMACS,
  volume =       "4",
  number =       "1",
  pages =        "18:1--18:32",
  month =        may,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3379484",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:33 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3379484",
  abstract =     "We study online optimization in a setting where an
                 online learner seeks to optimize a per-round hitting
                 cost, which may be non-convex, while incurring a
                 movement cost when changing actions between rounds. We
                 ask:under what general conditions is it \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "18",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Im:2020:DWF,
  author =       "Sungjin Im and Benjamin Moseley and Kamesh Munagala
                 and Kirk Pruhs",
  title =        "Dynamic Weighted Fairness with Minimal Disruptions",
  journal =      j-POMACS,
  volume =       "4",
  number =       "1",
  pages =        "19:1--19:18",
  month =        may,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3379485",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:33 MDT 2021",
  bibsource =    "http://portal.acm.org/http://www.math.utah.edu/pub/tex/bib/pomacs.bib;
                 http://www.math.utah.edu/pub/tex/bib/multithreading.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3379485",
  abstract =     "In this paper, we consider the following dynamic fair
                 allocation problem: Given a sequence of job arrivals
                 and departures, the goal is to maintain an
                 approximately fair allocation of the resource against a
                 target fair allocation policy, while minimizing he
                 total number of disruptions, which is the number of
                 times the allocation of any job is changed. We consider
                 a rich class of fair allocation policies that
                 significantly generalize those considered in previous
                 work. We first consider the models where jobs only
                 arrive, or jobs only depart. We present tight upper and
                 lower bounds for the number of disruptions required to
                 maintain a constant approximate fair allocation every
                 time step. In particular, for the canonical case where
                 jobs have weights and the resource allocation is
                 proportional to the job's weight, we show that
                 maintaining a constant approximate fair allocation
                 requires $ \Theta (\log^* n) $ disruptions per job,
                 almost matching the bounds in prior work for the unit
                 weight case. For the more general setting where the
                 allocation policy only decreases the allocation to a
                 job when new jobs arrive, we show that maintaining a
                 constant approximate fair allocation requires $ \Thta
                 (\log n) $ disruptions per job. We then consider the
                 model where jobs can both arrive and depart. We first
                 show strong lower bounds on the number of disruptions
                 required to maintain constant approximate fairness for
                 arbitrary instances. In contrast we then show that
                 there there is an algorithm that can maintain constant
                 approximate fairness with $ O(1) $ expected disruptions
                 per job if the weights of the jobs are independent of
                 the jobs arrival and departure order. We finally show
                 how our results can be extended to the setting with
                 multiple resources.",
  acknowledgement = ack-nhfb,
  articleno =    "19",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Avin:2020:CTT,
  author =       "Chen Avin and Manya Ghobadi and Chen Griner and Stefan
                 Schmid",
  title =        "On the Complexity of Traffic Traces and Implications",
  journal =      j-POMACS,
  volume =       "4",
  number =       "1",
  pages =        "20:1--20:29",
  month =        may,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3379486",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:33 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3379486",
  abstract =     "This paper presents a systematic approach to identify
                 and quantify the types of structures featured by packet
                 traces in communication networks. Our approach
                 leverages an information-theoretic methodology, based
                 on iterative randomization and compression \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "20",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Tay:2020:E,
  author =       "Y. C. Tay and Athina Markopoulou",
  title =        "Editorial",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "21:1--21:1",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392139",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392139",
  acknowledgement = ack-nhfb,
  articleno =    "21",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Shi:2020:LHC,
  author =       "Shouqian Shi and Chen Qian",
  title =        "{Ludo Hashing}: Compact, Fast, and Dynamic Key-value
                 Lookups for Practical Network Systems",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "22:1--22:32",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392140",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://portal.acm.org/http://www.math.utah.edu/pub/tex/bib/pomacs.bib;
                 http://www.math.utah.edu/pub/tex/bib/hash.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392140",
  abstract =     "Key-value lookup engines running in fast memory are
                 crucial components of many networked and distributed
                 systems such as packet forwarding, virtual network
                 functions, content distribution networks, distributed
                 storage, and cloud/edge computing. These lookup engines
                 must be memory-efficient because fast memory is small
                 and expensive. This work presents a new key-value
                 lookup design, called Ludo Hashing, which costs the
                 least space (3.76 + 1.05l bits per key-value item for
                 l-bit values) among known compact lookup solutions
                 including the recently proposed partial-key Cuckoo and
                 Bloomier perfect hashing. In addition to its space
                 efficiency, Ludo Hashing works well with most practical
                 systems by supporting fast lookups, fast updates, and
                 concurrent writing/reading. We implement Ludo Hashing
                 and evaluate it with both micro-benchmark and two
                 network systems deployed in CloudLab. The results show
                 that in practice Ludo Hashing saves 40\% to 80\%+
                 memory cost compared to existing dynamic solutions. It
                 costs only a few GB memory for 1 billion key-value
                 items and achieves high lookup throughput: over 65
                 million queries per second on a single node with
                 multiple threads.",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Nain:2020:AME,
  author =       "Philippe Nain and Gayane Vardoyan and Saikat Guha and
                 Don Towsley",
  title =        "On the Analysis of a Multipartite Entanglement
                 Distribution Switch",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "23:1--23:39",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392141",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392141",
  abstract =     "We study a quantum switch that distributes maximally
                 entangled multipartite states to sets of users. The
                 entanglement switching process requires two steps:
                 first, each user attempts to generate bipartite
                 entanglement between itself and the switch; and
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "23",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Tan:2020:MDO,
  author =       "Xiaoqi Tan and Bo Sun and Alberto Leon-Garcia and Yuan
                 Wu and Danny H. K. Tsang",
  title =        "Mechanism Design for Online Resource Allocation: a
                 Unified Approach",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "24:1--24:46",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392142",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392142",
  abstract =     "This paper concerns the mechanism design for online
                 resource allocation in a strategic setting. In this
                 setting, a single supplier allocates capacity-limited
                 resources to requests that arrive in a sequential and
                 arbitrary manner. Each request is \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "24",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Bhattacharjee:2020:FLR,
  author =       "Rajarshi Bhattacharjee and Subhankar Banerjee and
                 Abhishek Sinha",
  title =        "Fundamental Limits on the Regret of Online
                 Network-Caching",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "25:1--25:31",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392143",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392143",
  abstract =     "Optimal caching of files in a content distribution
                 network (CDN) is a problem of fundamental and growing
                 commercial interest. Although many different caching
                 algorithms are in use today, the fundamental
                 performance limits of network caching algorithms
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Snyder:2020:WFF,
  author =       "Peter Snyder and Antoine Vastel and Ben Livshits",
  title =        "Who Filters the Filters: Understanding the Growth,
                 Usefulness and Efficiency of Crowdsourced Ad Blocking",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "26:1--26:24",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392144",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392144",
  abstract =     "Ad and tracking blocking extensions are popular tools
                 for improving web performance, privacy and aesthetics.
                 Content blocking extensions generally rely on filter
                 lists to decide whether a web request is associated
                 with tracking or advertising, and so \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "26",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Thomas:2020:TSI,
  author =       "Ludovic Thomas and Jean-Yves {Le Boudec}",
  title =        "On Time Synchronization Issues in Time-Sensitive
                 Networks with Regulators and Nonideal Clocks",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "27:1--27:41",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392145",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392145",
  abstract =     "Flow reshaping is used in time-sensitive networks (as
                 in the context of IEEE TSN and IETF Detnet) in order to
                 reduce burstiness inside the network and to support the
                 computation of guaranteed latency bounds. This is
                 performed using per-flow regulators \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "27",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Liu:2020:CNA,
  author =       "Chun-Yi Liu and Jagadish Kotra and Myoungsoo Jung and
                 Mahmut Taylan Kandemir",
  title =        "{Centaur}: a Novel Architecture for Reliable,
                 Low-Wear, High-Density {$3$D NAND} Storage",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "28:1--28:25",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392146",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392146",
  abstract =     "Due to the high density storage demand coming from
                 applications from different domains, 3D NAND flash is
                 becoming a promising candidate to replace 2D NAND flash
                 as the dominant non-volatile memory. However, denser 3D
                 NAND presents various performance \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "28",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Tang:2020:PUT,
  author =       "Weizhao Tang and Weina Wang and Giulia Fanti and
                 Sewoong Oh",
  title =        "Privacy-Utility Tradeoffs in Routing Cryptocurrency
                 over Payment Channel Networks",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "29:1--29:39",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392147",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://portal.acm.org/http://www.math.utah.edu/pub/tex/bib/pomacs.bib;
                 http://www.math.utah.edu/pub/tex/bib/bitcoin.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392147",
  abstract =     "Payment channel networks (PCNs) are viewed as one of
                 the most promising scalability solutions for
                 cryptocurrencies today. Roughly, PCNs are networks
                 where each node represents a user and each directed,
                 weighted edge represents funds escrowed on a
                 blockchain; these funds can be transacted only between
                 the endpoints of the edge. Users efficiently transmit
                 funds from node A to B by relaying them over a path
                 connecting A to B, as long as each edge in the path
                 contains enough balance (escrowed funds) to support the
                 transaction. Whenever a transaction succeeds, the edge
                 weights are updated accordingly. In deployed PCNs,
                 channel balances (i.e., edge weights) are not revealed
                 to users for privacy reasons; users know only the
                 initial weights at time 0. Hence, when routing
                 transactions, users typically first guess a path, then
                 check if it supports the transaction. This
                 guess-and-check process dramatically reduces the
                 success rate of transactions. At the other extreme,
                 knowing full channel balances can give substantial
                 improvements in transaction success rate at the expense
                 of privacy. In this work, we ask whether a network can
                 reveal noisy channel balances to trade off privacy for
                 utility. We show fundamental limits on such a tradeoff,
                 and propose noise mechanisms that achieve the
                 fundamental limit for a general class of graph
                 topologies. Our results suggest that in practice, PCNs
                 should operate either in the low-privacy or low-utility
                 regime; it is not possible to get large gains in
                 utility by giving up a little privacy, or large gains
                 in privacy by sacrificing a little utility.",
  acknowledgement = ack-nhfb,
  articleno =    "29",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Scully:2020:CPO,
  author =       "Ziv Scully and Lucas van Kreveld and Onno Boxma and
                 Jan-Pieter Dorsman and Adam Wierman",
  title =        "Characterizing Policies with Optimal Response Time
                 Tails under Heavy-Tailed Job Sizes",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "30:1--30:33",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392148",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392148",
  abstract =     "We consider the tail behavior of the response time
                 distribution in an M/G/1 queue with heavy-tailed job
                 sizes, specifically those with intermediately regularly
                 varying tails. In this setting, the response time tail
                 of many individual policies has been \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "30",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Lin:2020:FDA,
  author =       "Fred Lin and Keyur Muzumdar and Nikolay Pavlovich
                 Laptev and Mihai-Valentin Curelea and Seunghak Lee and
                 Sriram Sankar",
  title =        "Fast Dimensional Analysis for Root Cause Investigation
                 in a Large-Scale Service Environment",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "31:1--31:23",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392149",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392149",
  abstract =     "Root cause analysis in a large-scale production
                 environment is challenging due to the complexity of the
                 services running across global data centers. Due to the
                 distributed nature of a large-scale system, the various
                 hardware, software, and tooling logs \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "31",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Pi:2020:LIA,
  author =       "Yibo Pi and Sugih Jamin and Peter Danzig and Feng
                 Qian",
  title =        "Latency Imbalance Among {Internet} Load-Balanced
                 Paths: a Cloud-Centric View",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "32:1--32:29",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392150",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392150",
  abstract =     "Load balancers choose among load-balanced paths to
                 distribute traffic as if it makes no difference using
                 one path or another. This work shows that the latency
                 difference between load-balanced paths (called latency
                 imbalance ), previously deemed \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "32",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Ghahani:2020:DCH,
  author =       "Seyed Armin Vakil Ghahani and Mahmut Taylan Kandemir
                 and Jagadish B. Kotra",
  title =        "{DSM}: a Case for Hardware-Assisted Merging of {DRAM}
                 Rows with Same Content",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "33:1--33:26",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392151",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392151",
  abstract =     "The number of cores and the capacities of main memory
                 in modern systems have been growing significantly.
                 Specifically, memory scaling, although at a slower pace
                 than computation scaling, provided opportunities for
                 very large DRAMs with Terabytes (TBs) \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "33",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Tillberg:2020:OBS,
  author =       "Erik Tillberg and Peter Marbach and Ravi Mazumdar",
  title =        "Optimal Bidding Strategies for Online Ad Auctions with
                 Overlapping Targeting Criteria",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "34:1--34:55",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392152",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392152",
  abstract =     "We analyze the problem of how to optimally bid for ad
                 spaces in online ad auctions. For this we consider the
                 general case of multiple ad campaigns with overlapping
                 targeting criteria. In our analysis we first
                 characterize the structure of an optimal \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "34",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Gopalan:2020:SSB,
  author =       "Aditya Gopalan and Abishek Sankararaman and Anwar
                 Walid and Sriram Vishwanath",
  title =        "Stability and Scalability of Blockchain Systems",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "35:1--35:35",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392153",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://portal.acm.org/http://www.math.utah.edu/pub/tex/bib/pomacs.bib;
                 http://www.math.utah.edu/pub/tex/bib/bitcoin.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392153",
  abstract =     "The blockchain paradigm provides a mechanism for
                 content dissemination and distributed consensus on
                 Peer-to-Peer (P2P) networks. While this paradigm has
                 been widely adopted in industry, it has not been
                 carefully analyzed in terms of its network scaling with
                 respect to the number of peers. Applications for
                 blockchain systems, such as cryptocurrencies and IoT,
                 require this form of network scaling. In this paper, we
                 propose a new stochastic network model for a blockchain
                 system. We identify a structural property called
                 one-endedness, which we show to be desirable in any
                 blockchain system as it is directly related to
                 distributed consensus among the peers. We show that the
                 stochastic stability of the network is sufficient for
                 the one-endedness of a blockchain. We further establish
                 that our model belongs to a class of network models,
                 called monotone separable models. This allows us to
                 establish upper and lower bounds on the stability
                 region. The bounds on stability depend on the
                 connectivity of the P2P network through its conductance
                 and allow us to analyze the scalability of blockchain
                 systems on large P2P networks. We verify our
                 theoretical insights using both synthetic data and real
                 data from the Bitcoin network.",
  acknowledgement = ack-nhfb,
  articleno =    "35",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Pyrgelis:2020:MMP,
  author =       "Apostolos Pyrgelis and Carmela Troncoso and Emiliano
                 {De Cristofaro}",
  title =        "Measuring Membership Privacy on Aggregate Location
                 Time-Series",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "36:1--36:28",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392154",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392154",
  abstract =     "While location data is extremely valuable for various
                 applications, disclosing it prompts serious threats to
                 individuals' privacy. To limit such concerns,
                 organizations often provide analysts with aggregate
                 time-series that indicate, e.g., how many \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "36",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Huang:2020:UMB,
  author =       "Yuheng Huang and Haoyu Wang and Lei Wu and Gareth
                 Tyson and Xiapu Luo and Run Zhang and Xuanzhe Liu and
                 Gang Huang and Xuxian Jiang",
  title =        "Understanding (Mis){Behavior} on the {EOSIO}
                 Blockchain",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "37:1--37:28",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392155",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://portal.acm.org/http://www.math.utah.edu/pub/tex/bib/pomacs.bib;
                 http://www.math.utah.edu/pub/tex/bib/bitcoin.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392155",
  abstract =     "EOSIO has become one of the most popular blockchain
                 platforms since its mainnet launch in June 2018. In
                 contrast to the traditional PoW-based systems (e.g.,
                 Bitcoin and Ethereum), which are limited by low
                 throughput, EOSIO is the first high throughput
                 Delegated Proof of Stake system that has been widely
                 adopted by many decentralized applications. Although
                 EOSIO has millions of accounts and billions of
                 transactions, little is known about its ecosystem,
                 especially related to security and fraud. In this
                 paper, we perform a large-scale measurement study of
                 the EOSIO blockchain and its associated DApps. We
                 gather a large-scale dataset of EOSIO and characterize
                 activities including money transfers, account creation
                 and contract invocation. Using our insights, we then
                 develop techniques to automatically detect bots and
                 fraudulent activity. We discover thousands of bot
                 accounts (over 30\% of the accounts in the platform)
                 and a number of real-world attacks (301 attack
                 accounts). By the time of our study, 80 attack accounts
                 we identified have been confirmed by DApp teams,
                 causing 828,824 EOS tokens losses (roughly \$2.6
                 million) in total.",
  acknowledgement = ack-nhfb,
  articleno =    "37",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Aral:2020:SCE,
  author =       "Atakan Aral and Melike Erol-Kantarci and Ivona
                 Brandi{\'c}",
  title =        "Staleness Control for Edge Data Analytics",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "38:1--38:24",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392156",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392156",
  abstract =     "A new generation of cyber-physical systems has emerged
                 with a large number of devices that continuously
                 generate and consume massive amounts of data in a
                 distributed and mobile manner. Accurate and near
                 real-time decisions based on such streaming data
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "38",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Wei:2020:OPD,
  author =       "Xiaohan Wei and Hao Yu and Michael J. Neely",
  title =        "Online Primal-Dual Mirror Descent under Stochastic
                 Constraints",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "39:1--39:36",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392157",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392157",
  abstract =     "We consider online convex optimization with stochastic
                 constraints where the objective functions are
                 arbitrarily time-varying and the constraint functions
                 are independent and identically distributed (i.i.d.)
                 over time. Both the objective and constraint \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "39",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Marder:2020:VFO,
  author =       "Alexander Marder and Matthew Luckie and Bradley
                 Huffaker and KC Claffy",
  title =        "{vrfinder}: Finding Outbound Addresses in
                 {Traceroute}",
  journal =      j-POMACS,
  volume =       "4",
  number =       "2",
  pages =        "40:1--40:28",
  month =        jun,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3392158",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:35 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3392158",
  abstract =     "Current methods to analyze the Internet's router-level
                 topology with paths collected using traceroute assume
                 that the source address for each router in the path is
                 either an inbound or off-path address on each router.
                 In this work, we show that outbound \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "40",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Wang:2020:PPA,
  author =       "Xin Wang and Richard T. B. Ma",
  title =        "On Private Peering Agreements between Content and
                 Access Providers: a Contractual Equilibrium Analysis",
  journal =      j-POMACS,
  volume =       "4",
  number =       "3",
  pages =        "41:1--41:32",
  month =        nov,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3428326",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3428326",
  abstract =     "Driven by the rapid growth of content traffic and the
                 demand for service quality, Internet content providers
                 (CPs) have started to bypass transit providers and
                 connect with access providers directly via private
                 peering agreements. This peering \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "41",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Weng:2020:AZA,
  author =       "Wentao Weng and Weina Wang",
  title =        "Achieving Zero Asymptotic Queueing Delay for Parallel
                 Jobs",
  journal =      j-POMACS,
  volume =       "4",
  number =       "3",
  pages =        "42:1--42:36",
  month =        nov,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3428327",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3428327",
  abstract =     "Zero queueing delay is highly desirable in large-scale
                 computing systems. Existing work has shown that it can
                 be asymptotically achieved by using the celebrated
                 Power-of-d-choices (pod) policy with a probe overhead
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "42",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Scully:2020:GPN,
  author =       "Ziv Scully and Isaac Grosof and Mor Harchol-Balter",
  title =        "The {Gittins} Policy is Nearly Optimal in the
                 {M/G/$k$} under Extremely General Conditions",
  journal =      j-POMACS,
  volume =       "4",
  number =       "3",
  pages =        "43:1--43:29",
  month =        nov,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3428328",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3428328",
  abstract =     "The Gittins scheduling policy minimizes the mean
                 response in the single-server M/G/1 queue in a wide
                 variety of settings. Most famously, Gittins is optimal
                 when preemption is allowed and service requirements are
                 unknown but drawn from a known \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "43",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Abanto-Leon:2020:SCL,
  author =       "Luis Fernando Abanto-Leon and Andreas B{\"a}uml and
                 Gek Hong (Allyson) Sim and Matthias Hollick and Arash
                 Asadi",
  title =        "Stay Connected, Leave no Trace: Enhancing Security and
                 Privacy in {WiFi} via Obfuscating Radiometric
                 Fingerprints",
  journal =      j-POMACS,
  volume =       "4",
  number =       "3",
  pages =        "44:1--44:31",
  month =        nov,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3428329",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://portal.acm.org/http://www.math.utah.edu/pub/tex/bib/pomacs.bib;
                 http://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3428329",
  abstract =     "The intrinsic hardware imperfection of WiFi chipsets
                 manifests itself in the transmitted signal, leading to
                 a unique radiometric fingerprint. This fingerprint can
                 be used as an additional means of authentication to
                 enhance security. In fact, recent orks propose
                 practical fingerprinting solutions that can be readily
                 implemented in commercial-off-the-shelf devices. In
                 this paper, we prove analytically and experimentally
                 that these solutions are highly vulnerable to
                 impersonation attacks. We also demonstrate that such a
                 unique device-based signature can be abused to violate
                 privacy by tracking the user device, and, as of today,
                 users do not have any means to prevent such privacy
                 attacks other than turning off the device. We propose
                 RF-Veil, a radiometric fingerprinting solution that not
                 only is robust against impersonation attacks but also
                 protects user privacy by obfuscating the radiometric
                 fingerprint of the transmitter for non-legitimate
                 receivers. Specifically, we introduce a randomized
                 pattern of phase errors to the transmitted signal such
                 that only the intended receiver can extract the
                 original fingerprint of the transmitter. In a series of
                 experiments and analyses, we expose the vulnerability
                 of adopting naive randomization to statistical attacks
                 and introduce countermeasures. Finally, we show the
                 efficacy of RF-Veil experimentally in protecting user
                 privacy and enhancing security. More importantly, our
                 proposed solution allows communicating with other
                 devices, which do not employ RF-Veil.",
  acknowledgement = ack-nhfb,
  articleno =    "44",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Weng:2020:OLB,
  author =       "Wentao Weng and Xingyu Zhou and R. Srikant",
  title =        "Optimal Load Balancing with Locality Constraints",
  journal =      j-POMACS,
  volume =       "4",
  number =       "3",
  pages =        "45:1--45:37",
  month =        nov,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3428330",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3428330",
  abstract =     "Applications in cloud platforms motivate the study of
                 efficient load balancing under job-server constraints
                 and server heterogeneity. In this paper, we study load
                 balancing on a bipartite graph where left nodes
                 correspond to job types and right nodes \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "45",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Raaijmakers:2020:ASR,
  author =       "Youri Raaijmakers and Sem Borst",
  title =        "Achievable Stability in Redundancy Systems",
  journal =      j-POMACS,
  volume =       "4",
  number =       "3",
  pages =        "46:1--46:21",
  month =        nov,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3428331",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3428331",
  abstract =     "We consider a system with $N$ parallel servers where
                 incoming jobs are immediately replicated to, say,
                 d~servers. Each of the N servers has its own queue and
                 follows a FCFS discipline. As soon as the first job
                 replica is completed, the remaining replicas \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "46",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Fleder:2020:KWY,
  author =       "Michael Fleder and Devavrat Shah",
  title =        "{I} Know What You Bought At {Chipotle} for \$9.81 by
                 Solving A Linear Inverse Problem",
  journal =      j-POMACS,
  volume =       "4",
  number =       "3",
  pages =        "47:1--47:17",
  month =        nov,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3428332",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3428332",
  abstract =     "We consider the question of identifying which set of
                 products are purchased and at what prices in a given
                 transaction by observing only the total amount spent in
                 the transaction, and nothing more. The ability to solve
                 such an inverse problem can lead to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "47",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Anton:2020:IPH,
  author =       "Elene Anton and Urtzi Ayesta and Matthieu Jonckheere
                 and Ina Maria Verloop",
  title =        "Improving the Performance of Heterogeneous Data
                 Centers through Redundancy",
  journal =      j-POMACS,
  volume =       "4",
  number =       "3",
  pages =        "48:1--48:29",
  month =        nov,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3428333",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3428333",
  abstract =     "We analyze the performance of redundancy in a
                 multi-type job and multi-type server system. We assume
                 the job dispatcher is unaware of the servers'
                 capacities, and we set out to study under which
                 circumstances redundancy improves the performance. With
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "48",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Hazimeh:2020:MGT,
  author =       "Ahmad Hazimeh and Adrian Herrera and Mathias Payer",
  title =        "{Magma}: a Ground-Truth Fuzzing Benchmark",
  journal =      j-POMACS,
  volume =       "4",
  number =       "3",
  pages =        "49:1--49:29",
  month =        nov,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3428334",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3428334",
  abstract =     "High scalability and low running costs have made fuzz
                 testing the de facto standard for discovering software
                 bugs. Fuzzing techniques are constantly being improved
                 in a race to build the ultimate bug-finding tool.
                 However, while fuzzing excels at \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "49",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Gao:2020:TCC,
  author =       "Bingyu Gao and Haoyu Wang and Pengcheng Xia and Siwei
                 Wu and Yajin Zhou and Xiapu Luo and Gareth Tyson",
  title =        "Tracking Counterfeit Cryptocurrency End-to-end",
  journal =      j-POMACS,
  volume =       "4",
  number =       "3",
  pages =        "50:1--50:28",
  month =        nov,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3428335",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3428335",
  abstract =     "The production of counterfeit money has a long
                 history. It refers to the creation of imitation
                 currency that is produced without the legal sanction of
                 government. With the growth of the cryptocurrency
                 ecosystem, there is expanding evidence that \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "50",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Sun:2020:CAO,
  author =       "Bo Sun and Ali Zeynali and Tongxin Li and Mohammad
                 Hajiesmaili and Adam Wierman and Danny H. K. Tsang",
  title =        "Competitive Algorithms for the Online Multiple
                 Knapsack Problem with Application to Electric Vehicle
                 Charging",
  journal =      j-POMACS,
  volume =       "4",
  number =       "3",
  pages =        "51:1--51:32",
  month =        nov,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3428336",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3428336",
  abstract =     "We introduce and study a general version of the
                 fractional online knapsack problem with multiple
                 knapsacks, heterogeneous constraints on which items can
                 be assigned to which knapsack, and rate-limiting
                 constraints on the assignment of items to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "51",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Asgari:2020:BSO,
  author =       "Kamiar Asgari and Michael J. Neely",
  title =        "{Bregman}-style Online Convex Optimization with
                 Energy-Harvesting Constraints",
  journal =      j-POMACS,
  volume =       "4",
  number =       "3",
  pages =        "52:1--52:25",
  month =        nov,
  year =         "2020",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3428337",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3428337",
  abstract =     "This paper considers online convex optimization (OCO)
                 problems where decisions are constrained by available
                 energy resources. A key scenario is optimal power
                 control for an energy harvesting device with a finite
                 capacity battery. The goal is to minimize \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "52",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Yang:2021:SSG,
  author =       "Lishan Yang and Bin Nie and Adwait Jog and Evgenia
                 Smirni",
  title =        "{SUGAR}: Speeding Up {GPGPU} Application Resilience
                 Estimation with Input Sizing",
  journal =      j-POMACS,
  volume =       "5",
  number =       "1",
  pages =        "01:1--01:29",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3447375",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://portal.acm.org/http://www.math.utah.edu/pub/tex/bib/pomacs.bib;
                 http://www.math.utah.edu/pub/tex/bib/pvm.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447375",
  abstract =     "As Graphics Processing Units (GPUs) are becoming a de
                 facto solution for accelerating a wide range of
                 applications, their reliable operation is becoming
                 increasingly important. One of the major challenges in
                 the domain of GPU reliability is to \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "01",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Zhu:2021:FBG,
  author =       "Zhaowei Zhu and Jingxuan Zhu and Ji Liu and Yang Liu",
  title =        "{Federated Bandit}: a Gossiping Approach",
  journal =      j-POMACS,
  volume =       "5",
  number =       "1",
  pages =        "02:1--02:29",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3447380",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447380",
  abstract =     "In this paper, we study Federated Bandit, a
                 decentralized Multi-Armed Bandit problem with a set of
                 N agents, who can only communicate their local data
                 with neighbors described by a connected graph G. Each
                 agent makes a sequence of decisions on selecting
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "02",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Pourghassemi:2021:ACP,
  author =       "Behnam Pourghassemi and Jordan Bonecutter and Zhou Li
                 and Aparna Chandramowlishwaran",
  title =        "{adPerf}: Characterizing the Performance of
                 Third-party Ads",
  journal =      j-POMACS,
  volume =       "5",
  number =       "1",
  pages =        "03:1--03:26",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3447381",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447381",
  abstract =     "Monetizing websites and web apps through online
                 advertising is widespread in the web ecosystem,
                 creating a billion-dollar market. This has led to the
                 emergence of a vast network of tertiary ad providers
                 and ad syndication to facilitate this growing
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "03",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Akbari:2021:LBC,
  author =       "Iman Akbari and Mohammad A. Salahuddin and Leni Ven
                 and Noura Limam and Raouf Boutaba and Bertrand Mathieu
                 and Stephanie Moteau and Stephane Tuffin",
  title =        "A Look Behind the Curtain: Traffic Classification in
                 an Increasingly Encrypted {Web}",
  journal =      j-POMACS,
  volume =       "5",
  number =       "1",
  pages =        "04:1--04:26",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3447382",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://portal.acm.org/http://www.math.utah.edu/pub/tex/bib/pomacs.bib;
                 http://www.math.utah.edu/pub/tex/bib/cryptography2020.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447382",
  abstract =     "Traffic classification is essential in network
                 management for operations ranging from capacity
                 planning, performance monitoring, volumetry, and
                 resource provisioning, to anomaly detection and
                 security. Recently, it has become increasingly
                 challenging ith the widespread adoption of encryption
                 in the Internet, e.g., as a de-facto in HTTP/2 and QUIC
                 protocols. In the current state of encrypted traffic
                 classification using Deep Learning (DL), we identify
                 fundamental issues in the way it is typically
                 approached. For instance, although complex DL models
                 with millions of parameters are being used, these
                 models implement a relatively simple logic based on
                 certain header fields of the TLS handshake, limiting
                 model robustness to future versions of encrypted
                 protocols. Furthermore, encrypted traffic is often
                 treated as any other raw input for DL, while crucial
                 domain-specific considerations exist that are commonly
                 ignored. In this paper, we design a novel feature
                 engineering approach that generalizes well for
                 encrypted web protocols, and develop a neural network
                 architecture based on Stacked Long Short-Term Memory
                 (LSTM) layers and Convolutional Neural Networks (CNN)
                 that works very well with our feature design. We
                 evaluate our approach on a real-world traffic dataset
                 from a major ISP and Mobile Network Operator. We
                 achieve an accuracy of 95\% in service classification
                 with less raw traffic and smaller number of parameters,
                 out-performing a state-of-the-art method by nearly 50\%
                 fewer false classifications. We show that our DL model
                 generalizes for different classification objectives and
                 encrypted web protocols. We also evaluate our approach
                 on a public QUIC dataset with finer and
                 application-level granularity in labeling, achieving an
                 overall accuracy of 99\%.",
  acknowledgement = ack-nhfb,
  articleno =    "04",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Han:2021:AAS,
  author =       "Kai Han and Shuang Cui and Tianshuai Zhu and Enpei
                 Zhang and Benwei Wu and Zhizhuo Yin and Tong Xu and
                 Shaojie Tang and He Huang",
  title =        "Approximation Algorithms for Submodular Data
                 Summarization with a Knapsack Constraint",
  journal =      j-POMACS,
  volume =       "5",
  number =       "1",
  pages =        "05:1--05:31",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3447383",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447383",
  abstract =     "Data summarization, i.e., selecting representative
                 subsets of manageable size out of massive data, is
                 often modeled as a submodular optimization problem.
                 Although there exist extensive algorithms for
                 submodular optimization, many of them incur large
                 \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "05",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Foerster:2021:IDD,
  author =       "Klaus-Tycho Foerster and Janne H. Korhonen and Ami Paz
                 and Joel Rybicki and Stefan Schmid",
  title =        "Input-Dynamic Distributed Algorithms for Communication
                 Networks",
  journal =      j-POMACS,
  volume =       "5",
  number =       "1",
  pages =        "06:1--06:33",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3447384",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447384",
  abstract =     "Consider a distributed task where the communication
                 network is fixed but the local inputs given to the
                 nodes of the distributed system may change over time.
                 In this work, we explore the following question: if
                 some of the local inputs change, can an \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "06",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Wang:2021:ZQM,
  author =       "Weina Wang and Qiaomin Xie and Mor Harchol-Balter",
  title =        "Zero Queueing for Multi-Server Jobs",
  journal =      j-POMACS,
  volume =       "5",
  number =       "1",
  pages =        "07:1--07:25",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3447385",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447385",
  abstract =     "Cloud computing today is dominated by multi-server
                 jobs. These are jobs that request multiple servers
                 simultaneously and hold onto all of these servers for
                 the duration of the job. Multi-server jobs add a lot of
                 complexity to the traditional one-server-. \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "07",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Tang:2021:RMG,
  author =       "Jing Tang and Xueyan Tang and Andrew Lim and Kai Han
                 and Chongshou Li and Junsong Yuan",
  title =        "Revisiting Modified Greedy Algorithm for Monotone
                 Submodular Maximization with a Knapsack Constraint",
  journal =      j-POMACS,
  volume =       "5",
  number =       "1",
  pages =        "08:1--08:22",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3447386",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447386",
  abstract =     "Monotone submodular maximization with a knapsack
                 constraint is NP-hard. Various approximation algorithms
                 have been devised to address this optimization problem.
                 In this paper, we revisit the widely known modified
                 greedy algorithm. First, we show that \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "08",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}

@Article{Cuvelier:2021:SEP,
  author =       "Thibaut Cuvelier and Richard Combes and Eric Gourdin",
  title =        "Statistically Efficient, Polynomial-Time Algorithms
                 for Combinatorial Semi-Bandits",
  journal =      j-POMACS,
  volume =       "5",
  number =       "1",
  pages =        "09:1--09:31",
  month =        feb,
  year =         "2021",
  CODEN =        "????",
  DOI =          "https://doi.org/10.1145/3447387",
  ISSN =         "2476-1249",
  ISSN-L =       "2476-1249",
  bibdate =      "Mon Mar 29 10:31:36 MDT 2021",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/pomacs.bib",
  URL =          "https://dl.acm.org/doi/10.1145/3447387",
  abstract =     "We consider combinatorial semi-bandits over a set of
                 arms $X \subset \{0,1\}^d$ where rewards are
                 uncorrelated across items. For this problem, the
                 algorithm ESCB yields the smallest known regret bound
                 $R(T) = O(d (\ln m)^2 (\ln T) / \Delta_\min)$ after $T$
                 rounds, \ldots{}",
  acknowledgement = ack-nhfb,
  articleno =    "09",
  fjournal =     "Proceedings of the ACM on Measurement and Analysis of
                 Computing Systems (POMACS)",
  journal-URL =  "https://dl.acm.org/loi/pomacs",
}