The main part of SIGCOMM 2019 is consistent with the previous styles of the Special Interest Group on Data Communication, and concentrates on papers with basic contributions, leading influence, and solid systems background, and are related to new ways to operate networks, transport and congestion, measurements, new physical layers, formal network analysis, new ways to solve old problems, applications, NICs and switches, video, and new control-plane operations.
Enabling a permanent revolution in internet architecture
Recent Internet research has been driven by two facts and their contradictory implications: the current Internet architecture is both inherently flawed (so we should explore radically different alternative designs) and deeply entrenched (so we should ...
Bridging the data charging gap in the cellular edge
The 4G/5G cellular edge promises low-latency experiences anywhere, anytime. However, data charging gaps can arise between the cellular operators and edge application vendors, and cause over-/under-billing. We find that such gap can come from data loss, ...
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
To keep up with the continuous growth in demand, cloud providers spend millions of dollars augmenting the capacity of their wide-area backbones and devote significant effort to efficiently utilizing WAN capacity. A key challenge is striking a good ...
HPCC: high precision congestion control
- Yuliang Li,
- Rui Miao,
- Hongqiang Harry Liu,
- Yan Zhuang,
- Fei Feng,
- Lingbo Tang,
- Zheng Cao,
- Ming Zhang,
- Frank Kelly,
- Mohammad Alizadeh,
- Minlan Yu
Congestion control (CC) is the key to achieving ultra-low latency, high bandwidth and network stability in high-speed networks. From years of experience operating large-scale and high-speed RDMA networks, we find the existing high-speed CC schemes have ...
Pluginizing QUIC
- Quentin De Coninck,
- François Michel,
- Maxime Piraux,
- Florentin Rochet,
- Thomas Given-Wilson,
- Axel Legay,
- Olivier Pereira,
- Olivier Bonaventure
Application requirements evolve over time and the underlying protocols need to adapt. Most transport protocols evolve by negotiating protocol extensions during the handshake. Experience with TCP shows that this leads to delays of several years or more ...
Gentle flow control: avoiding deadlock in lossless networks
Many applications in distributed systems rely on underlying lossless networks to achieve required performance. Existing lossless network solutions propose different hop-by-hop flow controls to guarantee zero packet loss. However, another crucial problem ...
Socksdirect: datacenter sockets can be fast and compatible
Communication intensive applications in hosts with multi-core CPU and high speed networking hardware often put considerable stress on the native socket system in an OS. Existing socket replacements often leave significant performance on the table, as ...
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
The network communications between the cloud and the client have become the weak link for global cloud services that aim to provide low latency services to their clients. In this paper, we first characterize WAN latency from the viewpoint of a large ...
RF-based inertial measurement
Inertial measurements are critical to almost any mobile applications. It is usually achieved by dedicated sensors (e.g., accelerometer, gyroscope) that suffer from significant accumulative errors. This paper presents RIM, an RF-based Inertial ...
A large-scale analysis of deployed traffic differentiation practices
Net neutrality has been the subject of considerable public debate over the past decade. Despite the potential impact on content providers and users, there is currently a lack of tools or data for stakeholders to independently audit the net neutrality ...
Residential links under the weather
Weather is a leading threat to the stability of our vital infrastructure. Last-mile Internet is no exception. Yet, unlike other vital infrastructure, weather's effect on last-mile Internet outages is not well understood. This work is the first attempt ...
A link layer protocol for quantum networks
- Axel Dahlberg,
- Matthew Skrzypczyk,
- Tim Coopmans,
- Leon Wubben,
- Filip Rozpędek,
- Matteo Pompili,
- Arian Stolk,
- Przemysław Pawełczak,
- Robert Knegjens,
- Julio de Oliveira Filho,
- Ronald Hanson,
- Stephanie Wehner
Quantum communication brings radically new capabilities that are provably impossible to attain in any classical network. Here, we take the first step from a physics experiment to a quantum internet system. We propose a functional allocation of a quantum ...
A millimeter wave network for billions of things
With the advent of the Internet of Things (IoT), billions of new connected devices will come online, placing a huge strain on today's WiFi and cellular spectrum. This problem will be further exacerbated by the fact that many of these IoT devices are low-...
Underwater backscatter networking
We present Piezo-Acoustic Backscatter (PAB), the first technology that enables backscatter networking in underwater environments. PAB relies on the piezoelectric effect to enable underwater communication and sensing at near-zero power. Its architecture ...
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,
- Ivan Lee,
- Anup Namdhari,
- Haseeb Niaz,
- Aniruddha Parkhi,
- Hanukumar Pinnamraju,
- Adrian Power,
- Neha Milind Raje,
- Parag Sharma
We describe our experiences using formal methods and automated theorem proving for network operation at scale. The experiences are based on developing and applying the SecGuru and RCDC (Reality Checker for Data Centers) tools in Azure. SecGuru has been ...
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,
- Ming Zhang,
- Da Yu,
- Chen Tian,
- Haitao Zheng,
- Ben Y. Zhao
In-network Access Control List (ACL) is an important technique in ensuring network-wide connectivity and security. As cloud-scale WANs today constantly evolve in size and complexity, in-network ACL rules are becoming increasingly more complex. This ...
Formal specification and testing of QUIC
QUIC is a new Internet secure transport protocol currently in the process of IETF standardization. It is intended as a replacement for the TLS/TCP stack and will be the basis of HTTP/3, the next official version of the hypertext transfer protocol. As a ...
Leveraging quantum annealing for large MIMO processing in centralized radio access networks
User demand for increasing amounts of wireless capacity continues to outpace supply, and so to meet this demand, significant progress has been made in new MIMO wireless physical layer techniques. Higher-performance systems now remain impractical largely ...
Neural packet classification
Packet classification is a fundamental problem in computer networking. This problem exposes a hard tradeoff between the computation and state complexity, which makes it particularly challenging. To navigate this tradeoff, existing solutions rely on ...
Learning scheduling algorithms for data processing clusters
Efficiently scheduling data processing jobs on distributed compute clusters requires complex algorithms. Current systems use simple, generalized heuristics and ignore workload characteristics, since developing and tuning a scheduling policy for each ...
E2E: embracing user heterogeneity to improve quality of experience on the web
Conventional wisdom states that to improve quality of experience (QoE), web service providers should reduce the median or other percentiles of server-side delays. This work shows that doing so can be inefficient due to user heterogeneity in how the ...
Graphene: efficient interactive set reconciliation applied to blockchain propagation
We introduce Graphene, a method and protocol for interactive set reconciliation among peers in blockchains and related distributed systems. Through the novel combination of a Bloom filter and an Invertible Bloom Lookup Table (IBLT), Graphene uses a ...
Offloading distributed applications onto smartNICs using iPipe
Emerging Multicore SoC SmartNICs, enclosing rich computing resources (e.g., a multicore processor, onboard DRAM, accelerators, programmable DMA engines), hold the potential to offload generic datacenter server tasks. However, it is unclear how to use a ...
Nitrosketch: robust and general sketch-based monitoring in software switches
Software switches are emerging as a vital measurement vantage point in many networked systems. Sketching algorithms or sketches, provide high-fidelity approximate measurements, and appear as a promising alternative to traditional approaches such as ...
PicNIC: predictable virtualized NIC
- Praveen Kumar,
- Nandita Dukkipati,
- Nathan Lewis,
- Yi Cui,
- Yaogong Wang,
- Chonggang Li,
- Valas Valancius,
- Jake Adriaens,
- Steve Gribble,
- Nate Foster,
- Amin Vahdat
Network virtualization stacks are the linchpins of public clouds. A key goal is to provide performance isolation so that workloads on one Virtual Machine (VM) do not adversely impact the network experience of another VM. Using data from a major public ...
Fast, scalable, and programmable packet scheduler in hardware
With increasing link speeds and slowdown in the scaling of CPU speeds, packet scheduling in software is resulting in lower precision and higher CPU utilization. By offloading packet scheduling to the hardware such as a NIC, one can potentially overcome ...
Vantage: optimizing video upload for time-shifted viewing of social live streams
Social live video streaming (SLVS) applications are becoming increasingly popular with the rise of platforms such as Facebook-Live, YouTube-Live, Twitch and Periscope. A key characteristic that differentiates this new class of applications from ...
Pano: optimizing 360° video streaming with a better understanding of quality perception
Streaming 360° videos requires more bandwidth than non-360° videos. This is because current solutions assume that users perceive the quality of 360° videos in the same way they perceive the quality of non-360° videos. This means the bandwidth demand ...
End-to-end transport for video QoE fairness
- Vikram Nathan,
- Vibhaalakshmi Sivaraman,
- Ravichandra Addanki,
- Mehrdad Khani,
- Prateesh Goyal,
- Mohammad Alizadeh
The growth of video traffic makes it increasingly likely that multiple clients share a bottleneck link, giving video content providers an opportunity to optimize the experience of multiple users jointly. But today's transport protocols are oblivious to ...
Towards highly available clos-based WAN routers
The performance and availability of cloud and content providers often depends on the wide area networks (WANs) they use to interconnect their datacenters. WAN routers, which connect to each other using trunks (bundles of links), are sometimes built ...
On optimal neighbor discovery
Mobile devices apply neighbor discovery (ND) protocols to wirelessly initiate a first contact within the shortest possible amount of time and with minimal energy consumption. For this purpose, over the last decade, a vast number of ND protocols have ...
Elmo: source routed multicast for public clouds
We present Elmo, a system that addresses the multicast scalability problem in multi-tenant datacenters. Modern cloud applications frequently exhibit one-to-many communication patterns and, at the same time, require sub-millisecond latencies and high ...
- Proceedings of the ACM Special Interest Group on Data Communication
Recommendations
Acceptance Rates
Year | Submitted | Accepted | Rate |
---|---|---|---|
SIGCOMM '16 | 231 | 39 | 17% |
SIGCOMM '15 | 242 | 40 | 17% |
SIGCOMM '14 | 242 | 45 | 19% |
SIGCOMM '13 | 246 | 38 | 15% |
SIGCOMM '11 | 223 | 32 | 14% |
SIGCOMM '03 | 319 | 34 | 11% |
SIGCOMM '02 | 300 | 25 | 8% |
SIGCOMM '01 | 252 | 23 | 9% |
SIGCOMM '00 | 238 | 26 | 11% |
SIGCOMM '99 | 190 | 24 | 13% |
SIGCOMM '98 | 247 | 26 | 11% |
SIGCOMM '97 | 213 | 24 | 11% |
SIGCOMM '96 | 162 | 27 | 17% |
SIGCOMM '95 | 143 | 30 | 21% |
SIGCOMM '94 | 141 | 29 | 21% |
Overall | 3,389 | 462 | 14% |