Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Christopher Canel

dblp:204/3768 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
3since 2021 · last 2024
0000-0001-9047-8996ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4 · 1 first-author · 3 since 2021Software engineering, systems software and programming languages · 2Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
3 papers
Datacenter networks · 66% Transport protocols and congestion control · 34%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Parallel and multicore computing · 28% Hardware accelerators and domain-specific architectures · 25% Cloud and datacenter computing · 25%

Topics — the 10 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Datacenter networks
reconfigurable datacenter network
1.022022
Time-division TCP for reconfigurable data center networks · SIGCOMM 2022
Adapting TCP for Reconfigurable Datacenter Networks · NSDI 2020
Datacenter networks › datacenter transport
datacenter congestion control
0.812024
Understanding Incast Bursts in Modern Datacenters · IMC 2024
Datacenter networks
incast
0.812024
Understanding Incast Bursts in Modern Datacenters · IMC 2024
Transport protocols and congestion control
window-based congestion control
0.812024
Understanding Incast Bursts in Modern Datacenters · IMC 2024
Transport protocols and congestion control
TCP congestion control
0.612022
Time-division TCP for reconfigurable data center networks · SIGCOMM 2022
Datacenter networks › reconfigurable datacenter network
time-varying topology
0.612022
Time-division TCP for reconfigurable data center networks · SIGCOMM 2022
Hardware accelerators and domain-specific architectures
video processing accelerator
0.312018
Mainstream: Dynamic Stem-Sharing for Multi-Tenant Video Processing · USENIX ATC 2018
Parallel and multicore computing
task scheduling
0.312017
Monotasks: Architecting for Performance Clarity in Data Analytics Frameworks · SOSP 2017
Transport protocols and congestion control
TCP variants
0.212022
Time-division TCP for reconfigurable data center networks · SIGCOMM 2022
Transport protocols and congestion control
TCP
0.112020
Adapting TCP for Reconfigurable Datacenter Networks · NSDI 2020

Methods — techniques the papers use, named apart from their topics

simulation · 1.3production workload analysis · 0.8dynamic stem-sharing · 0.3performance modeling · 0.3
YearPublicationVenuePosition
2024 Understanding Incast Bursts in Modern Datacenters
abstract
In datacenters, common incast traffic patterns are challenging because they violate the basic premise of bandwidth stability on which TCP congestion control convergence is built, overwhelming shallow switch buffers and causing packet losses and high latency. To understand why these challenges remain despite decades of research on datacenter congestion control, we conduct an in-depth investigation into high-degree incasts both in production workloads at Meta and in simulation. In addition to characterizing the bursty nature of these incasts and their impacts on the network, our findings demonstrate the shortcomings of widely deployed window-based congestion control techniques used to address incast problems. Furthermore, we find that hosts associated with a specific application or service exhibit similar and predictable incast traffic properties across hours, pointing the way toward solutions that predict and prevent incast bursts, instead of reacting to them.
Christopher Canel, Balasubramanian Madhavan, Srikanth Sundaresan, Neil Spring, Prashanth Kannan, Ying Zhang 0022, Srinivasan Seshan
IMC1
2022 Time-division TCP for reconfigurable data center networks
abstract
Recent proposals for reconfigurable data center networks have shown that providing multiple time-varying paths can improve network capacity and lower physical latency. However, existing TCP variants are ill-suited to utilize available capacity because their congestion control cannot react quickly enough to drastic variations in bandwidth and latency.
Shawn Shuoshuo Chen, Weiyang Wang, Christopher Canel, Srinivasan Seshan, Alex C. Snoeren, Peter Steenkiste
SIGCOMM3
2021 Watching the watchmen: Least privilege for managed network services
abstract
Many enterprises outsource network management (e.g., troubleshooting failures, monitoring performance) to third-party managed service providers (MSPs) to reduce cost. Unfortunately, recent incidents show that MSPs themselves have become an attractive launchpad to gain access to customer networks. In this work, we argue that such incidents arise due to a violation of the least privilege principle. We revisit the MSP outsourcing problem through this least-privilege view, identify key challenges in realizing this framework, and present initial ideas toward this goal. In particular, we propose providing the MSP provider an isolated "digital twin" environment to resolve problems and prevent providers from directly accessing the customer production network. Changes are verified before importing them into the production network, ensuring there are no privilege violations. Our preliminary experiments show that our approach can resolve practical problems (e.g., misconfigurations) and is effective in reducing the attack surfaces for MSP customers.
Guyue Liu, Ao Li 0009, Christopher Canel, Vyas Sekar
HotNets3
2020 Adapting TCP for Reconfigurable Datacenter Networks
Matthew K. Mukerjee, Christopher Canel, Weiyang Wang, Daehyeok Kim, Srinivasan Seshan, Alex C. Snoeren
NSDI2
2018 Mainstream: Dynamic Stem-Sharing for Multi-Tenant Video Processing
Angela H. Jiang, Daniel Lin-Kit Wong, Christopher Canel, Lilia Tang, Ishan Misra, Michael Kaminsky, Michael A. Kozuch, Padmanabhan Pillai, David G. Andersen, Gregory R. Ganger
USENIX ATC3
2017 Performance clarity as a first-class design principle
abstract
Users often struggle to reason about the performance of today's systems. Without an understanding of what factors are most important to performance, users do not know how to tune their system's hardware and software configuration to improve performance. We argue that performance clarity -- making it easy to understand where bottlenecks lie and the performance implications of various system changes -- should be a first class design goal. To illustrate that this is possible, we propose an architecture for data analytics frameworks in which jobs are decomposed into schedulable units called monotasks that each consume a single resource. By untangling the use of different resources, using monotasks allows the system to trivially report time used on each resource and the resource bottleneck. Our prototype implementation of monotasks for Apache Spark is API-compatible and achieves performance parity with Spark, and yields a simple performance model that can predict the effects of future hardware and software changes.
Kay Ousterhout, Christopher Canel, Max Wolffe, Sylvia Ratnasamy, Scott Shenker
HotOS2
2017 Monotasks: Architecting for Performance Clarity in Data Analytics Frameworks
abstract
In today's data analytics frameworks, many users struggle to reason about the performance of their workloads. Without an understanding of what factors are most important to performance, users can't determine what configuration parameters to set and what hardware to use to optimize runtime. This paper explores a system architecture designed to make it easy for users to reason about performance bottlenecks. Rather than breaking jobs into tasks that pipeline many resources, as in today's frameworks, we propose breaking jobs into monotasks: units of work that each use a single resource. We demonstrate that explicitly separating the use of different resources simplifies reasoning about performance without sacrificing performance. Monotasks provide job completion times within 9% of Apache Spark for typical scenarios, and lead to a model for job completion time that predicts runtime under different hardware and software configurations with at most 28% error. Furthermore, separating the use of different resources allows for new optimizations to improve performance.
Kay Ousterhout, Christopher Canel, Sylvia Ratnasamy, Scott Shenker
SOSP2