<html><head><style type='text/css'>p { margin: 0; }</style></head><body><div style='font-family: arial,helvetica,sans-serif; font-size: 10pt; color: #000000'>Nayden Nedev will present his MSE thesis talk on Thursday May 2 at 1PM in <br>Room 401 (note room!). The members of his committee are: David Walker, <br>advisor, and Jennifer Rexford, reader. Everyone is invited to attend his talk.<br>His abstract follows below.<br><br>-------------------------------------------------<br><br>Title: Parallel Consistent Network Updates<br><br>Abstract:<br>Network configuration changes are a frequent operation performed by network administrators.<br>Unfortunately, these changes can result in a wide range of problems such as network outages,<br>security vulnerabilities or worse overall network performance.<br><br>A recent result in this area proposes the notion of consistent network update - an update that<br>preserves certain properties when updating from one network policy to another. The authors of the<br>mentioned work describe a per-packet consistent update algorithm that guarantees that every packet<br>in the network traverses either the old policy or the new one but not some mixture of the two.<br><br>With the advent of software-defined networking, development of centralized, tightly-coordinated<br>applications with strong global correctness properties has been made possible. However, it is an<br>open problem how to bring more parallelism to these applications and how to leverage general-purpose<br>multicore and multiprocessor machines to improve their performance. In this work, we propose two<br>parallelized versions of the per-packet consistency update mechanism. We implement them on top of<br>Floodlight - a new multi-threaded software-defined networking controller platform. We evaluate<br>their performance on two example applications - a network-wide host location learning and a <br>shortest-path routing application.<br><hr id="zwchr"><br></div></body></html>