Navindra Yadav
Cisco Systems, Inc.
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Navindra Yadav.
acm special interest group on data communication | 2015
Mohammad Alizadeh; Tom Edsall; Sarang Dharmapurikar; Ramanan Vaidyanathan; Kevin Chu; Andy Fingerhut; Francis Matus; Rong Pan; Navindra Yadav; George Varghese
We present the design, implementation, and evaluation of CONGA, a network-based distributed congestion-aware load balancing mechanism for datacenters. CONGA exploits recent trends including the use of regular Clos topologies and overlays for network virtualization. It splits TCP flows into flowlets, estimates real-time congestion on fabric paths, and allocates flowlets to paths based on feedback from remote switches. This enables CONGA to efficiently balance load and seamlessly handle asymmetry, without requiring any TCP modifications. CONGA has been implemented in custom ASICs as part of a new datacenter fabric. In testbed experiments, CONGA has 5x better flow completion times than ECMP even with a single link failure and achieves 2-8x better throughput than MPTCP in Incast scenarios. Further, the Price of Anarchy for CONGA is provably small in Leaf-Spine topologies; hence CONGA is nearly as effective as a centralized scheduler while being able to react to congestion in microseconds. Our main thesis is that datacenter fabric load balancing is best done in the network, and requires global schemes such as CONGA to handle asymmetry.
international workshop on security | 2016
Vimalkumar Jeyakumar; Omid Madani; Ali Parandehgheibi; Navindra Yadav
Large scale datacenters are becoming the compute and data platform of large enterprises, but their scale makes them difficult to secure applications running within. We motivate this setting using a real world complex scenario, and propose a data-driven approach to taming this complexity. We discuss several machine learning problems that arise, in particular focusing on inducing so-called whitelist communication policies, from observing masses of communications among networked computing nodes. Briefly, a whitelist policy specifies which machine, or groups of machines, can talk to which. We present some of the challenges and opportunities, such as noisy and incomplete data, non-stationarity, lack of supervision, challenges of evaluation, and describe some of the approaches we have found promising.
Archive | 2011
Nitin Nayar; Jeffrey D. Taft; Navindra Yadav
Archive | 2010
Navindra Yadav; Bhanu Gopalasetty; Patrice R. Calhoun; Abhijit Choudhury; Rohit Suri; Sudhir Jain; Fusun Ertemalp; Kent K. Leung
Archive | 2006
Navindra Yadav; James Rivers; Gnanaprakasam Pandian; Pauline Shuen; Scott Emery
Archive | 2011
Jeffrey D. Taft; Navindra Yadav
Archive | 2006
Moni Pande; Jie Cheng Jiang; Navindra Yadav; Gnanaprakasam Pandian; Pauline Shuen
Archive | 2013
James N. Guichard; Paul Quinn; David D. Ward; Surendra Kumar; Nagaraj Bagepalli; Michael R. Smith; Navindra Yadav
Archive | 2010
Robert Andrews; Navindra Yadav; Shree Murthy; Gnanaprakasam Pandian
Archive | 2013
Navindra Yadav; Jim Guichard; Brad McConnell; Christian Jacquenet; M. Smith; Kevin Glavin; Abhishek Chauhan; Mohamed Boucadair; Paul Quinn; Rajeev Manur; Puneet Agarwal; Thomas D. Nadeau; Nicolai Leymann; Surendra Kumar; Ken Gray