TY - GEN
T1 - Abstractions for network update
AU - Reitblatt, Mark
AU - Foster, Nate
AU - Rexford, Jennifer L.
AU - Schlesinger, Cole
AU - Walker, David P.
PY - 2012
Y1 - 2012
N2 - Configuration changes are a common source of instabilily in networks, leading to outages, performance disruptions, and security vulnerabilities. Even when the initial and final configurations are correct, the update process itself often steps through intermediate configurations that exhibit incorrect behaviors. This paper introduces the notion of consistent network updates-updates that are guaranteed to preserve well-defined behaviors when transitioning between configurations. We identify two distinct consistency levels, per-packet and per-flow, and we present general mechanisms f°r implementing them in Software-Defined Networks using switch APIs like OpenFlow. We develop a formal model of OpenFlow net- w°rks, and prove that consistent updates preserve a large class of properties. We describe our prototype implementation, including several optimizations that reduce the overhead required to perform consistent updates. We present a verification tool that leverages consistent updates to significantly reduce the complexity of check- in8 the correctness of network control software. Finally, we describe the results of some simple experiments demonstrating the effectiveness of these optimizations on example applications.
AB - Configuration changes are a common source of instabilily in networks, leading to outages, performance disruptions, and security vulnerabilities. Even when the initial and final configurations are correct, the update process itself often steps through intermediate configurations that exhibit incorrect behaviors. This paper introduces the notion of consistent network updates-updates that are guaranteed to preserve well-defined behaviors when transitioning between configurations. We identify two distinct consistency levels, per-packet and per-flow, and we present general mechanisms f°r implementing them in Software-Defined Networks using switch APIs like OpenFlow. We develop a formal model of OpenFlow net- w°rks, and prove that consistent updates preserve a large class of properties. We describe our prototype implementation, including several optimizations that reduce the overhead required to perform consistent updates. We present a verification tool that leverages consistent updates to significantly reduce the complexity of check- in8 the correctness of network control software. Finally, we describe the results of some simple experiments demonstrating the effectiveness of these optimizations on example applications.
KW - Consistency
KW - Network programming languages. frenetic
KW - Open- flow
KW - Planned change
KW - Software-defined networking
UR - http://www.scopus.com/inward/record.url?scp=84894520570&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84894520570&partnerID=8YFLogxK
U2 - 10.1145/2377677.2377748
DO - 10.1145/2377677.2377748
M3 - Conference contribution
AN - SCOPUS:84894520570
SN - 9781450314190
T3 - Computer Communication Review
SP - 323
EP - 334
BT - Proceedings of the ACM SIGCOMM 2012 and Best Papers of the Co-located Workshops
T2 - Annual Conference of the ACM Special Interest Group on Data Communication on the Applications, Technologies, Architectures, and Protocols for Computer Communication, ACM SIGCOMM 2012
Y2 - 13 August 2012 through 17 August 2012
ER -