Hit enter to search or ESC to close

Paper Digest: SIGCOMM 2019 Highlights

admin

SIGCOMM is one of the top data communications and networking conferences in the world. In 2019, it is to be held in Beijing, China. In this year, there were 221 full paper submissions, of which 32 accepted.

To help the community quickly catch up on the work presented in this conference, Paper Digest Team processed all accepted papers, and generated one highlight sentence (typically the main topic) for each paper. Readers are encouraged to read these machine generated highlights / summaries to quickly get the main idea of each paper.

We thank all authors for writing these interesting papers, and readers for reading our digests. If you do not want to miss any interesting academic paper, you are welcome to sign up our free paper digest service to get new paper updates customized to your own interests on a daily basis.

Paper Digest Team
team@paperdigest.org

TABLE 1: SIGCOMM 2019 Papers

Title Authors Highlight
1 Enabling a permanent revolution in internet architecture James McCauley, Yotam Harchol, Aurojit Panda, Barath Raghavan, Scott Shenker In this paper, we try to reconcile these two perspectives by proposing a backwards-compatible architectural framework called Trotsky in which one can incrementally deploy radically new designs.
2 Bridging the data charging gap in the cellular edge Yuanjie Li, Kyu-Han Kim, Christina Vlachou, Junqing Xie We find that such gap can come from data loss, selfish charging, or both.
3 TEAVAR: striking the right utilization-availability balance in WAN traffic engineering Jeremy Bogle, Nikhil Bhatia, Manya Ghobadi, Ishai Menache, Nikolaj Bj�rner, Asaf Valadarsky, Michael Schapira We present TEAVAR (Traffic Engineering Applying Value at Risk), a system that realizes this risk management approach to traffic engineering (TE).
4 HPCC: high precision congestion control Yuliang Li, Rui Miao, Hongqiang Harry Liu, Yan Zhuang, Fei Feng, Lingbo Tang, Zheng Cao, Ming Zhang, Frank Kelly, In this paper, we present HPCC (High Precision Congestion Control), a new high-speed CC mechanism which achieves the three goals simultaneously.
5 Pluginizing QUIC Quentin De Coninck, Fran�ois Michel, Maxime Piraux, Florentin Rochet, Thomas Given-Wilson, Axel Legay, Olivier Pereira, Olivier Bonaventure In this paper, we revisit the extensibility paradigm of transport protocols.
6 Gentle flow control: avoiding deadlock in lossless networks Kun Qian, Wenxue Cheng, Tong Zhang, Fengyuan Ren In this work, we explore a brand-new perspective to solve network deadlock: avoiding hold and wait situation (another necessary condition).
7 Socksdirect: datacenter sockets can be fast and compatible Bojie Li, Tianyi Cui, Zibo Wang, Wei Bai, Lintao Zhang In this paper, we describe SocksDirect, a user-space high performance socket system.
8 Zooming in on wide-area latencies to a global cloud provider Yuchen Jin, Sundararajan Renganathan, Ganesh Ananthanarayanan, Junchen Jiang, Venkata N. Padmanabhan, Manuel Schroder, Matt Calder, Arvind Krishnamurthy In particular, we focus on instances of latency degradation and design a tool, BlameIt, that enables cloud operators to localize the cause (i.e., faulty AS) of such degradation.
9 RF-based inertial measurement Chenshu Wu, Feng Zhang, Yusen Fan, K. J. Ray Liu This paper presents RIM, an RF-based Inertial Measurement system for precise motion processing.
10 A large-scale analysis of deployed traffic differentiation practices Fangfan Li, Arian Akhavan Niaki, David Choffnes, Phillipa Gill, Alan Mislove In this work, we address this issue by conducting a one-year study of content-based traffic differentiation policies deployed in operational networks, using results from 1,045,413 crowdsourced measurements conducted by 126,249 users across 2,735 ISPs in 183 countries/regions.
11 Residential links under the weather Ramakrishna Padmanabhan, Aaron Schulman, Dave Levin, Neil Spring This work is the first attempt to quantify the effect of weather on residential outages.
12 A link layer protocol for quantum networks Axel Dahlberg, Matthew Skrzypczyk, Tim Coopmans, Leon Wubben, Filip Rozpedek, Matteo Pompili, Arian Stolk, Przemyslaw Pawelczak, Robert Knegjens, We propose a functional allocation of a quantum network stack, and construct the first physical and link layer protocols that turn ad-hoc physics experiments producing heralded entanglement between quantum processors into a well-defined and robust service.
13 A millimeter wave network for billions of things Mohammad H. Mazaheri, Soroush Ameli, Ali Abedi, Omid Abari We present mmX, a novel mmWave network that addresses existing challenges in exploiting mmWave for IoT devices.
14 Underwater backscatter networking Junsu Jang, Fadel Adib We present Piezo-Acoustic Backscatter (PAB), the first technology that enables backscatter networking in underwater environments.
15 Validating datacenters at scale Karthick Jayaraman, Nikolaj Bj�rner, Jitu Padhye, Amar Agrawal, Ashish Bhargava, Paul-Andre C Bissonnette, Shane Foster, Andrew Helwer, Mark Kasten, We describe our experiences using formal methods and automated theorem proving for network operation at scale.
16 Safely and automatically updating in-network ACL configurations with intent language Bingchuan Tian, Xinyi Zhang, Ennan Zhai, Hongqiang Harry Liu, Qiaobo Ye, Chunsheng Wang, Xin Wu, Zhiming Ji, Yihong Sang, This paper presents Jinjing, a system that aids Alibaba’s network operators in automatically and correctly updating ACL configurations in Alibaba’s global WAN. At the heart of Jinjing, we develop a set of novel verification and synthesis techniques to rigorously guarantee the correctness of update plans.
17 Formal specification and testing of QUIC Kenneth L. McMillan, Lenore D. Zuck We describe our experience applying a methodology of compositional specification-based testing to QUIC.
18 Leveraging quantum annealing for large MIMO processing in centralized radio access networks Minsung Kim, Davide Venturelli, Kyle Jamieson We have implemented QuAMax on the 2,031 qubit D-Wave 2000Q quantum annealer, the state-of-the-art in the field.
19 Neural packet classification Eric Liang, Hang Zhu, Xin Jin, Ion Stoica In this paper, we propose a deep reinforcement learning (RL) approach to solve the packet classification problem.
20 Learning scheduling algorithms for data processing clusters Hongzi Mao, Malte Schwarzkopf, Shaileshh Bojja Venkatakrishnan, Zili Meng, Mohammad Alizadeh In this paper, we show that modern machine learning techniques can generate highly-efficient policies automatically.
21 E2E: embracing user heterogeneity to improve quality of experience on the web Xu Zhang, Siddhartha Sen, Daniar Kurniawan, Haryadi Gunawi, Junchen Jiang This paper presents E2E, the first resource allocation system that embraces user heterogeneity to allocate server-side resources in a QoE-aware manner.
22 Graphene: efficient interactive set reconciliation applied to blockchain propagation A. Pinar Ozisik, Gavin Andresen, Brian N. Levine, Darren Tapp, George Bissias, Sunny Katkuri We introduce Graphene, a method and protocol for interactive set reconciliation among peers in blockchains and related distributed systems.
23 Offloading distributed applications onto smartNICs using iPipe Ming Liu, Tianyi Cui, Henry Schuh, Arvind Krishnamurthy, Simon Peter, Karan Gupta Based on our characterization, we build iPipe, an actor-based framework for offloading distributed applications onto SmartNICs.
24 Nitrosketch: robust and general sketch-based monitoring in software switches Zaoxing Liu, Ran Ben-Basat, Gil Einziger, Yaron Kassner, Vladimir Braverman, Roy Friedman, Vyas Sekar In this work, we present the design and implementation of NitroSketch, a sketching framework that systematically addresses the performance bottlenecks of sketches without sacrificing robustness and generality.
25 PicNIC: predictable virtualized NIC Praveen Kumar, Nandita Dukkipati, Nathan Lewis, Yi Cui, Yaogong Wang, Chonggang Li, Valas Valancius, Jake Adriaens, Steve Gribble, In order to provide predictable performance, we propose a new system called PicNIC that shares resources efficiently in the common case while rapidly reacting to ensure isolation.
26 Fast, scalable, and programmable packet scheduler in hardware Vishal Shrivastav Hence in this paper, we propose a generalization of the PIFO primitive, called Push-In-Extract-Out (PIEO), which like PIFO, maintains an ordered list of elements, but unlike PIFO which only allows dequeue from the head of the list, PIEO allows dequeue from arbitrary positions in the list by supporting a programmable predicate-based filtering at dequeue.
27 Vantage: optimizing video upload for time-shifted viewing of social live streams Devdeep Ray, Jack Kosaian, K. V. Rashmi, Srinivasan Seshan In this paper, we present Vantage, a live-streaming upload solution that improves the overall quality of experience for diverse time-shifted viewers by using selective quality-enhancing retransmissions in addition to real-time frames, optimizing the encoding schedules to balance the allocation of the available bandwidth between the two.
28 Pano: optimizing 360� video streaming with a better understanding of quality perception Yu Guan, Chengyuan Zheng, Xinggong Zhang, Zongming Guo, Junchen Jiang This paper presents Pano, a 360� video streaming system that leverages the 360� video-specific factors.
29 End-to-end transport for video QoE fairness Vikram Nathan, Vibhaalakshmi Sivaraman, Ravichandra Addanki, Mehrdad Khani, Prateesh Goyal, Mohammad Alizadeh We implement Minerva on an industry standard video player and server and show that, compared to Cubic and BBR, 15-32%of the videos using Minerva experience an improvement in viewing experience equivalent to a jump in resolution from 720p to 1080p.
30 Towards highly available clos-based WAN routers Sucha Supittayapornpong, Barath Raghavan, Ramesh Govindan Specifically, we describe techniques to 1) optimize trunk wiring to increase effective internal router capacity so as to be resilient to internal failures, 2) compute the effective capacity under different failure patterns, and 3) use these to compute compact routing tables under different failure patterns, since switches have limited routing table sizes.
31 On optimal neighbor discovery Philipp H. Kindt, Samarjit Chakraborty In spite of the simplicity of the problem statement, even after more than 10 years of research on this specific topic, new solutions are still proposed even today.
32 Elmo: source routed multicast for public clouds Muhammad Shahbaz, Lalith Suresh, Jennifer Rexford, Nick Feamster, Ori Rottenstreich, Mukesh Hira We present Elmo, a system that addresses the multicast scalability problem in multi-tenant datacenters.