发布求助
文献互助 智能选刊 最新文献

Proceedings of the third workshop on Hot topics in software defined networking最新文献

筛选
英文 中文
A resource delegation framework for software defined networks 一个用于软件定义网络的资源委派框架
Proceedings of the third workshop on Hot topics in software defined networking Pub Date : 2014-08-22 DOI: 10.1145/2620728.2620737
I. Baldin, Shu Huang, Rajesh Gopidi
{"title":"A resource delegation framework for software defined networks","authors":"I. Baldin, Shu Huang, Rajesh Gopidi","doi":"10.1145/2620728.2620737","DOIUrl":"https://doi.org/10.1145/2620728.2620737","url":null,"abstract":"In this paper we address the problem of multi-domain multi-provider SDN-based networks and propose an architecture for controlling them using a collection of agents responsible for ownership and use of SDN resources. Instead of posing the problem in terms of controller coordination for the purpose of establishing connections across the network, we propose to treat it as a resource-management problem with explicit delegations of consumable resources by domains to the users of those resources. The advantage of our approach is in explicitly exposing the resource delegation abstraction. It exposes the control of network elements in different domains by different controllers and permits generalizing several existing multi-domain architectures, making the selection of which one to apply a deployment choice, rather than an architectural principle. We propose a rigorous algebraic formulation for the SDN resource delegation problem and describe the prototyping work in implementing this framework and some of its applications.","PeriodicalId":309136,"journal":{"name":"Proceedings of the third workshop on Hot topics in software defined networking","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129857596","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}
引用次数: 9
Five nines of southbound reliability in software-defined networks 软件定义网络南向可靠性的五个九
Proceedings of the third workshop on Hot topics in software defined networking Pub Date : 2014-08-22 DOI: 10.1145/2620728.2620752
Francisco J. Ros, P. M. Ruiz
{"title":"Five nines of southbound reliability in software-defined networks","authors":"Francisco J. Ros, P. M. Ruiz","doi":"10.1145/2620728.2620752","DOIUrl":"https://doi.org/10.1145/2620728.2620752","url":null,"abstract":"In order to deploy fault-tolerant Software-Defined Networks (SDN), the logically centralized controller must be physically distributed among different devices. In this paper, we present our initial work on determining how many controllers need to be instantiated, where they must be deployed, and what network nodes are under control of each of them, in order to achieve at least five nines reliability in the southbound interface between controllers and nodes. For this, we introduce the Fault Tolerant Controller Placement problem and develop a heuristic algorithm that computes placements with (at least) the required reliability. We run such algorithm on a set of 124 publicly available network topologies. We find that each node is required to connect to just 2 or 3 controllers, which typically provide more than five nines reliability. While the total number of controllers varies greatly and is more related to the network topology than to the network size, 10 controllers or less cover 75% of the most interesting cases. Therefore, fault tolerant SDNs are achievable by carefully determining the placement of controllers.","PeriodicalId":309136,"journal":{"name":"Proceedings of the third workshop on Hot topics in software defined networking","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122672675","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}
引用次数: 130
ONOS: towards an open, distributed SDN OS ONOS:走向开放、分布式的SDN操作系统
Proceedings of the third workshop on Hot topics in software defined networking Pub Date : 2014-08-22 DOI: 10.1145/2620728.2620744
Pankaj Berde, M. Gerola, Jonathan Hart, Y. Higuchi, Masayoshi Kobayashi, T. Koide, Bob Lantz, Brian O'Connor, Pavlin Radoslavov, William Snow, G. Parulkar
{"title":"ONOS: towards an open, distributed SDN OS","authors":"Pankaj Berde, M. Gerola, Jonathan Hart, Y. Higuchi, Masayoshi Kobayashi, T. Koide, Bob Lantz, Brian O'Connor, Pavlin Radoslavov, William Snow, G. Parulkar","doi":"10.1145/2620728.2620744","DOIUrl":"https://doi.org/10.1145/2620728.2620744","url":null,"abstract":"We present our experiences to date building ONOS (Open Network Operating System), an experimental distributed SDN control platform motivated by the performance, scalability, and availability requirements of large operator networks. We describe and evaluate two ONOS prototypes. The first version implemented core features: a distributed, but logically centralized, global network view; scale-out; and fault tolerance. The second version focused on improving performance. Based on experience with these prototypes, we identify additional steps that will be required for ONOS to support use cases such as core network traffic engineering and scheduling, and to become a usable open source, distributed network OS platform that the SDN community can build upon.","PeriodicalId":309136,"journal":{"name":"Proceedings of the third workshop on Hot topics in software defined networking","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116061755","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}
引用次数: 1156
Testing stateful and dynamic data planes with FlowTest 测试状态和动态数据平面与FlowTest
Proceedings of the third workshop on Hot topics in software defined networking Pub Date : 2014-08-22 DOI: 10.1145/2620728.2620751
S. K. Fayaz, V. Sekar
{"title":"Testing stateful and dynamic data planes with FlowTest","authors":"S. K. Fayaz, V. Sekar","doi":"10.1145/2620728.2620751","DOIUrl":"https://doi.org/10.1145/2620728.2620751","url":null,"abstract":"Many recent efforts have leveraged Software-Defined Networking (SDN capabilities to enable new and more efficient ways of testing the correctness of a network's forwarding behaviors. However, realistic network settings induce two additional sources of complexity that fall outside the scope of existing SDN testing frameworks: (1) complex nature of real-world data planes (e.g., stateful firewalls, dynamic behaviors of proxy caches), and (2) complexity of intended network policies (e.g., service chaining). In this paper, we outline FlowTest, a high-level vision for testing such stateful and dynamic network policies. FlowTest systematically explores the state space of the network data plane to verify its behavior w.r.t. policy goals. We show the early promise of our approach and discuss open challenges in realizing this vision in practice.","PeriodicalId":309136,"journal":{"name":"Proceedings of the third workshop on Hot topics in software defined networking","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115662488","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}
引用次数: 33
A programmable and scalable openflow switch using heterogeneous soc platforms 使用异构soc平台的可编程和可扩展的openflow交换机
Proceedings of the third workshop on Hot topics in software defined networking Pub Date : 2014-08-22 DOI: 10.1145/2620728.2620767
Shijie Zhou, Weirong Jiang, V. Prasanna
{"title":"A programmable and scalable openflow switch using heterogeneous soc platforms","authors":"Shijie Zhou, Weirong Jiang, V. Prasanna","doi":"10.1145/2620728.2620767","DOIUrl":"https://doi.org/10.1145/2620728.2620767","url":null,"abstract":"This work presents a hardware-software co-design approach of an OpenFlow switch using a state-of-the-art heterogeneous System-on-chip (SoC) platform. Specifically, we implement the OpenFlow switch on a Xilinx Zynq ZC706 board. The Xilinx Zynq SoC family provides a tight coupling of field programmable gate array (FPGA) fabric and ARM processor cores, making it an attractive on-chip implementation platform for SDN switches. High-performance, yet highly-programmable, data plane processing can reside in the programmable logic (PL), while complex control software can reside in ARM processor. Our proposed architecture scales across a range of possible packet throughput rates and a range of possible flow table sizes. Post-place-and-route results show that our design targeted at Zynq can achieve a total 88 Gbps throughput for a 1K flow table which supports dynamic updates. Correct operation has been demonstrated using a ZC706 board.","PeriodicalId":309136,"journal":{"name":"Proceedings of the third workshop on Hot topics in software defined networking","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124782588","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}
引用次数: 6
Flow-level state transition as a new switch primitive for SDN 流级状态转换是SDN的一种新的交换原语
Proceedings of the third workshop on Hot topics in software defined networking Pub Date : 2014-08-22 DOI: 10.1145/2620728.2620729
M. Moshref, Apoorv Bhargava, Adhip Gupta, Minlan Yu, R. Govindan
{"title":"Flow-level state transition as a new switch primitive for SDN","authors":"M. Moshref, Apoorv Bhargava, Adhip Gupta, Minlan Yu, R. Govindan","doi":"10.1145/2620728.2620729","DOIUrl":"https://doi.org/10.1145/2620728.2620729","url":null,"abstract":"In software-defined networking, the controller installs flow-based rules at switches either proactively or reactively. The reactive approach allows controller applications to make dynamic decisions about incoming traffic, but performs worse than the proactive one due to the controller involvement. To support dynamic applications with better performance, we propose FAST (Flow-level State Transitions) as a new switch primitive for software-defined networks. With FAST, the controller simply preinstalls a state machine and switches can automatically record flow state transitions by matching incoming packets to installed filters. FAST can support a variety of dynamic applications, and can be readily implemented with today's commodity switch components and software switches.","PeriodicalId":309136,"journal":{"name":"Proceedings of the third workshop on Hot topics in software defined networking","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123649035","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}
引用次数: 119
CAB: a reactive wildcard rule caching system for software-defined networks CAB:用于软件定义网络的响应式通配符规则缓存系统
Proceedings of the third workshop on Hot topics in software defined networking Pub Date : 2014-08-22 DOI: 10.1145/2620728.2620732
Bo Yan, Yang Xu, Hongya Xing, Kang Xi, H. J. Chao
{"title":"CAB: a reactive wildcard rule caching system for software-defined networks","authors":"Bo Yan, Yang Xu, Hongya Xing, Kang Xi, H. J. Chao","doi":"10.1145/2620728.2620732","DOIUrl":"https://doi.org/10.1145/2620728.2620732","url":null,"abstract":"Software-Defined Networking (SDN) enables flexible flow control by caching policy rules at OpenFlow switches. Compared with exact-match rule caching, wildcard rule caching can better preserve the flow table space at switches. However, one of the challenges for wildcard rule caching is the dependency between rules, which is generated by caching wildcard rules overlapped in field space with different priorities. Failure to handle the rule dependency may lead to wrong matching decisions for newly arrived flows, or may introduce high storage overhead in flow table memory. In this paper, we propose a wildcard rule caching system for SDN named CAching in Buckets (CAB). The main idea of CAB is to partition the field space into logical structures called buckets, and cache buckets along with all the associated rules. Through CAB, we resolve the rule dependency problem with small storage overhead. Compared to previous schemes, CAB reduces the flow setup requests by an order of magnitude, saves control bandwidth by a half, and significantly reduce average flow setup time.","PeriodicalId":309136,"journal":{"name":"Proceedings of the third workshop on Hot topics in software defined networking","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128659986","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}
引用次数: 62
An assertion language for debugging SDN applications 用于调试SDN应用程序的断言语言
Proceedings of the third workshop on Hot topics in software defined networking Pub Date : 2014-08-22 DOI: 10.1145/2620728.2620743
Ryan Beckett, X. Zou, Shuyuan Zhang, S. Malik, J. Rexford, D. Walker
{"title":"An assertion language for debugging SDN applications","authors":"Ryan Beckett, X. Zou, Shuyuan Zhang, S. Malik, J. Rexford, D. Walker","doi":"10.1145/2620728.2620743","DOIUrl":"https://doi.org/10.1145/2620728.2620743","url":null,"abstract":"Software Defined Networking (SDN) provides opportunities for network verification and debugging by offering centralized visibility of the data plane. This has enabled both offline and online data-plane verification. However, little work has gone into the verification of time-varying properties (e.g., dynamic access control), where verification conditions change dynamically in response to application logic, network events, and external stimulus (e.g., operator requests). This paper introduces an assertion language to support verifying and debugging SDN applications with dynamically changing verification conditions. The language allows programmers to annotate controller applications with C-style assertions about the data plane. Assertions consist of regular expressions on paths to describe path properties for classes of packets, and universal and existential quantifiers that range over programmer-defined sets of hosts, switches, or other network entities. As controller programs dynamically add and remove elements from these sets, they generate new verification conditions that the existing data plane must satisfy. This work proposes an incremental data structure together with an underlying verification engine, to avoid naively re-verifying the entire data plane as these verification conditions change. To validate our ideas, we have implemented a debugging library on top of a modified version of VeriFlow, which is easily integrated into existing controller systems with minimal changes. Using this library, we have verified correctness properties for applications on several controller platforms.","PeriodicalId":309136,"journal":{"name":"Proceedings of the third workshop on Hot topics in software defined networking","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130208316","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}
引用次数: 46
Incremental update for a compositional SDN hypervisor 用于组合SDN管理程序的增量更新
Proceedings of the third workshop on Hot topics in software defined networking Pub Date : 2014-08-22 DOI: 10.1145/2620728.2620731
Xin Jin, J. Rexford, D. Walker
{"title":"Incremental update for a compositional SDN hypervisor","authors":"Xin Jin, J. Rexford, D. Walker","doi":"10.1145/2620728.2620731","DOIUrl":"https://doi.org/10.1145/2620728.2620731","url":null,"abstract":"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.","PeriodicalId":309136,"journal":{"name":"Proceedings of the third workshop on Hot topics in software defined networking","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127927611","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}
引用次数: 23
ProCel: smart traffic handling for a scalable software EPC ProCel:用于可扩展软件EPC的智能交通处理
Proceedings of the third workshop on Hot topics in software defined networking Pub Date : 2014-08-22 DOI: 10.1145/2620728.2620761
Kanthi Nagaraj, S. Katti
{"title":"ProCel: smart traffic handling for a scalable software EPC","authors":"Kanthi Nagaraj, S. Katti","doi":"10.1145/2620728.2620761","DOIUrl":"https://doi.org/10.1145/2620728.2620761","url":null,"abstract":"Current architecture of cellular core networks results in centralized data plane elements that maintain stateful connections, are expensive and inflexible. Software Defined Networking (SDN) based solutions for cellular core networks have been proposed both in industry and academia to increase flexibility and manageability of these networks. But, all these solutions are plagued by scalability issues that challenge the deployment of SDN in networks with high signaling traffic and large number of policy rules. In ProCel, we propose a novel design for cellular core networks, which eliminates unnecessary conscientious handling of flows in LTE core network. ProCel can potentially reduce up to 70% of data and signaling traffic at cellular core. This enables deployment of SDN technology in core networks making them flexible and evolvable. Our solution decreases application response times, allows operators to deploy virtualized network functions and better utilize CDN caches. In the long run, the programmability of ProCel system can be utilized by cellular operators to effortlessly integrate innovative services in their network.","PeriodicalId":309136,"journal":{"name":"Proceedings of the third workshop on Hot topics in software defined networking","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133712289","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}
引用次数: 30
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信