Although Remote Procedure Calls (RPCs) generate bulk of the network traffic in modern disaggregated datacenters, network-level optimizations still focus on low-level metrics at the granularity of packets, flowlets, and flows. The lack of application-level semantics lead to suboptimal performance as there is often a mismatch between network- and application-level metrics. Indeed, my works … Continue Reading ››
Tag Archives: SIGCOMM
AIFO Accepted to Appear at SIGCOMM’2021
Packet scheduling is a classic problem in networking. In recent years, however, the focus on packet scheduling has somewhat shifted from designing new scheduling algorithms to designing generalized frameworks that can be programmed to approximate a variety of scheduling disciplines. Push-In-First-Out (PIFO) from SIGCOMM 2016 is such a framework that has been shown … Continue Reading ››
NetLock Accepted to Appear at SIGCOMM’2020
High-throughput, low-latency lock managers are useful for building a variety of distributed applications. Traditionally, a key tradeoff in this context had been expressed in terms of the amount of knowledge available to the lock manager. On the one hand, a decentralized lock manager can increase throughput by parallelization, but it can starve certain … Continue Reading ››
Hermes Accepted to Appear at SIGCOMM’2017
Datacenter load balancing, especially in Clos topologies, remains a hot topic even after almost a decade. The pace of progress has picked up over the last few years with multiple solutions exploring different extremes of the solution space, ranging from edge-based to in-network solutions and using different granularities of load balancing: packets, flowcells, flowlets, or … Continue Reading ››
CODA Accepted to Appear at SIGCOMM’2016
Update: Camera-ready version is available here now!
Since introducing the coflow abstraction in 2012, we've been working hard to make it practical one step at a time. Over the years, we've worked on efficient coflow scheduling, removed clairvoyance requirements in coflow scheduling, and performed fair sharing among coexisting coflows. Throughout all these efforts, one requirement remained constant: all … Continue Reading ››
Aalo Accepted to Appear at SIGCOMM’2015
Update: Camera-ready version is available here now!
Last SIGCOMM we introduced the coflow scheduling problem and presented Varys that addressed its clairvoyant variation, i.e., when all the information of individual coflows are known a priori, and there is no cluster and task scheduling dynamics. In many cases, these assumptions do not hold very well and left us with two primary … Continue Reading ››
Varys accepted at SIGCOMM’2014: Coflow is coming!
Update 2: Varys Developer Alpha released!
Update 1: Latest version will be is available here soon now!
We introduced the coflow abstraction back in 2012 at HotNets-XI, and now we have something solid to show what coflows are good for. Our paper on efficient and deadline-sensitive coflow scheduling has been accepted to appear at this year's … Continue Reading ››
Sinbad accepted to appear at SIGCOMM’2013
Update: Latest version is available here!
Our paper on leveraging flexibility in endpoint placement, aka Sinbad/Usher/Orchestrated File System (OFS), has been accepted for publication at this year's SIGCOMM. We introduce constrained anycast in data-intensive clusters in the form of network-aware replica placement for cluster/distributed file systems. This is the second piece of my dissertation research, … Continue Reading ››
“Surviving Failures in Bandwidth-Constrained Datacenters” at SIGCOMM’2012
Update: Camera-ready version is in my publications page!
My internship work from last Summer has been accepted for publication at SIGCOMM'2012 as well; yay!! In this piece of work, we try to allocate machines for datacenter applications with bandwidth and fault-tolerance constraints, which are at odds—allocation for bandwidth tries to put machines closer, whereas a fault-tolerant … Continue Reading ››
FairCloud has been accepted at SIGCOMM’2012
Update: Camera-ready is now available online!
This is kinda old news now, but still as exciting as it was few days ago. Our paper "FairCloud: Sharing the Network in Cloud Computing" has been accepted for publication at this year's SIGCOMM. We explore the design space of sharing networks, identify tradeoffs, and place categorize different strategies … Continue Reading ››