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

Kausik Subramanian

dblp:192/0491 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
2since 2021 · last 2024
0000-0001-8788-2277ORCID · corroborated

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

Computer networks · 2 · 1 since 2021Software engineering, systems software and programming languages · 2 · 2 first-authorTheory of computation · 1 · 1 since 2021

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
4 papers
Network management and operations · 65% Routing and switching · 25% Datacenter networks · 5%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network management and operations
network verification
0.622020
Detecting network load violations for distributed control planes · PLDI 2020
Liveness Verification of Stateful Network Functions · NSDI 2020
Routing and switching › inter-domain routing
BGP
0.512021
Running BGP in Data Centers at Scale · NSDI 2021
Network management and operations › network verification
control plane verification
0.412020
Detecting network load violations for distributed control planes · PLDI 2020
Network management and operations › network verification
network function verification
0.412020
Liveness Verification of Stateful Network Functions · NSDI 2020
Network management and operations › policy-based management
policy enforcement
0.312017
Genesis: synthesizing forwarding tables in multi-tenant networks · POPL 2017
Routing and switching
routing
0.112021
Running BGP in Data Centers at Scale · NSDI 2021
Datacenter networks
datacenter network reliability
0.112020
Detecting network load violations for distributed control planes · PLDI 2020

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

regular expressions · 0.3divide-and-conquer · 0.3constraint solving · 0.3SMT solver · 0.3
YearPublicationVenuePosition
2024 Learned load balancing
Brian Chang, Kausik Subramanian, Loris D'Antoni, Aditya Akella
Theor. Comput. Sci.2
2021 Running BGP in Data Centers at Scale
Anubhavnidhi Abhashkumar, Kausik Subramanian, Alexey Andreyev, Hyojeong Kim, Nanda Kishore Salem, Petr Lapukhov, Aditya Akella, Hongyi Zeng
NSDI2
2020 Liveness Verification of Stateful Network Functions
Farnaz Yousefi, Anubhavnidhi Abhashkumar, Kausik Subramanian, Kartik Hans, Soudeh Ghorbani, Aditya Akella
NSDI3
2020 Detecting network load violations for distributed control planes
abstract
One of the major challenges faced by network operators pertains to whether their network can meet input traffic demand, avoid overload, and satisfy service-level agreements. Automatically verifying if no network links are overloaded is complicated---requires modeling frequent network failures, complex routing and load-balancing technologies, and evolving traffic requirements. We present QARC, a distributed control plane abstraction that can automatically verify whether a control plane may cause link-load violations under failures. QARC is fully automatic and can help operators program networks that are more resilient to failures and upgrade the network to avoid violations. We apply QARC to real datacenter and ISP networks and find interesting cases of load violations. QARC can detect violations in under an hour.
Kausik Subramanian, Anubhavnidhi Abhashkumar, Loris D'Antoni, Aditya Akella
PLDI1
2017 Genesis: synthesizing forwarding tables in multi-tenant networks
abstract
Operators in multi-tenant cloud datacenters require support for diverse and complex end-to-end policies, such as, reachability, middlebox traversals, isolation, traffic engineering, and network resource management. We present Genesis, a datacenter network management system which allows policies to be specified in a declarative manner without explicitly programming the network data plane. Genesis tackles the problem of enforcing policies by synthesizing switch forwarding tables. It uses the formal foundations of constraint solving in combination with fast off-the-shelf SMT solvers. To improve synthesis performance, Genesis incorporates a novel search strategy that uses regular expressions to specify properties that leverage the structure of datacenter networks, and a divide-and-conquer synthesis procedure which exploits the structure of policy relationships. We have prototyped Genesis, and conducted experiments with a variety of workloads on real-world topologies to demonstrate its performance.
Kausik Subramanian, Loris D'Antoni, Aditya Akella
POPL1