Venue of SIGMETRICS 2020


Boston, Massachusetts, USA
June 8-12, 2020

Accepted Papers

Summer Deadline

  • The Great Internet TCP Census by Ayush Mishra (National University of Singapore), Xiangpeng Sun (National University of Singapore), Atishya Jain (Indian Institute of Technology, Delhi), Sameer Pande (Indian Institute of Technology, Delhi), Raj Joshi (National University of Singapore), Ben Leong (National University of Singapore)
  • Forecasting with Alternative Data by Michael Fleder (MIT), Devavrat Shah (MIT)
  • Achieving Efficient Routing in Reconfigurable DCNs by Zhenjie Yang (Tsinghua University), Yong Cui (Tsinghua University), Shihan Xiao (Huawei Technologies), Xin Wang (SUNY Stony Brook), Minming Li (City University of Hong Kong), Chuming Li (Tsinghua University), Yadong Liu (Tsinghua University)
  • Logarithmic Communication for Distributed Optimization in Multi-Agent Systems by Palma London (California Institute of Technology), Shai Vardi (Purdue), Adam Wierman (California Institute of Technology)
  • Lancet: Better Network Resilience by Designing for Pruned Failure Sets by Yiyang Chang (Purdue University), Chuan Jiang (Purdue University), Ashish Chandra (Purdue University), Sanjay Rao (Purdue University), Mohit Tawarmalani (Purdue University)
  • Fundamental Limits of Volume-based Network DoS Attacks by Xinzhe Fu (MIT), Eytan Modiano (MIT)
  • Generalized Sketch Families for Network Traffic Measurement by You Zhou (University of Florida & Google Inc.), Youlin Zhang (University of Florida), Chaoyi Ma (University of Florida), Shigang Chen (University of Florida), Olufemi O Odegbile (University of Florida)
  • Fundamental Limits of Approximate Gradient Coding by Sinong Wang (The Ohio State University), Jiashang Liu (The Ohio State University), Ness Shroff (The Ohio State University)
  • Social Learning in Multi Agent Multi Armed Bandits by Abishek Sankararaman (The University of Texas at Austin), Ayalvadi Ganesh (University of Bristol), Sanjay Shakkottai (The University of Texas at Austin)
  • Partial Recovery of Erdos-Renyi Graph Alignment via k-Core Alignment by Daniel Cullina (Princeton University), Negar Kiyavash (Georgia Tech), Prateek Mittal (Princeton University), H. Vincent Poor (Princeton University)
  • Adaptive Discretization for Episodic Reinforcement Learning in Metric Spaces by Sean R. Sinclair (Cornell University), Christina Lee Yu (Cornell University), Siddhartha Banerjee (Cornell University)
  • Inferring Streaming Video Quality from Encrypted Traffic: Practical Models and Deployment Experience by Francesco Bronzino (Nokia Bell Labs), Paul Schmitt (Princeton University), Sara Ayoubi (Nokia Bell Labs), Guilherme Martins (Princeton University), Renata Teixeira (Inria), Nick Feamster (University of Chicago)
  • Mean Field Analysis of Join-Below-Threshold Load Balancing for Resource Sharing Servers by Illes Antal Horvath (Budapest University of Technology and Economics), Ziv Scully (Carnegie Mellon University), Benny Van Houdt (University of Antwerp)
  • Rateless Codes for Near-Perfect Load Balancing in Distributed Matrix-Vector Multiplication by Ankur Mallick (CMU), Malhar Chaudhari (Oracle Corporation), Utsav Sheth (Automation Anywhere), Ganesh Palanikumar (Apple Inc.), Gauri Joshi (CMU)
  • On the Bottleneck Structure of Congestion-Controlled Networks by Jordi Ros-Giralt (Reservoir Labs), Leandros Tassiulas (Yale University), Malathi Veeraraghavan (University of Virginia), Atul Bohara (Reservoir Labs), Sruthi Yellamraju (Reservoir Labs), Yuang Jiang (Yale University)
  • Heavy-traffic Analysis of the Generalized Switch under Multidimensional State Space Collapse by Daniela Hurtado-Lange (Georgia Tech), Siva Theja Maguluri (Georgia Tech)
  • I Know What You Did Last Summer: Network Monitoring using Interval Queries by Nikita Ivkin (Amazon), Ran Ben Basat (Harvard University), Zaoxing Liu (Carnegie Mellon University), Gil Einziger (Ben Gurion University), Roy Friedman (Technion), Vladimir Braverman (Johns Hopkins University)

