BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY: From EDA to NDA: Treating Networks like Hardware Circuits - Georg
 e Varghese - Microsoft Research
DTSTART:20160712T123000Z
DTEND:20160712T133000Z
UID:TALK66660@talks.cam.ac.uk
CONTACT:David Greaves
DESCRIPTION: Surveys reveal that network outages are prevalent\, and outag
 es take hours to resolve\, resulting in significant lost revenue.  We sugg
 est fresh approaches based on verification and synthesis.\nFirst\, I show 
 how to exploit physical symmetry to scale network verification for large d
 ata centers. While Emerson and Sistla showed how to exploit symmetry for m
 odel checking in 1996\, they exploited symmetry on the logical Kripke stru
 cture.  We factor the symmetries into symmetries on headers and symmetries
  on the physical topology.\nI will then describe work we have done in synt
 hesis.   I will set the stage by describing a reconfigurable router archit
 ecture called RMT and an emerging language for programming routers called 
 P4 (that promises to extend the boundaries of Software Designed Networks).
   We have worked on two synthesis efforts for flexible routers\, one akin 
 to register allocation (table layout) and one akin to code generation (pac
 ket transactions).  I will focus especially on code generation and show th
 at the all-or-nothing compilation required for wire-speed forwarding requi
 res adapting standard compiler techniques.\nThese results suggest that con
 cepts from Electronic Design Automation (EDA) can be leveraged to create w
 hat might be termed Network Design Automation (NDA).   I end by briefly ex
 ploring this vision. This is joint work with collaborators at Edinburgh\, 
 MSR\, MIT\, Stanford\, and University of Washington.\n\nBIOGRAPHY: George 
 Varghese received his Ph.D. in 1992 from MIT. From 1993-1999\, he was a pr
 ofessor at Washington University\, and at UCSD from 1999 to 2013. He was t
 he Distinguished Visitor in the computer science department at Stanford Un
 iversity from 2010-2011. He joined Microsoft Research in 2012.    His book
  "Network Algorithmics" was published in December 2004 by Morgan-Kaufman. 
 In May 2004\, he co-founded NetSift\, which was acquired by Cisco Systems 
 in 2005. With colleagues\, he has won best paper awards at SIGCOMM (2014)\
 , ANCS (2013)\, OSDI (2008)\, PODC (1996)\, and the IETF Applied Networkin
 g Prize (2013). He has won lifetime awards in networking from the EE (Koba
 yashi Award) and CS communities (SIGCOMM) in 2014.
LOCATION:Lecture Theatre 2\, Computer Laboratory
END:VEVENT
END:VCALENDAR