activity
20162025
most citedQuickCast: Fast and Efficient Inter-Datacenter Transfers using Forwarding Tree Cohorts

39 citations · 54 across the 15 of their papers we have counts for

collaborators

17 papers

cs.DB2025

Speculative Ad-hoc Querying

Haoyu Li, Srikanth Kandula, Maria Angels de Luis Balaguer +2

Analyzing large datasets requires responsive query execution, but executing SQL queries on massive datasets can be slow. This paper explores whether query execution can begin even…

cs.NI2023★ 1 cited

Finding Adversarial Inputs for Heuristics using Multi-level Optimization

Pooria Namyar, Behnaz Arzani, Ryan Beckett +5

Production systems use heuristics because they are faster or scale better than their optimal counterparts. Yet, practitioners are often unaware of the performance gap between a heu…

cs.NI2023★ 1 cited

Solving Max-Min Fair Resource Allocations Quickly on Large Graphs

Pooria Namyar, Behnaz Arzani, Srikanth Kandula +5

We consider the max-min fair resource allocation problem. The best-known solutions use either a sequence of optimizations or waterfilling, which only applies to a narrow set of cas…

cs.NI2023

Enhancing Network Management Using Code Generated by Large Language Models

Sathiya Kumaran Mani, Yajie Zhou, Kevin Hsieh +3

Analyzing network topologies and communication graphs plays a crucial role in contemporary network management. However, the absence of a cohesive approach leads to a challenging le…

cs.NI2023★ 2 cited

Rethinking Machine Learning Collective Communication as a Multi-Commodity Flow Problem

Behnaz Arzani, Siva Kesava Reddy Kakarla, Miguel Castro +3

We show communication schedulers' recent work proposed for ML collectives does not scale to the increasing problem sizes that arise from training larger models. These works also of…

cs.NI2023

Enhancing Network Failure Mitigation with Performance-Aware Ranking

Pooria Namyar, Arvin Ghavidel, Daniel Crankshaw +5

Cloud providers install mitigations to reduce the impact of network failures within their datacenters. Existing network mitigation systems rely on simple local criteria or global p…

cs.NI2023

A Deep Learning Perspective on Network Routing

Yarin Perry, Felipe Vieira Frujeri, Chaim Hoch +4

Routing is, arguably, the most fundamental task in computer networking, and the most extensively studied one. A key challenge for routing in real-world environments is the need to…

cs.NI2021★ 3 cited

Energy-Proportional Data Center Network Architecture Through OS, Switch and Laser Co-design

Haiyang Han, Nikos Terzenidis, Dimitris Syrivelis +8

Optical interconnects are already the dominant technology in large-scale data center networks. However, the high optical loss of many optical components coupled with the low effici…

cs.DC2021

Solving Large-Scale Granular Resource Allocation Problems Efficiently with POP

Deepak Narayanan, Fiodar Kazhamiaka, Firas Abuzaid +5

Resource allocation problems in many computer systems can be formulated as mathematical optimization problems. However, finding exact solutions to these problems using off-the-shel…

cs.NI2021

Towards a Cost vs. Quality Sweet Spot for Monitoring Networks

Nofel Yaseen, Behnaz Arzani, Krishna Chintalapudi +6

Continuously monitoring a wide variety of performance and fault metrics has become a crucial part of operating large-scale datacenter networks. In this work, we ask whether we can…

math.ST2021★ 1 cited

Q-error Bounds of Random Uniform Sampling for Cardinality Estimation

Beibin Li, Yao Lu, Chi Wang +1

Random uniform sampling has been studied in various statistical tasks but few of them have covered the Q-error metric for cardinality estimation (CE). In this paper, we analyze the…

cs.DB2020

Approximate Partition Selection for Big-Data Workloads using Summary Statistics

Kexin Rong, Yao Lu, Peter Bailis +2

Many big-data clusters store data in large partitions that support access at a coarse, partition-level granularity. As a result, approximate query processing via row-level sampling…

cs.DC2019★ 1 cited

Efficient Inter-Datacenter Bulk Transfers with Mixed Completion Time Objectives

Mohammad Noormohammadpour, Srikanth Kandula, Cauligi S. Raghavendra +1

Bulk transfers from one to multiple datacenters can have many different completion time objectives ranging from quickly replicating some copies to minimizing the time by which…

cs.NI2018★ 2 cited

Fast and Efficient Bulk Multicasting over Dedicated Inter-Datacenter Networks

Mohammad Noormohammadpour, Cauligi S. Raghavendra, Srikanth Kandula +1

Several organizations have built multiple datacenters connected via dedicated wide area networks over which large inter-datacenter transfers take place. This includes tremendous vo…

cs.NI2018★ 39 cited

QuickCast: Fast and Efficient Inter-Datacenter Transfers using Forwarding Tree Cohorts

Mohammad Noormohammadpour, Cauligi S. Raghavendra, Srikanth Kandula +1

Large inter-datacenter transfers are crucial for cloud service efficiency and are increasingly used by organizations that have dedicated wide area networks between datacenters. A r…

cs.NI2017

DCCast: Efficient Point to Multipoint Transfers Across Datacenters

Mohammad Noormohammadpour, Cauligi S. Raghavendra, Sriram Rao +1

Using multiple datacenters allows for higher availability, load balancing and reduced latency to customers of cloud services. To distribute multiple copies of data, cloud providers…

cs.DC2016★ 4 cited

Do the Hard Stuff First: Scheduling Dependent Computations in Data-Analytics Clusters

Robert Grandl, Srikanth Kandula, Sriram Rao +2

We present a scheduler that improves cluster utilization and job completion times by packing tasks having multi-resource requirements and inter-dependencies. While the problem is a…