People
Faculty Members
Ravi Sundaram |
 |
Professor Sundaram's primary research interests are networks and algorithms. He is interested in network performance and approximation algorithms for the design and efficient utilization of networks. He enjoys devising efficient schemes for improving the performance of network based applications and validating their use through innovative systems implementations. He is also interested in network security and game theoretic aspects of network usage. In the past he has worked in complexity theory and combinatorics.
Professor Sundaram joined Northeastern in the fall of 2003. Prior to that he was a Director of Engineering at Akamai Technologies, where he played a critical role in the buildout of the world's leading content delivery network; he established the mapping group which is responsible for directing browser requests (over 10 billion a day) to the optimal Akamai server. He is also the co-inventor of two security related patents (pending) at Akamai that are currently in use at some of the leading government and commercial web sites. Before Akamai he worked as a bond trader at a hedge fund where he got to see, up close, the Russian default on (t)rouble(d) debt in 1998. He received his Bachelors in Computer Science from IIT(Madras) in 1991 and Phd in Math and Computer Science from MIT in 1996.
Career Publication Highlights
J. Chen, R. Kleinberg, L. Lovasz, R. Rajaraman, R. Sundaram and A. Vetta. 2004. (Almost) Tight bounds and existence theorems for confluent flow. In proceedings, Symposium on Theory of Computing (STOC).
M. Kiwi, C. Lund, A. Russell, D. Spielman, and R. Sundaram. 2000. Alternation in interaction. Computational Complexity, 9(3-4): 202-246.
M. Marathe, R. Ravi, R. Sundaram, S.S. Ravi, D. Rosenkrantz, and H. Hunt. 1998. Bicriteria network design problems. Journal of Algorithms, 28(1) 142-171