HotSDN '13Pub Date : 2013-08-16DOI: 10.1145/2491185.2491199
D. Kreutz, Fernando M. V. Ramos, P. Veríssimo
{"title":"Towards secure and dependable software-defined networks","authors":"D. Kreutz, Fernando M. V. Ramos, P. Veríssimo","doi":"10.1145/2491185.2491199","DOIUrl":"https://doi.org/10.1145/2491185.2491199","url":null,"abstract":"Software-defined networking empowers network operators with more flexibility to program their networks. With SDN, network management moves from codifying functionality in terms of low-level device configurations to building software that facilitates network management and debugging. By separating the complexity of state distribution from network specification, SDN provides new ways to solve long-standing problems in networking --- routing, for instance --- while simultaneously allowing the use of security and dependability techniques, such as access control or multi-path.\u0000 However, the security and dependability of the SDN itself is still an open issue. In this position paper we argue for the need to build secure and dependable SDNs by design. As a first step in this direction we describe several threat vectors that may enable the exploit of SDN vulnerabilities. We then sketch the design of a secure and dependable SDN control platform as a materialization of the concept here advocated. We hope that this paper will trigger discussions in the SDN community around these issues and serve as a catalyser to join efforts from the networking and security & dependability communities in the ultimate goal of building resilient control planes.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"349 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124301789","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
HotSDN '13Pub Date : 2013-08-16DOI: 10.1145/2491185.2491222
Kevin Benton, L. Camp, Chris Small
{"title":"OpenFlow vulnerability assessment","authors":"Kevin Benton, L. Camp, Chris Small","doi":"10.1145/2491185.2491222","DOIUrl":"https://doi.org/10.1145/2491185.2491222","url":null,"abstract":"We provide a brief overview of the vulnerabilities present in the OpenFlow protocol as it is currently deployed by hardware and software vendors. We identify a widespread failure to adopt TLS for the OpenFlow control channel by both controller and switch vendors, leaving OpenFlow vulnerable to man-in-the-middle attacks. We also highlight the classes of vulnerabilities that emerge from the separation and centralization of the control plane in OpenFlow network designs. Finally, we offer suggestions for future work to address these vulnerabilities in a systematic fashion.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132286190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
HotSDN '13Pub Date : 2013-08-16DOI: 10.1145/2491185.2491188
D. Huang, K. Yocum, A. Snoeren
{"title":"High-fidelity switch models for software-defined network emulation","authors":"D. Huang, K. Yocum, A. Snoeren","doi":"10.1145/2491185.2491188","DOIUrl":"https://doi.org/10.1145/2491185.2491188","url":null,"abstract":"Software defined networks (SDNs) depart from traditional network architectures by explicitly allowing third-party software access to the network's control plane. Thus, SDN protocols such as OpenFlow give network operators the ability to innovate by authoring or buying network controller software independent of the hardware. However, this split design can make planning and designing large SDNs even more challenging than traditional networks. While existing network emulators allow operators to ascertain the behavior of traditional networks when subjected to a given workload, we find that current approaches fail to account for significant vendor-specific artifacts in the SDN switch control path. We benchmark OpenFlow-enabled switches from three vendors and illustrate how differences in their implementation dramatically impact latency and throughput. We present a measurement methodology and emulator extension to reproduce these control-path performance artifacts, restoring the fidelity of emulation.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133708300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
HotSDN '13Pub Date : 2013-08-16DOI: 10.1145/2491185.2491193
A. Dixit, F. Hao, S. Mukherjee, T. V. Lakshman, R. Kompella
{"title":"Towards an elastic distributed SDN controller","authors":"A. Dixit, F. Hao, S. Mukherjee, T. V. Lakshman, R. Kompella","doi":"10.1145/2491185.2491193","DOIUrl":"https://doi.org/10.1145/2491185.2491193","url":null,"abstract":"Distributed controllers have been proposed for Software Defined Networking to address the issues of scalability and reliability that a centralized controller suffers from. One key limitation of the distributed controllers is that the mapping between a switch and a controller is statically configured, which may result in uneven load distribution among the controllers. To address this problem, we propose ElastiCon, an elastic distributed controller architecture in which the controller pool is dynamically grown or shrunk according to traffic conditions and the load is dynamically shifted across controllers. We propose a novel switch migration protocol for enabling such load shifting, which conforms with the Openflow standard. We also build a prototype to demonstrate the efficacy of our design.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127787080","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
HotSDN '13Pub Date : 2013-08-16DOI: 10.1145/2491185.2491223
M. B. Anwer, Theophilus A. Benson, N. Feamster, Dave Levin, J. Rexford
{"title":"A slick control plane for network middleboxes","authors":"M. B. Anwer, Theophilus A. Benson, N. Feamster, Dave Levin, J. Rexford","doi":"10.1145/2491185.2491223","DOIUrl":"https://doi.org/10.1145/2491185.2491223","url":null,"abstract":"There is an increasing desire for programs running at a controller to be able to invoke a rich set of matches and actions that span both the control and data planes. Yet, there is no holistic means to do so. While OpenFlow provides a rich, programmable control plane, it has a fixed/narrow data plane; conversely, although middleboxes, a common way to augment the data plane, provide a sophisticated data plane, they do not integrate well with the control plane in that they do not support a similar match/action interface and they do not inform the controller of in-network events. We envision three broad ways to provide richer matches and actions:","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124583954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
HotSDN '13Pub Date : 2013-08-16DOI: 10.1145/2491185.2491218
Maciej Kuźniar, Peter Perešíni, N. Vasic, M. Canini, Dejan Kostic
{"title":"Automatic failure recovery for software-defined networks","authors":"Maciej Kuźniar, Peter Perešíni, N. Vasic, M. Canini, Dejan Kostic","doi":"10.1145/2491185.2491218","DOIUrl":"https://doi.org/10.1145/2491185.2491218","url":null,"abstract":"Tolerating and recovering from link and switch failures are fundamental requirements of most networks, including Software-Defined Networks (SDNs). However, instead of traditional behaviors such as network-wide routing re-convergence, failure recovery in an SDN is determined by the specific software logic running at the controller. While this admits more freedom to respond to a failure event, it ultimately means that each controller application must include its own recovery logic, which makes the code more difficult to write and potentially more error-prone.\u0000 In this paper, we propose a runtime system that automates failure recovery and enables network developers to write simpler, failure-agnostic code. To this end, upon detecting a failure, our approach first spawns a new controller instance that runs in an emulated environment consisting of the network topology excluding the failed elements. Then, it quickly replays inputs observed by the controller before the failure occurred, leading the emulated network into the forwarding state that accounts for the failed elements. Finally, it recovers the network by installing the difference ruleset between emulated and current forwarding states.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131182971","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
HotSDN '13Pub Date : 2013-08-16DOI: 10.1145/2491185.2491206
Dan Williams, H. Jamjoom
{"title":"Cementing high availability in openflow with RuleBricks","authors":"Dan Williams, H. Jamjoom","doi":"10.1145/2491185.2491206","DOIUrl":"https://doi.org/10.1145/2491185.2491206","url":null,"abstract":"Controller applications in OpenFlow cannot be trivially augmented to support the various high availability (or failure recovery) models of server applications. Recent work on OpenFlow has largely assumed static replica configurations or has relied on controller developers to embed high availability support in their design. Instead, we present RuleBricks, a system for flexibly embedding high availability support in existing OpenFlow policies. RuleBricks introduces three key primitives: drop, insert, and reduce. We describe how these primitives can express various flow assignment and backup policies, demonstrating the one offered by the Chord protocol. We have implemented RuleBricks and the Chord assignment policy. Using simulation, we compare RuleBricks against a typical tree-based approach. We show that RuleBricks maintains linear scalability with the number of replicas on the Chord ring.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115710191","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
HotSDN '13Pub Date : 2013-08-16DOI: 10.1145/2491185.2491209
H. Pan, Hongtao Guan, Junjie Liu, W. Ding, Chengyong Lin, Gaogang Xie
{"title":"The FlowAdapter: enable flexible multi-table processing on legacy hardware","authors":"H. Pan, Hongtao Guan, Junjie Liu, W. Ding, Chengyong Lin, Gaogang Xie","doi":"10.1145/2491185.2491209","DOIUrl":"https://doi.org/10.1145/2491185.2491209","url":null,"abstract":"OpenFlow is one of the most potential technique to enable innovation in network. To enable OpenFlow more flexibility and high-efficiency, multi-table pipeline has been introduced in OpenFlow. A HAL(Hardware Abstraction Layer) is proposed to address the incompatibility of flow table pipeline between legacy switch hardware and the controller. However, the burden of controller will be increased greatly. In this paper, an innovative middle layer called FlowAdapter is proposed. It converts flow entry rules from the controller flow table pipeline to switch hardware flow table pipeline, so that the same rules can be fitted into different types of hardware. With FlowAdapter, legacy OpenFlow hardware can be used to support multi-table pipeline rules. Located in switch, FlowAdapter is transparent to the controller. With a prototype implementation, we find that the FlowAdapter performs rules conversion effectively.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122514003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
HotSDN '13Pub Date : 2013-08-16DOI: 10.1145/2491185.2491205
Peter Perešíni, Maciej Kuźniar, N. Vasic, M. Canini, Dejan Kostic
{"title":"OF.CPP: consistent packet processing for openflow","authors":"Peter Perešíni, Maciej Kuźniar, N. Vasic, M. Canini, Dejan Kostic","doi":"10.1145/2491185.2491205","DOIUrl":"https://doi.org/10.1145/2491185.2491205","url":null,"abstract":"This paper demonstrates a new class of bugs that is likely to occur in enterprise OpenFlow deployments. In particular, step-by-step, reactive establishment of paths can cause network-wide inconsistencies or performance- and space-related inefficiencies. The cause for this behavior is inconsistent packet processing: as the packets travel through the network they do not encounter consistent state at the OpenFlow controller. To mitigate this problem, we propose to use transactional semantics at the controller to achieve consistent packet processing. We detail the challenges in achieving this goal (including the inability to directly apply database techniques), as well as a potentially promising approach. In particular, we envision the use of multi-commit transactions that could provide the necessary serialization and isolation properties without excessively reducing network performance.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121077296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
HotSDN '13Pub Date : 2013-08-16DOI: 10.1145/2491185.2491219
Kirill Kogan, S. Nikolenko, W. Culhane, P. Eugster, Eddie Ruan
{"title":"Towards efficient implementation of packet classifiers in SDN/OpenFlow","authors":"Kirill Kogan, S. Nikolenko, W. Culhane, P. Eugster, Eddie Ruan","doi":"10.1145/2491185.2491219","DOIUrl":"https://doi.org/10.1145/2491185.2491219","url":null,"abstract":"Traffic classification is a core problem underlying efficient implementation of network services. In this work we draw from our experience in classifier design for commercial systems to address this problem in SDN and OpenFlow. We identify methods from other fields of computer science and show research directions that can be applied for efficient design of packet classifiers. Proposed abstractions and design patterns can significantly reduce requirements on network elements and enable deployment of functionality that would be infeasible in a traditional way.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"11 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130467305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}