Javad Ghaderi



Mail Code 4712

Tel(212) 854-3111
Fax(212) 932-9421

Javad Ghaderi’s research is broadly in the analysis, design, and management of large-scale networked systems. His research draws upon mathematical tools from control, optimization, algorithms, and stochastic processes to analyze and optimize communication networks, social networks, and data centers.

Research Interests

Network Algorithms, Control, and Optimization with applications in Communication Networks, Data Centers, and Social Networks.

Of particular interest to Ghaderi are the resource optimization problems that arise in today’s world of expanding communication networks and data centers: when and how to distribute and execute the data processing jobs and manage the data flows in data centers, and when and how to transmit data packets in wireless networks, in order to maximize throughput, minimize response time, or minimize energy consumption in the system. Ghaderi’s research is focused on setting the foundation of this new era of algorithms for such large-scale networks through an interdisciplinary approach that unifies combinatorial and stochastic optimization. Ghaderi is also collaborating with several colleagues at Columbia Engineering to implement his algorithms in practice.

Ghaderi received his BSc from the University of Tehran, Iran, in 2006, his MSc from the University of Waterloo, Canada, in 2008, and his PhD from the University of Illinois at Urbana-Champaign (UIUC), in 2013, all in Electrical and Computer Engineering. He spent a one-year Simons Postdoctoral Fellowship at the University of Texas at Austin before joining Columbia in 2014. He is the recipient of the Mac Van Valkenburg Graduate Research Award at UIUC, Best Student Paper Finalist at the 2013 American Control Conference (ACC'13), Best Paper Award at the ACM CoNEXT 2016, and NSF CAREER Award in 2017.


  • Simons postdoctoral fellow, University of Texas at Austin, 2013-2014


  • Assistant professor of electrical engineering, Columbia University, 2014–


  • Institute of Electrical and Electronics Engineers (IEEE)
  • ACM Special Interest Group on Measurement and Evaluation (SIGMETERICS)


  • NSF CAREER Award, 2017
  • Best Paper Award, ACM CoNEXT, 2016
  • Best Student Paper Finalist, American Control Conference, 2013
  • Mac Van Valkenburg Graduate Research Award, UIUC, 2012


  • Mehrnoosh Shafiee, Javad Ghaderi, “Brief Announcement: A New Improved Bound for Coflow Scheduling”, ACM Symposium on Parallelism in Algorithms and Architectures (SPAA’17), 2017.
  • Tingjun Chen, Javad Ghaderi, Dan Rubestein, Gil Zussman, "Maximizing Broadcast Throughput Under Ultra-Low-Power Constraints”, Proc. ACM CoNEXT 2016.
  • Mehrnoosh Shafiee, Javad Ghaderi, “Randomized Algorithms for Scheduling VMs in the Cloud”, Proc. IEEE INFOCOM 2016.
  • Mehrnoosh Shafiee, Javad Ghaderi, “A Simple Congestion-Aware Algorithm for Load Balancing in Datacenter Networks”, Proc. IEEE INFOCOM 2016.
  • Javad Ghaderi, Sanjay Shakkottai, R Srikant, “Scheduling Storms and Streams in the Cloud”, ACM Transactions on Modeling and Performance Evaluation of Computing systems, Accepted, March 2016.
  • Javad Ghaderi and R Srikant, “Opinion Dynamics in Social Networks with Stubborn Agents: Equilibrium and Convergence Rate”, Automatica, vol. 50, no. 12, 2014.
  • Sharayu Moharir, Javad Ghaderi, Sujay Sanghavi, Sanjay Shakkottai, “Serving Content with Unknown Demand: the High-Dimensional Regime”, Proc. ACM SIGMETRICS 2014, June 2014.
  • Javad Ghaderi and R Srikant, “On the Design of Efficient CSMA Algorithms for Wireless Networks”, Proc. IEEE Conference on Decision and Control (CDC), pages 954 – 959, Atlanta, December 2010.
  • Javad Ghaderi and R Srikant, “Towards a Theory of Anonymous Networking”, Proc. IEEE Conference on Computer Communications (INFOCOM), pages 1-9, San Diego, March 2010.
  • Javad Ghaderi, Liang-Liang Xie, and Sherman Shen, ‘’Hierarchical Cooperation in Ad Hoc Networks: Optimal Clustering and Achievable Throughput’’, IEEE Trans. on Information Theory, vol. 55, no. 8, pages 3425-3436, August 2009.