SCS Lecture - Network Verification and Synthesis - When Hoare Meets Cerf - Dr. George Varghese

Event Details
  • Date/Time:
    • Thursday December 3, 2015
      3:00 pm - 4:00 pm
  • Location: Marcus Nano Building - Rooms 1116-1117
  • Phone:
  • URL: http://ien.gatech.edu/
  • Email:
  • Fee(s):
    0.00
  • Extras:
Contact

Joy West

jwest62@cc.gatech.edu

Summaries

Summary Sentence: SCS Lecture Series - Network Verification and Synthesis - When Hoare Meets Cerf - Dr. George Varghese

Full Summary: No summary paragraph submitted.

Media
  • George Varghese George Varghese
    (image/jpeg)

Talk Topic:  Network Verification and Synthesis - When Hoare Meets Cerf

Speaker:  George Varghese, Ph.D. Principal Researcher and Partner at Microsoft Research


ABSTRACT: 

Surveys reveal that network outages are prevalent, and that many outages take hours to resolve, resulting in significant lost revenue. Many bugs are caused by errors in configuration files which are programmed using arcane, low-level languages, akin to machine code. Taking our cue from program and hardware verification, we suggest fresh approaches.

I will first describe a geometric model of network forwarding called Header Space. While header space analysis is similar to finite state machine verification, we exploit domain-specific structure to scale better than off-the shelf model checkers.   Next, I show how to exploit physical symmetry to scale network verification for large data centers. While Emerson and Sistla showed how to exploit symmetry for model checking in 1996, they exploited symmetry on the logical Kripke structure.

 

While the first part of the talk is about analysis, I will then describe our work in synthesis.   I will set the stage by describing a reconfigurable router architecture called RMT and an emerging language for programming routers called P4 that promises to extend the boundaries of Software Designed Networks. I will then describe two synthesis efforts for flexible routers, one akin to register allocation (table layout) and one akin to code generation (packet transactions).  (With collaborators at Edinburgh, MSR, MIT, Stanford, and University of Washington.)


BIO:

George Varghese received his Ph.D. in 1992 from MIT. From 1993-1999, he was a professor at Washington University, and at UCSD from 1999 to 2013. He was the Distinguished Visitor in the computer science department at Stanford University 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 Networking Prize (2013). He won the Kobayashi Award and the SIGCOMM Lifetime Award, both in 2014, and the IIT Bombay Distinguished Alumni Award in 2015. 

Additional Information

In Campus Calendar
Yes
Groups

College of Computing, School of Computer Science

Invited Audience
Undergraduate students, Faculty/Staff, Public, Graduate students
Categories
Seminar/Lecture/Colloquium
Keywords
College of Computing, Georgia Tech, School of Computer Science
Status
  • Created By: Birney Robert
  • Workflow Status: Published
  • Created On: Nov 24, 2015 - 11:04am
  • Last Updated: Apr 13, 2017 - 5:17pm