COSciN is a new research network connecting Cornell's main campus in Ithaca and medical campus in NYC.
Frenetic is a domain-specific programming language for software-defined networks. Distinguishing features of the language include support for modular composition operators and a careful treatment of routing and monitoring.
iSDX (Software-Defined IXP) brings the features of SDN to interdomain routing, offering direct control over packet-processing rules that match on multiple header fields and perform a variety of actions. IXPs are a compelling place to deploy these changes, given their role in interconnecting many networks and their growing importance in bringing popular content closer to end users.
NetKAT is a network programming langauge based on a solid mathematical foundation: Kleene Algebra with Tests (KAT). The langauge has a sound and complete deductive reasoning system and a decision procedure that can be used to address many practical verification problems.
|Date||March 14, 2017|
|Title||SNAP: Stateful Network-Wide Abstractions for Packet Processing|
Early programming languages for software-defined networking (SDN) were built on top of the simple match- action paradigm offered by OpenFlow 1.0. However, emerging hardware and software switches offer much more sophisticated support for persistent state in the data plane, without involving a central controller. Nevertheless, managing stateful, distributed systems efficiently and correctly is known to be one of the most challenging programming problems. To simplify this new SDN problem, we introduce SNAP.
SNAP offers a simpler "centralized" stateful programming model, by allowing programmers to develop programs on top of one big switch rather than many. These programs may contain reads and writes to global, persistent arrays, and as a result, programmers can implement a broad range of applications, from stateful firewalls to fine-grained traffic monitoring. The SNAP compiler relieves programmers of having to worry about how to distribute, place, and optimize access to these stateful arrays by doing it all for them. More specifically, the compiler discovers read/write dependencies between arrays and translates one-big-switch programs into an efficient internal representation based on a novel variant of binary decision diagrams. This internal representation is used to construct a mixed-integer linear program, which jointly optimizes the placement of state and the routing of traffic across the underlying physical topology. We have implemented a prototype compiler and applied it to about 20 SNAP programs over various topologies to demonstrate our techniques’ scalability.
Mina is a third-year PhD student in Computer Science at Princeton University, advised by Jennifer Rexford. Her research focuses on designing high-level abstractions for network programming and management, specifically in software defined networks (SDNs).
Nate Foster (Cornell)
Deborah Estrin (Cornell Tech)
|Session on Programming Languages and Verification|
Moderator: Nate Foster
|9:30am||Maslow’s hierarchy of network programming and the unmet needs |
Ratul Mahajan (Microsoft)
|10:00am||Efficient Programming Abstractions for Software Defined Networks |
Steffen Smolka (Cornell)
|10:15am||Propane: Programming Distributed Control Planes |
Ryan Beckett (Princeton)
|11:00am||Network Verification and Synthesis: Lessons from Hardware (and Software) Verification and Synthesis |
Sharad Malik (Princeton)
|11:15am||Probabilistic Network Verification |
Dexter Kozen (Cornell)
Alex Gurney (Comcast), Andrew Ferguson (Google), David Stern (DISA), and Sanjai Narain (Applied Communication Sciences)
|Session on Programmable Data Planes and Applications|
Moderator: Jennifer Rexford
|1:30pm||Converging Approaches in Software Switches |
Ben Pfaff (VMware)
|2:00pm||SNAP: Stateful Network-Wide Abstractions for Packet Processing |
Mina Tahmasbi Arashloo (Princeton)
|2:15pm||Globally Synchronized Time via Datacenter Networks |
Hakim Weatherspoon (Cornell)
|2:30pm||iSDX: An Industrial-Scale Software Defined Internet Exchange Point |
Nick Feamster (Princeton)
Brad Spiers (Micron), Ken Duell (AT&T), John Marshall (Cisco), Yi Wang (Huawei), and Walter Willinger (Niksun)
|Session on Routing and Performance|
Moderator: Nick Feamster
|3:45pm||Real-Time Adaptive Network Traffic Management|
Kevin Tang (Cornell)
|4:00pm||Robust Traffic Engineering using Semi-Oblivious Routing |
Praveen Kumar (Cornell)
|4:15pm||Universal Networking Mechanisms|
Rachit Agarwal (Cornell)
|4:30pm||Panel Discussion |
Douglas Montgomery (NIST), Gagan Choudhury (AT&T), Igor Gashinsky (Yahoo!), Kalyani Bogineni (Verizon), and Nithin Michael (Waltz Networks)
Jennifer Rexford (Princeton)
|6:30pm||Dinner at Dos Caminos SoHo (475 W Broadway St at Houston St)|
111 8th Avenue #302 New York, NY 10011
The visitor entrance to the building is at the intersection of 8th Avenue and West 15th Street. You will need to present some form of identification.
If you are taking the subway, the A, C, E, and L trains have a subway stop inside the building (14th Street stop). The 1, 2, and 3 trains are a little over a block away at West 14th and 7th Avenue (14th Street stop).