TY - GEN
T1 - Incremental update for a compositional SDN hypervisor
AU - Jin, Xin
AU - Rexford, Jennifer L.
AU - Walker, David P.
PY - 2014
Y1 - 2014
N2 - To realize the vision of SDN - -an "app store" for network-management services - -we need a way to compose applications developed for different controller platforms. For instance, an enterprise may want to combine a firewall written on OpenDaylight with a load balancer on Ryu and a monitoring application on Floodlight. To make this vision a reality, we propose a new kind of hypervisor that allows multiple applications to collaborate in processing the same traffic. Inspired by past work on Frenetic, our hypervisor supports a flexible configuration language that can combine packet-processing rules from different applications using sequential and parallel composition. A major challenge is efficiently combining updates to each prioritized list of OpenFlow rules, based on the hypervisor policy. Our key insight is that rule priorities form a convenient algebra that allows the hypervisor to compute the correct relative priorities of new rules incrementally, without shifting or rewriting the priorities of existing rules. We prove the correctness of our algorithms and show experimentally that these techniques can reduce computational overhead by 4X and the number of rule updates by 5X, compared to existing techniques.
AB - To realize the vision of SDN - -an "app store" for network-management services - -we need a way to compose applications developed for different controller platforms. For instance, an enterprise may want to combine a firewall written on OpenDaylight with a load balancer on Ryu and a monitoring application on Floodlight. To make this vision a reality, we propose a new kind of hypervisor that allows multiple applications to collaborate in processing the same traffic. Inspired by past work on Frenetic, our hypervisor supports a flexible configuration language that can combine packet-processing rules from different applications using sequential and parallel composition. A major challenge is efficiently combining updates to each prioritized list of OpenFlow rules, based on the hypervisor policy. Our key insight is that rule priorities form a convenient algebra that allows the hypervisor to compute the correct relative priorities of new rules incrementally, without shifting or rewriting the priorities of existing rules. We prove the correctness of our algorithms and show experimentally that these techniques can reduce computational overhead by 4X and the number of rule updates by 5X, compared to existing techniques.
KW - composition
KW - hypervisor
KW - network update
KW - network virtualization
KW - software-defined networking
UR - http://www.scopus.com/inward/record.url?scp=84907010281&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84907010281&partnerID=8YFLogxK
U2 - 10.1145/2620728.2620731
DO - 10.1145/2620728.2620731
M3 - Conference contribution
AN - SCOPUS:84907010281
SN - 9781450329897
T3 - HotSDN 2014 - Proceedings of the ACM SIGCOMM 2014 Workshop on Hot Topics in Software Defined Networking
SP - 187
EP - 192
BT - HotSDN 2014 - Proceedings of the ACM SIGCOMM 2014 Workshop on Hot Topics in Software Defined Networking
PB - Association for Computing Machinery
T2 - 3rd ACM SIGCOMM 2014 Workshop on Hot Topics in Software Defined Networking, HotSDN 2014
Y2 - 22 August 2014 through 22 August 2014
ER -