Paper Info
Title
A safe, efficient update protocol for openflow networks
Abstract
We describe a new protocol for update of OpenFlow networks, which has the packet consistency condition of [?] and a weak form of the flow consistency condition of [?]. The protocol conserves switch resources, particularly TCAM space, by ensuring that only a single set of rules is present on a switch at any time. The protocol exploits the identity of switch rules with Boolean functions, and the ability of any switch to send packets to a controller for routing. When a network changes from one ruleset (ruleset 1) to another (ruleset 2), the packets affected by the change are computed, and are sent to the controller. When all switches have been updated to send affected packets to the controller, ruleset 2 is sent to the switches and packets sent to the controller are re-released into the network.
Year
DOI
Venue
2012
10.1145/2342441.2342454
HotSDN@SIGCOMM
Keywords
Field
DocType
boolean function,openflow network,new protocol,switch rule,single set,protocol conserve,packet consistency condition,tcam space,flow consistency condition,efficient update protocol,network change,openflow,logic synthesis
Logic synthesis,Boolean function,Control theory,Content-addressable memory,Computer science,Network packet,Computer network,Exploit,OpenFlow,Distributed computing
Conference
Citations 
PageRank 
References 
21
1.36
15
Authors
1
Name
Order
Citations
PageRank
Rick McGeer114421.24