[PRL] Fwd: [Programming] David Walker of Princeton on Frenetic, Mon @ 4

[Sam Tobin-Hochstadt]

Anyone interested in PL and networks should check this out.


---------- Forwarded message ----------
From: Greg Morrisett <greg at eecs.harvard.edu>
Date: Sat, Apr 28, 2012 at 9:17 AM
Subject: [Programming] David Walker of Princeton on Frenetic, Mon @ 4
To: programming at eecs.harvard.edu, Systems Research At Harvard
<syrah at eecs.harvard.edu>


David Walker of Princeton Univ. will be visiting Monday
and is planning to give a talk at 4pm (room TBD).  The
title and abstract are below.

If you'd like to meet with Dave while he's here on Monday,
please let me know what times are convenient for you.

Thanks!

-Greg

Abstractions for Programming Software-Defined Networks
David Walker

Software-defined networks (SDNs) are a new kind of network
architecture in which a controller machine manages a distributed
collection of switches by instructing them to install or uninstall
packet-forwarding rules and report traffic statistics. The recently
formed Open Networking Consortium, whose members include
Google, Facebook, Microsoft, Verizon, and others, hopes to use
this architecture to transform the way that enterprise and data center
networks are implemented.  However, despite the advent of SDN,
network programming is far from easy.  Most SDN programming
models expose a low-level "assembly-like" interface to the underlying
switch hardware.  The Frenetic project, a joint venture between
Princeton and Cornell, aims to rethink how these networks are
programmed by defining new, high-level programming abstractions
for them.  By doing so, we hope to make networks easier to configure,
maintain, optimize and evolve.

In this talk, we will focus primarily on how to define new,
semantically-meaningful abstractions for updating global network
configurations.  More specifically, we introduce the idea of per-
packet and per-flow consistent updates.  These updates are guaranteed
to preserve a large class of properties, including access control,
loop-freedom, and connectivity properties, across a network update.
We have implemented a compiler and optimizer for these
abstractions, as well as a verification tool that exploits their
semantics to significantly reduce the complexity of checking
the correctness of network control software.
_______________________________________________
Programming mailing list
Programming at eecs.harvard.edu
https://lists.eecs.harvard.edu/mailman/listinfo/programming


-- 
sam th
samth at ccs.neu.edu