Fall Deadline

  • Set the Configuration for the Heart of the OS: On the Practicality of Operating System Kernel Debloating by Hsuan-Chi Kuo (University of Illinois Urbana-Champaign), Jianyan Chen (University of Illinois Urbana-Champaign), Sibin Mohan (University of Illinois Urbana-Champaign), Tianyin Xu (University of Illinois Urbana-Champaign)
  • Dynamic Weighted Fairness with Minimal Disruptions by Sungjin Im (University of California-Merced), Benjamin Moseley (Carnegie Mellon University), Kamesh Munagala (Duke University), Kirk Pruhs (University of Pittsburgh)
  • User-level Threading: Have Your Cake and Eat It Too by Martin Karsten (University of Waterloo), Saman Barghi (University of Waterloo)
  • Online Linear Optimization with Inventory Management Constraints by Lin Yang (The Chinese University of Hong Kong), Mohammad Hajiesmaili (UMass Amherst), Ramesh Sitaraman (UMass Amherst), Adam Wierman (California Institute of Technology), Enrique Mallada (Johns Hopkins University), Wing Shing Wong (The Chinese University of Hong Kong)
  • vrfinder: Finding Forwarding Addresses in Traceroute by Alexander Marder (CAIDA/UC San Diego), Matthew Luckie (University of Waikato), Bradley Huffaker (CAIDA/UC San Diego), Kimberly Claffy (UC San Diego)
  • Unimodal Bandits with Continuous Arms: Order-optimal Regret without Smoothness by Richard Combes (Centrale-Supelec, L2S), Alexandre Proutière (KTH), Alexandre Fauquette (KTH)
  • Characterizing Transnational Internet Performanceand the Great Bottleneck of China by Pengxiong Zhu (University of California, Riverside), Keyu Man (University of California, Riverside), Zhongjie Wang (University of California, Riverside), Zhiyun Qian (UC Riverside), Roya Ensafi (University of Michigan), J. Alex Halderman (University of Michigan), Haixin Duan (360 ESG Institute of Security Research; Institute for Network Science and Cyberspace, Tsinghua University)
  • Third-Party Data Providers Ruin Simple Mechanisms by Yang Cai (Yale University), Federico Echenique (California Institute of Technology), Hu Fu (University of British Columbia), Katrina Ligett (Hebrew University of Jerusalem), Adam Wierman (California Institute of Technology), Juba Ziani (University of Pennsylvania)
  • Simple Near-Optimal Scheduling for the M/G/1 by Ziv Scully (Carnegie Mellon University), Mor Harchol-Balter (Carnegie Mellon University), Alan Scheller-Wolf (Carnegie Mellon University)
  • Non-Asymptotic Analysis of Monte Carlo Tree Search by Devavrat Shah (MIT), Qiaomin Xie (Cornell University), Zhi Xu (MIT)
  • Centaur: A Novel Architecture for Reliable, Low-Wear, High-Density 3D NAND Storage by Chun-Yi Liu (The Pennsylvania State University), Jagadish Kotra (AMD Research), Myoungsoo Jung (KAIST), Mahmut Taylan Kandemir (The Pennsylvania State University)
  • Dynamic Pricing and Matching for Two-Sided Queues by Sushil Mahavir Varma (Georgia Tech), Pornpawee Bumpensanti (Georgia Tech), Siva Theja Maguluri (Georgia Tech), He Wang (Georgia Tech)
  • Your Noise, My Signal: Exploiting Switching Noise for Stealthy Data Exfiltration from Desktop Computers by Zhihui Shao (UC Riverside), Mohammad A. Islam (UT Arlington), Shaolei Ren (UC Riverside)
  • Optimal Data Placement for Heterogeneous Cache, Memory, and Storage Systems by Lei Zhang (Emory University), Reza Karimi (Emory University), Irfan Ahmad (Magnition), Ymir Vigfusson (Emory University)
  • Under the Concealing Surface: Detecting and Understanding Live Webcams in the Wild by JinKe Song (School of Computer and Information Technology, Beijing Jiaotong University), Qiang Li (School of Computer and Information Technology, Beijing Jiaotong University), Haining Wang (Virginia Tech), Limin Sun (Institute of Information Engineering of CAS)
  • Predict and Match: Prophet Inequalities with Uncertain Supply by Reza Alijani (Duke University), Siddhartha Banerjee (Cornell), Sreenivas Gollapudi (Google Research), Kamesh Munagala (Duke University), Kangning Wang (Duke University)
  • Delay-optimal Policies in Partial Fork-join Systems with Redundancy and Random Slowdowns by Martin Zubeldia (Eindhoven University of Technology)
  • Uniform Loss Algorithms for Online Stochastic Decision-Making, With Applications to Bin Packing by Daniel Freund (MIT), Siddhartha Banerjee (Cornell)
  • Fiedler Vector Approximation via Interacting Random Walks by Vishwaraj Doshi (North Carolina State University), Do Young Eun (North Carolina State University)
  • On the Complexity of Traffic Traces and Implications by Chen Avin (Ben Gurion University of the Negev), Manya Ghobadi (MIT), Khen Griner (Ben Gurion University, Israel), Stefan Schmid (University of Vienna)
  • Online Optimization with Predictions and Non-convex Losses by Yiheng Lin (Tsinghua University), Gautam Goel (California Institute of Technology), Adam Wierman (California Institute of Technology)