DIMACS/DyDAn Workshop on Secure Internet Routing

March 24 - 26, 2008
DIMACS/DyDAn Center, CoRE Building, Rutgers University

Organizers:
Steve Bellovin, Columbia University, smb at cs.columbia.edu
Nick Feamster, Georgia Institute of Technology, feamster at cc.gatech.edu
Vijay Ramachandran, Colgate University/DIMACS, vijayr at cs.colgate.edu
Presented under the auspices of the DIMACS Special Focus on Algorithmic Foundations of the Internet, the DIMACS Special Focus on Communication Security and Information Privacy and the Center for Dynamic Data Analysis (DyDAn).

Workshop Program:

This is a preliminary program.

Monday, March 24, 2008

 8:45 -  9:30  Breakfast and Registration

 9:30 -  9:45  Welcome and Opening Remarks
               Rebecca Wright, DIMACS Deputy Director

 9:45 - 10:45  Overview of the Secure Interdomain Routing Problem, S-BGP, and soBGP
               Steven Bellovin, Columbia University

10:45 - 11:15  Discussion / Break

11:15 - 12:00  Autonomous Security for Autonomous Systems
               Josh Karlin, University of New Mexico
                     
12:00 -  1:00  Lunch

 1:00 -  2:00  Ongoing work of the IETF Secure Interdomain Routing Group (SIDR)
               Sandy Murphy    

 2:00 -  3:00  Routing in the Global Information Grid (GIG)
               Dow Street, Linquest

 3:00 -  3:30  Discussion / break

 3:30 -  4:15  Panel Discussion on "Priorities for Future Research on Secure Routing"
               John Ioannidis, Sandy Murphy, Dow Street
               Vijay Ramachandran (moderator)

Tuesday, March 25, 2008
 
 8:45 -  9:30  Breakfast and Registration

 9:30 - 10:15  Attacker Models for Routing in Ad-Hoc Networks
	       Jared Cordasco, Stevens Institute of Technology

10:15 - 11:00  An Attacker Model for MANET Routing Security
               Andrew Curtis, University of Waterloo

11:00 - 11:15  Break

11:15 - 12:00  Instability Free Routing: Beyond One Protocol Instance
               Franck Le, Carnegie Mellon University

12:00 -  1:00  Lunch

 1:00 -  2:00  Modeling and Understanding Policy Interaction in BGP: The Stable Paths 
               Problem (SPP) and the Fractional Stable Paths Problem (FSPP)
               Gordon Wilfong, Lucent

 2:00 -  2:45  A Distributed Protocol for Fractional Stable Paths Problem
               Shiva Kintali, Georgia Tech

 2:45 -  3:15  Discussion / break

 3:15 -  4:15  Spam and its Impact on Routing
               Nick Feamster, Georgia Tech

 4:15 -  4:45  The complexity of game dynamics: BGP oscillations, sink equlibria, and beyond
               Alex Fabrikant, UC Berkeley

 5:00 -  6:30  Dinner 

Wednesday, March 26, 2008

 8:45 -  9:30  Breakfast and Registration
 
 9:30 - 10:30  Distributed Algorithmic Mechanism Design: Rational Behavior in Routing
               Rahul Sami, University of Michigan at Ann Arbor 

10:30 - 11:00  Discussion / Break

11:00 - 12:00  Interdomain Routing and Games
               Michael Schapira, Hebrew University 
                     
12:00 -  1:00  Lunch

 1:00 -  1:45  Removing the Incentive to Lie about Paths in BGP with Traffic Attraction
               Sharon Goldberg, Princeton University

 1:45 -  2:30  Towards a Realistic Model of Incentives in Interdomain Routing:  
               Decoupling Forwarding from Signaling
               Aaron D. Jaggard, DIMACS

 2:30 -  3:00  Discussion / break

 3:00 -  4:00  Secure Internet Path-Quality Monitoring: Tradeoffs in
               Security and Efficiency
               David Xiao, Princeton University
 
 4:00 -  4:15  Wrap-up 



Previous: Participation
Next: Registration
Workshop Index
DIMACS Homepage
Contacting the Center
Document last modified on March 27, 2008.