HotSDN '13Pub Date : 2013-08-16DOI: 10.1145/2491185.2491213
U. Kozat, Guanfeng Liang, Koray Kokten
{"title":"Verifying forwarding plane connectivity and locating link failures using static rules in software defined networks","authors":"U. Kozat, Guanfeng Liang, Koray Kokten","doi":"10.1145/2491185.2491213","DOIUrl":"https://doi.org/10.1145/2491185.2491213","url":null,"abstract":"We present efficient solutions that install static rules on the forwarding elements such that network controllers use these rules to verify topology connectivity and locate link failures. For a forwarding plane with |E| links, we verify topology connectivity using ≤ 2|E| static rules and one control message. We guarantee locating at least one link failure using ≤ 6|E| static rules and ϴ(log(|E|)) control messages. We can also detect multiple link failures in a probabilistic sense.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"27 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":"115131935","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.2491208
Yohei Kuga, Takeshi Matsuya, H. Hazeyama, Kenjiro Cho, Osamu Nakamura
{"title":"EtherPIPE: an ethernet character device for network scripting","authors":"Yohei Kuga, Takeshi Matsuya, H. Hazeyama, Kenjiro Cho, Osamu Nakamura","doi":"10.1145/2491185.2491208","DOIUrl":"https://doi.org/10.1145/2491185.2491208","url":null,"abstract":"The UNIX command tools are designed to combine simple generic commands to accomplish various complex tasks. Meanwhile, in network programming, we often end up writing many similar functions and packaging functions of all network layers to build an application. In this paper, we propose EtherPIPE, a character network I/O device, that allows the programmer to access network traffic data as a file through UNIX commands. By setting a UNIX pipe \"|\" from or to EtherPIPE's output or input with UNIX commands, packets can be easily processed, executing functions such as packet filtering, packet capturing, generating arbitrary packets, and rewriting header information. We developed a prototype of EtherPIPE as a character device driver for a commodity FPGA card. This paper argues for use cases of the EtherPIPE, and discusses enhanced formats of character devices for easier network scripting.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"56 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":"123334205","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.2491217
R. McGeer
{"title":"A correct, zero-overhead protocol for network updates","authors":"R. McGeer","doi":"10.1145/2491185.2491217","DOIUrl":"https://doi.org/10.1145/2491185.2491217","url":null,"abstract":"In this paper, we describe a new protocol for the safe up- date of OpenFlow networks. This protocol meets the packet consistency and weak flow consistency conditions, requires neither on-switch resources nor the diversion of packets to refuges during updates, and alls into the family of Trace- based update protocols. The feature of this protocol is a se- quence of per-switch rule updates. We derive a logic circuit for the update sequence, such that there exists a consistency- preserving update for the switch network if and only if the circuit is satisfiable subject to unsatisfiability of invariant violations; further, each satisfying minterm of the circuit yields a consistency-preserving update sequence.","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":"128819903","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.2491189
David Erickson
{"title":"The beacon openflow controller","authors":"David Erickson","doi":"10.1145/2491185.2491189","DOIUrl":"https://doi.org/10.1145/2491185.2491189","url":null,"abstract":"Beacon is a Java-based open source OpenFlow controller created in 2010. It has been widely used for teaching, research, and as the basis of Floodlight. This paper describes the architectural decisions and implementation that achieves three of Beacon's goals: to improve developer productivity, to provide the runtime ability to start and stop existing and new applications, and to be high performance.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"27 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":"129764664","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.2491198
S. Schmid, J. Suomela
{"title":"Exploiting locality in distributed SDN control","authors":"S. Schmid, J. Suomela","doi":"10.1145/2491185.2491198","DOIUrl":"https://doi.org/10.1145/2491185.2491198","url":null,"abstract":"Large SDN networks will be partitioned in multiple controller domains; each controller is responsible for one domain, and the controllers of adjacent domains may need to communicate to enforce global policies. This paper studies the implications of the local network view of the controllers. In particular, we establish a connection to the field of local algorithms and distributed computing, and discuss lessons for the design of a distributed control plane. We show that existing local algorithms can be used to develop efficient coordination protocols in which each controller only needs to respond to events that take place in its local neighborhood. However, while existing algorithms can be used, SDN networks also suggest a new approach to the study of locality in distributed computing. We introduce the so-called supported locality model of distributed computing. The new model is more expressive than the classical models that are commonly used in the design and analysis of distributed algorithms, and it is a better match with the features of SDN networks.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"82 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":"132049674","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.2491186
Aurojit Panda, Colin Scott, A. Ghodsi, Teemu Koponen, S. Shenker
{"title":"CAP for networks","authors":"Aurojit Panda, Colin Scott, A. Ghodsi, Teemu Koponen, S. Shenker","doi":"10.1145/2491185.2491186","DOIUrl":"https://doi.org/10.1145/2491185.2491186","url":null,"abstract":"The CAP theorem showed that it is impossible for datastore systems to achieve all three of strong consistency, availability and partition tolerance. In this paper we investigate how these trade-offs apply to software-defined networks. Specifically, we investigate network policies such as tenant isolation and middlebox traversal, and prove that it is impossible for implementations to enforce them without sacrificing availability. We conclude by distilling practical design lessons from our observations.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"77 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":"116182123","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.2491202
Mukta Gupta, J. Sommers, P. Barford
{"title":"Fast, accurate simulation for SDN prototyping","authors":"Mukta Gupta, J. Sommers, P. Barford","doi":"10.1145/2491185.2491202","DOIUrl":"https://doi.org/10.1145/2491185.2491202","url":null,"abstract":"Thorough test and evaluation of new software-defined network (SDN)-based applications and configurations present many challenges. Examples of these challenges include scaling to large networks, accuracy, and efficiency in evaluation along with the ability to easily transition between prototype and test environments. Current methods for test and evaluation include new programming languages and frameworks, debugging and static analysis techniques, and VM- and container-based emulation tools.\u0000 In this paper we describe a simulation-based tool called fs-sdn that complements and expands upon these existing approaches. Our work is designed to address the problem of prototyping and evaluating new SDN-based applications accurately, at large scale, and in a way that enables easy translation to real controller platforms like POX and NOX. We describe the design, implementation and use of fs-sdn, and demonstrate its capability by carrying out a series of experiments using fs-sdn and the Mininet platform in nearly identical configurations. We show that the measurements derived from fs-sdn are accurate compared with Mininet, but offer significant speed and scalability advantages.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"18 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":"128086221","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.2491201
Tim Nelson, Arjun Guha, Daniel J. Dougherty, Kathi Fisler, S. Krishnamurthi
{"title":"A balance of power: expressive, analyzable controller programming","authors":"Tim Nelson, Arjun Guha, Daniel J. Dougherty, Kathi Fisler, S. Krishnamurthi","doi":"10.1145/2491185.2491201","DOIUrl":"https://doi.org/10.1145/2491185.2491201","url":null,"abstract":"Configuration languages for traditional network hardware are often fairly limited and hence easy to analyze. Programmable controllers for software-defined networks are far more flexible, but this flexibility results in more opportunities for mis-configuration and greatly complicates analyses. We propose a new network-programming paradigm that strikes a balance between expressive power and analysis, providing a highly analyzable core language while allowing the re-use of pre-existing code written in more complex production languages.\u0000 As the first step we have created FlowLog, a declarative language for programming SDN controllers. We show that FlowLog is expressive enough to build some real controller programs. It is also a finite-state language, and thus amenable to many types of analysis, such as model-checking. In this paper we present FlowLog, show examples of controller programs, and discuss analyzing them.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"19 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":"129781736","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.2491197
Brandon Heller, Colin Scott, N. McKeown, S. Shenker, Andreas Wundsam, Hongyi Zeng, S. Whitlock, V. Jeyakumar, Nikhil Handigol, J. McCauley, K. Zarifis, Peyman Kazemian
{"title":"Leveraging SDN layering to systematically troubleshoot networks","authors":"Brandon Heller, Colin Scott, N. McKeown, S. Shenker, Andreas Wundsam, Hongyi Zeng, S. Whitlock, V. Jeyakumar, Nikhil Handigol, J. McCauley, K. Zarifis, Peyman Kazemian","doi":"10.1145/2491185.2491197","DOIUrl":"https://doi.org/10.1145/2491185.2491197","url":null,"abstract":"Today's networks are maintained by \"masters of complexity\": network admins who have accumulated the wisdom to troubleshoot complex problems, despite a limiting toolset. This position paper advocates a more structured troubleshooting approach that leverages architectural layering in Software-Defined Networks (SDNs). In all networks, high-level intent (policy) must correctly map to low-level forwarding behavior (hardware configuration). In SDNs, intent is explicitly expressed, forwarding semantics are explicitly defined, and each architectural layer fully specifies the behavior of the network. Building on these observations, we show how recently-developed troubleshooting tools fit into a coherent workflow that detects mistranslations between layers to precisely localize sources of errant control logic. Our goals are to explain the overall picture, show how the pieces fit together to enable a systematic workflow, and highlight the questions that remain. Once this workflow is realized, network admins can formally verify that their network is operating correctly, automatically troubleshoot bugs, and systematically track down their root cause -- freeing admins to fix problems, rather than diagnose their symptoms.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"35 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":"114283692","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.2491204
Gergely Pongrácz, László Molnár, Z. Kis, Z. Turányi
{"title":"Cheap silicon: a myth or reality? picking the right data plane hardware for software defined networking","authors":"Gergely Pongrácz, László Molnár, Z. Kis, Z. Turányi","doi":"10.1145/2491185.2491204","DOIUrl":"https://doi.org/10.1145/2491185.2491204","url":null,"abstract":"Software-Defined Networking (SDN) promises the vision of more flexible and manageable networks, but requires certain level of programmability in the data plane. Current industry insight holds that programmable network processors are of lower performance than their hard-coded counterparts, such as Ethernet chips. This represents a roadblock to SDN adoption. In this paper we argue that contrast to the common view, the overhead of programmability is relatively low. We also argue that the apparent difference between programmable and hard-coded chips today is not primarily due to programmability itself, but because the internal balance of programmable network processors is tuned to more complex use cases. These arguments are backed with calculations and real-life measurements.","PeriodicalId":445102,"journal":{"name":"HotSDN '13","volume":"15 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":"114302321","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}