Vijay Ramachandran

Selected Papers and Research Products

Publications

• "A Survey of Tactically Suitable Exterior Gateway Protocols"
  T. Gibbons, J. Van Hook, N. Wang, T. Shake, D. Street, and V. Ramachandran.
  In Proc. MILCOM 2013, unclassified program, pp. 487-493 (Nov 2013).
  [ Abstract ]
   
• "The Design Space of Probing Algorithms for Network-Performance Measurement"
  A. D. Jaggard, S. Kopparty, V. Ramachandran, and R. N. Wright.
  In Proc. SIGMETRICS 2013 (Jun 2013).
  [ Abstract ]
   
• "Pathsift: A Library for Separating the Effects of Protocols, Policy, and Topology on IP Routing."
  V. Ramachandran and D. Street.
  In Proc. ICST SIMUTools'12 (Mar 2012).
  [ PDF, Abstract ]
   
• "Incentive-Compatible Interdomain Routing."
  J. Feigenbaum, V. Ramachandran, and M. Schapira.
  Distributed Computing 23(5-6):301-319 (Apr 2011).
  [ PDF, Abstract ]
   
• "The Impact of Communication Models on Routing-Algorithm Convergence."
  A. D. Jaggard, V. Ramachandran, and R. N. Wright.
  In IEEE ICDCS'09, pp. 58-67 (Jun 2009).
  [ PDF (full version), Abstract ]
   
• "Rationality and Traffic Attraction: Incentives for Honest Path Announcements in BGP."
  S. Goldberg, S. Halevi, A. D. Jaggard, R. N. Wright, and V. Ramachandran.
  In Proc. ACM SIGCOMM'08, pp. 267-278 (Aug 2008).
  [ PDF (full version), Abstract ]
   
• "Resolving Inter-Domain Policy Disputes."
  C.-T. Ee, V. Ramachandran, B.-G. Chun, K. Lakshminarayanan, S. Shenker.
  In Proc. ACM SIGCOMM'07, pp. 157-168 (Aug 2007).
  [ PDF, Abstract ]
   
• "Robust Path-Vector Routing Despite Inconsistent Preferences."
  A. D. Jaggard and V. Ramachandran.
  In Proc. IEEE ICNP'06, pp. 270-279 (Nov 2006).
  [ PDF, Abstract ]
   
• "Towards the Design of Robust Inter-domain Routing Protocols."
  A. D. Jaggard and V. Ramachandran.
  IEEE Network 19(6):35-41 (Nov/Dec 2005).
  [ PDF, Abstract ]
   
• "Relating Two Formal Models of Path-Vector Routing."
  A. D. Jaggard and V. Ramachandran.
  In Proc. IEEE INFOCOM'05, vol. 1, pp. 619-630 (Mar 2005).
  [ PDF, Abstract ]
   
• "Robustness of Class-Based Path-Vector Systems."
  A. D. Jaggard and V. Ramachandran.
  In Proc. IEEE ICNP'04, pp. 84-93 (Oct 2004).
  [ PDF (full version), Abstract ]
   
• "Design Principles of Policy Languages for Path Vector Protocols."
  T. G. Griffin, A. D. Jaggard, and V. Ramachandran.
  In Proc. ACM SIGCOMM'03, pp. 61-72 (Aug 2003).
  [ PDF (full version), Abstract ]
   
• "DNA Self-Assembly for Constructing 3D Boxes."
  M.-Y. Kao and V. Ramachandran.
  In Proc. ISAAC'01, LNCS vol. 2223, pp. 429-440 (Dec 2001).
  [ PDF, Abstract ]
   
• "A Space-Efficient Randomized DNA Algorithm for k-SAT."
  K. Chen and V. Ramachandran.
  In Proc. DNA6, LNCS vol. 2054, pp. 199-208 (Jun 2000).
  [ PDF, Abstract ]
   

Technical Reports

• "Dynamic Internet Partition Healing."
  A. Keith and V. Ramachandran.
  Colgate University Technical Report TR-CS-2011-01 (latest version May 2012).
  [ PDF ]
   
• "Towards a Realistic Model of Incentives in Interdomain Routing: Decoupling Forwarding from Signaling."
  A. D. Jaggard, V. Ramachandran, and R. N. Wright.
  DIMACS Technical Report 2008-02 (Apr 2008).
  [ PDF ]
   
• "Analyzing DoS-Resistance of Protocols Using a Cost-Based Framework."
  V. Ramachandran.
  Yale University Technical Report YALE/DCS/TR1239 (Jul 2002).
  [ PDF ]
   

Position Papers

• "Agents' Privacy in Distributed Algorithmic Mechanisms."
  J. Feigenbaum, N. Nisan, V. Ramachandran, R. Sami, and S. Shenker.
  Workshop on Economics and Information Security (May 2002).
  [ PDF ]
   

Posters

• "A More Realistic Model of Incentives for Routing."
  A. D. Jaggard, V. Ramachandran, and R. N. Wright.
  2008 NSF CyberTrust PI Meeting (Mar 2008).
  [ PDF ]
   

Theses

• Foundations of Inter-Domain Routing.
  V. Ramachandran.
  Ph.D. dissertation, Department of Computer Science, Yale University (Dec 2005).
  [ PDF ]
   
• Efficient Implementations of Elliptic-Curve Cryptosystems.
  V. Ramachandran.
  A.B. thesis, Department of Mathematics, Princeton University (Jun 2000).
   

Other links

Department events

• How to be Sure that Your Vote is Counted -- Even When Everyone is Trying to Cheat
  Josh Benaloh, Microsoft Research
  Colgate NASC Colloquium, September 21, 2012
  [ YouTube ]