This event has ended. Create your own event → Check it out
This event has ended. Create your own
Chaired by: Nick McKeown, Stanford University; Jen Rexford, Princeton University.
Sponsored by: Netronome, Microsoft, Intel, Cisco & Barefoot Networks.
View analytic
Wednesday, November 18 • 2:45pm - 3:00pm
Packet Transactions: A Model for Data-Plane Algorithms at Hardware Speed

Sign up or log in to save this to your schedule and see who's attending!

Data-plane algorithms execute on every packet travers- ing a network switch; they encompass many schemes for congestion control, network measurement, active-queue management, and load balancing. Because these algo- rithms are implemented in hardware today, they can- not be changed after being built. To address this prob- lem, recent work has proposed designs for programmable line-rate switches. However, the languages to program them today closely resemble the underlying hardware, making them inconvenient for this purpose.

This paper presents Domino, a C-like imperative lan- guage to express data-plane algorithms. Domino intro- duces the notion of a packet transaction, defined as a sequential code block that is atomic and isolated from other such code blocks. The Domino compiler compiles Domino code to P4, an emerging language for programmable switches. We show how Domino enables several data-plane algorithms written in C syntax to run at hardware line rates.

avatar for Anirudh Sivaraman, MIT

Anirudh Sivaraman, MIT

Anirudh Sivaraman is a graduate student at MIT’s Computer Science and Artificial Intelligence Laboratory. He is broadly interested in computer networking and his recent research work is in the area of programmable forwarding planes.

Wednesday November 18, 2015 2:45pm - 3:00pm
McCaw Hall - Presentations

Attendees (3)