Vijay Ramachandran

Back to Directory

Vijay Ramachandran

Associate Professor of Computer Science

Department/Office Information

Computer Science


PhD (2005), MPhil (2003), MS (2001) in computer science, Yale University;
AB (2000) in mathematics, Princeton University 

Visiting researcher at DIMACS / Rutgers University, New Brunswick, NJ
Postdoc at DIMACS / Stevens Institute of Technology, Hoboken, NJ
Postdoc at International Computer Science Institute (ICSI), Berkeley, CA 

Chair, Department of Computer Science, Colgate University (2015-2018)

Department of Defense NDSEG Fellowship (2001-2004)
CT InfoTech Scholarship (2001)
NSF Graduate Fellowship Honorable Mention (2001)
1st place winner, AT&T Student Research Day (1999)

External funding / Grants awarded for research:

  • Mitigating Exploits of the Current Interdomain Routing Infrastructure, NSF (2007-2011)
  • Nettle: Automated Configuration from High-Level Specifications, DARPA (2007-2010)
  • Transformational IP Routing for Navy Afloat Networks, ONR (2008-2011)
  • Tactical-Edge Interdomain Routing Protocol Development, ASD(R&E) funded collaboration with MIT-Lincoln Laboratory (2012-2013)

Algorithmic foundations of the Internet, specifically applied to: routing protocols; design and analysis of network management and configuration methods 

Selected publications are listed below. Also see a complete list and links to abstracts, complete citations, and papers for download.

  • "Balancing Overhead-Minimization Objectives in Network Probing-Path Selection", ISCC 2017 (co-authored with student researchers) 
  • "A Survey of Tactically Suitable Exterior Gateway Protocols," MILCOM 2013
  • "The Design Space of Probing Algorithms for Network-Performance Measurement," SIGMETRICS 2013 (co-authored with a student researcher)
  • "Pathsift: A Library for Separating the Effects of Topology, Policy, and Protocols on IP Routing," SIMUTools 2012
  • "Incentive-Compatible Interdomain Routing," Distributed Computing 23(5-6), 2011
  • "The Impact of Communication Models on Routing-Algorithm Convergence," ICDCS 2009
  • "Rationality and Traffic Attraction: Incentives for Honest Path Announcements in BGP," SIGCOMM 2008
  • "Resolving Inter-Domain Policy Disputes," SIGCOMM 2007
  • "Robust Path-Vector Routing Despite Inconsistent Preferences," ICNP 2006
  • "Relating Two Formal Models of Path-Vector Routing," INFOCOM 2005
  • "Robustness of Class-Based Path-Vector Systems," ICNP 2004
  • "Design Principles of Policy Languages for Path Vector Protocols," SIGCOMM 2003

Algorithms, data structures, computer networking, economics and computation 

  • COSC 101: Introduction to Computing I (Fall 2015, Spring 2017)
  • COSC 102: Introduction to Computing II (Spring and Fall 2016, Fall 2017, Spring 2018)
  • COSC 290: Discrete Structures (Spring 2017)
  • COSC 302: Analysis of Algorithms (Spring 2013, 2014)
  • COSC 480/491: Economics and Computation (Fall 2013, Indp. study Fall 2015)
  • CORE/FSEM: Technologies for Electronic Commerce
  • UNST 210: Innovation in the Digital Age (Spring 2016)
  • UNST 360: Technology and Disruption (Spring 2013)