Pub Date : 2016-11-01DOI: 10.1109/NFV-SDN.2016.7919480
C. Dominicini, G. Vassoler, M. Ribeiro, M. Martinello
This paper proposes, implements, and evaluates VirtPhy, a novel approach to build small-scale data centers network infrastructure for network functions virtualisation (NFV). VirtPhy is fully programmable to respond to NFV stringent demands related to throughput, latency, cost, rapid innovation, and efficient orchestration. An 8-node testbed demonstrates its key enabling mechanisms, which are programmed to jointly make the most of the available physical infrastructure.
{"title":"VirtPhy: A fully programmable infrastructure for efficient NFV in small data centers","authors":"C. Dominicini, G. Vassoler, M. Ribeiro, M. Martinello","doi":"10.1109/NFV-SDN.2016.7919480","DOIUrl":"https://doi.org/10.1109/NFV-SDN.2016.7919480","url":null,"abstract":"This paper proposes, implements, and evaluates VirtPhy, a novel approach to build small-scale data centers network infrastructure for network functions virtualisation (NFV). VirtPhy is fully programmable to respond to NFV stringent demands related to throughput, latency, cost, rapid innovation, and efficient orchestration. An 8-node testbed demonstrates its key enabling mechanisms, which are programmed to jointly make the most of the available physical infrastructure.","PeriodicalId":448203,"journal":{"name":"2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128517245","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}
Pub Date : 2016-11-01DOI: 10.1109/NFV-SDN.2016.7919499
C. Makaya, Douglas M. Freimuth
Network functions virtualization (NFV) opens up a new ability of network enablement through agile network DevOps to design, develop, and test new services and to provide ongoing updates of existing services. This paper proposes a tool and methodology to aid the NFV designer to rapidly design and onboard new services and applications. Although the main focus is on the service design and onboarding, we provide the relation with other aspects such as management and orchestration, and service assurance of a complete lifecycle for network service. The proposed tool and methodology is called VNF Onboarding Automation Tool (VOAT). The prototype implementation is discussed as well as various use cases where VOAT has been used. With VOAT, an automated service design and onboarding can be efficiently achieved, hence reducing significantly the timeframe for deploying new services in telco cloud-based environment.
{"title":"Automated virtual network functions onboarding","authors":"C. Makaya, Douglas M. Freimuth","doi":"10.1109/NFV-SDN.2016.7919499","DOIUrl":"https://doi.org/10.1109/NFV-SDN.2016.7919499","url":null,"abstract":"Network functions virtualization (NFV) opens up a new ability of network enablement through agile network DevOps to design, develop, and test new services and to provide ongoing updates of existing services. This paper proposes a tool and methodology to aid the NFV designer to rapidly design and onboard new services and applications. Although the main focus is on the service design and onboarding, we provide the relation with other aspects such as management and orchestration, and service assurance of a complete lifecycle for network service. The proposed tool and methodology is called VNF Onboarding Automation Tool (VOAT). The prototype implementation is discussed as well as various use cases where VOAT has been used. With VOAT, an automated service design and onboarding can be efficiently achieved, hence reducing significantly the timeframe for deploying new services in telco cloud-based environment.","PeriodicalId":448203,"journal":{"name":"2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125383125","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}
Pub Date : 2016-11-01DOI: 10.1109/NFV-SDN.2016.7919473
Sinan Tatlicioglu, S. Civanlar, B. Gorkemli, Erhan Lokman, A. M. Balci, C. B. Eliacik
Software Defined Networking (SDN) is a paradigm shift that changes the working principals of IP networks by separating the control logic from routers and switches, and logically centralizing it within a controller. While having a centralized controller as a single point of failure creates an added vulnerability from a network security viewpoint, it also creates an opportunity to offer a whole range of novel security services such as Moving Target Defense (MTD) strategies, many of which are painstakingly difficult or almost impossible without SDN. The traditional security services such as Onion Routing and VPN can be offered with much richer options by exploiting the advantages attained by SDN. This paper primarily focuses on a centralized security services platform of the controller that generates a dynamic behavior for selected data flows.
{"title":"A security services platform for Software Defined Networks","authors":"Sinan Tatlicioglu, S. Civanlar, B. Gorkemli, Erhan Lokman, A. M. Balci, C. B. Eliacik","doi":"10.1109/NFV-SDN.2016.7919473","DOIUrl":"https://doi.org/10.1109/NFV-SDN.2016.7919473","url":null,"abstract":"Software Defined Networking (SDN) is a paradigm shift that changes the working principals of IP networks by separating the control logic from routers and switches, and logically centralizing it within a controller. While having a centralized controller as a single point of failure creates an added vulnerability from a network security viewpoint, it also creates an opportunity to offer a whole range of novel security services such as Moving Target Defense (MTD) strategies, many of which are painstakingly difficult or almost impossible without SDN. The traditional security services such as Onion Routing and VPN can be offered with much richer options by exploiting the advantages attained by SDN. This paper primarily focuses on a centralized security services platform of the controller that generates a dynamic behavior for selected data flows.","PeriodicalId":448203,"journal":{"name":"2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130044955","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}
Pub Date : 2016-11-01DOI: 10.1109/NFV-SDN.2016.7919471
Salvatore Talarico, K. Makhijani, P. Pillay-Esnault
The evolution towards the Fifth Generation (5G) mobile networks will be characterized by ubiquitous connectivity, superior user experience, stringent reliability requirements and efficient management of a massive number of devices. These characteristics will lead to a growth of diverse services and business models, which will increase the service complexity. In order to meet the needs of future networks, cloud and virtualized technologies will be used. Network slicing is among the emerging virtualization concepts: the network resources are logically partitioned in sets, called network slices, which are properly selected in order to meet and support the communication service requirements for specific use cases. In a service centric 5G network, the foremost requirements are (a) distribution of offered services, and (b) flexible and automated discovery of a service by users. In this paper, we propose an efficient dynamic service discovery framework in the context of network slicing, based on the recently introduced concept of CloudCasting protocol. The proposed solution provides several benefits as service isolation, enhanced scalability, prompt reaction to mobility, natural accommodation of heterogeneous connectivity, and lightweight signaling to establish service discovery and distribution.
{"title":"Efficient service auto-discovery for next generation network slicing architecture","authors":"Salvatore Talarico, K. Makhijani, P. Pillay-Esnault","doi":"10.1109/NFV-SDN.2016.7919471","DOIUrl":"https://doi.org/10.1109/NFV-SDN.2016.7919471","url":null,"abstract":"The evolution towards the Fifth Generation (5G) mobile networks will be characterized by ubiquitous connectivity, superior user experience, stringent reliability requirements and efficient management of a massive number of devices. These characteristics will lead to a growth of diverse services and business models, which will increase the service complexity. In order to meet the needs of future networks, cloud and virtualized technologies will be used. Network slicing is among the emerging virtualization concepts: the network resources are logically partitioned in sets, called network slices, which are properly selected in order to meet and support the communication service requirements for specific use cases. In a service centric 5G network, the foremost requirements are (a) distribution of offered services, and (b) flexible and automated discovery of a service by users. In this paper, we propose an efficient dynamic service discovery framework in the context of network slicing, based on the recently introduced concept of CloudCasting protocol. The proposed solution provides several benefits as service isolation, enhanced scalability, prompt reaction to mobility, natural accommodation of heterogeneous connectivity, and lightweight signaling to establish service discovery and distribution.","PeriodicalId":448203,"journal":{"name":"2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115715250","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}
Pub Date : 2016-11-01DOI: 10.1109/NFV-SDN.2016.7919496
V. B. Wijekoon, T. Dananjaya, P. H. Kariyawasam, S. Iddamalgoda, A. Pasqual
Increasing demands for faster, more responsive and manageable networks have brought about a different approach to networking - Software Defined Networking (SDN). SDN introduces flow-based networking with a centralized controller. Matching incoming traffic flows with rules sent by the controller is an integral part of traffic forwarding in SDN. How efficiently this is carried out has a huge impact on network performance. In this paper, we present a high-performance, low-cost architecture for flow matching in an SDN switch. Our architecture consists of a dedicated unit for flow matching and a custom processor. Novel design of the flow match unit reduces matching latency significantly, when compared with the generic architecture, while also reducing usage of costly resources like TCAMs. When testing on FPGA platforms, implementing the system required only a minimum amount (around 10% on Virtex-7) of hardware resources.
{"title":"High performance flow matching architecture for OpenFlow data plane","authors":"V. B. Wijekoon, T. Dananjaya, P. H. Kariyawasam, S. Iddamalgoda, A. Pasqual","doi":"10.1109/NFV-SDN.2016.7919496","DOIUrl":"https://doi.org/10.1109/NFV-SDN.2016.7919496","url":null,"abstract":"Increasing demands for faster, more responsive and manageable networks have brought about a different approach to networking - Software Defined Networking (SDN). SDN introduces flow-based networking with a centralized controller. Matching incoming traffic flows with rules sent by the controller is an integral part of traffic forwarding in SDN. How efficiently this is carried out has a huge impact on network performance. In this paper, we present a high-performance, low-cost architecture for flow matching in an SDN switch. Our architecture consists of a dedicated unit for flow matching and a custom processor. Novel design of the flow match unit reduces matching latency significantly, when compared with the generic architecture, while also reducing usage of costly resources like TCAMs. When testing on FPGA platforms, implementing the system required only a minimum amount (around 10% on Virtex-7) of hardware resources.","PeriodicalId":448203,"journal":{"name":"2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128285764","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}
Pub Date : 2016-11-01DOI: 10.1109/NFV-SDN.2016.7919469
Qiong Zhang, Xi Wang, P. Palacharla, T. Ikeuchi
Orchestration across multiple domains is important for providing end-to-end services in software defined infrastructures. In this paper, we address the service function chain (SFC) mapping problem in a multi-domain network with nodes having different functions, i.e., service functions and/or switch functions. We present two different abstractions of the topology graph at the distributed orchestrators associated with each domain and propose vertex-centric distributed computing algorithms to compute SFC mappings. We implement the proposed algorithms in an open source vertex-centric distributed computing software, Giraph, and evaluate their performance.
{"title":"Distributed service orchestration: Interweaving switch and service functions across domains","authors":"Qiong Zhang, Xi Wang, P. Palacharla, T. Ikeuchi","doi":"10.1109/NFV-SDN.2016.7919469","DOIUrl":"https://doi.org/10.1109/NFV-SDN.2016.7919469","url":null,"abstract":"Orchestration across multiple domains is important for providing end-to-end services in software defined infrastructures. In this paper, we address the service function chain (SFC) mapping problem in a multi-domain network with nodes having different functions, i.e., service functions and/or switch functions. We present two different abstractions of the topology graph at the distributed orchestrators associated with each domain and propose vertex-centric distributed computing algorithms to compute SFC mappings. We implement the proposed algorithms in an open source vertex-centric distributed computing software, Giraph, and evaluate their performance.","PeriodicalId":448203,"journal":{"name":"2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121524775","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}
Pub Date : 2016-11-01DOI: 10.1109/NFV-SDN.2016.7919503
Thomas Soenen, Sahel Sahhaf, W. Tavernier, Pontus Sköldström, D. Colle, M. Pickavet
Through network function virtualization (NFV), telecom providers aim to flexibly re-use generic-purpose hardware to provide services on-demand and in an agile way. Service function chaining is becoming the preferred model to describe the characteristics of the packet-processing network functions which, together, form these services. NFV allows for network function embedding freedom, creating new dynamics between providers and the users requesting services. Users want this freedom to optimise the performance of their requested services, while providers aim to optimise their resource cost with it. This trade-off is heavily influenced by how the available infrastructure is exposed to the users. In this paper, we present an infrastructure abstraction model for network, compute and storage resources that exposes the infrastructure in an abstracted manner. We use this abstraction to propose a solution for the placement freedom trade-off problem by studying its relation with metrics that capture both the user's and the provider's aspects. We conclude with a heuristic that determines the right abstraction for particular scenarios.
通过网络功能虚拟化(network function virtualization, NFV)，电信运营商旨在灵活重用通用硬件，以灵活的方式按需提供业务。业务功能链正在成为描述分组处理网络功能特征的首选模型，这些功能共同构成了这些业务。NFV允许网络功能嵌入自由，在提供商和请求服务的用户之间创建新的动态。用户希望这种自由来优化他们所请求的服务的性能，而提供商的目标是利用这种自由来优化他们的资源成本。这种权衡很大程度上受到可用基础设施向用户公开的方式的影响。在本文中，我们提出了一个网络、计算和存储资源的基础设施抽象模型，以抽象的方式公开基础设施。我们使用这个抽象来提出放置自由权衡问题的解决方案，通过研究它与捕获用户和提供者方面的度量的关系。我们以确定特定场景的正确抽象的启发式来结束。
{"title":"A model to select the right infrastructure abstraction for Service Function Chaining","authors":"Thomas Soenen, Sahel Sahhaf, W. Tavernier, Pontus Sköldström, D. Colle, M. Pickavet","doi":"10.1109/NFV-SDN.2016.7919503","DOIUrl":"https://doi.org/10.1109/NFV-SDN.2016.7919503","url":null,"abstract":"Through network function virtualization (NFV), telecom providers aim to flexibly re-use generic-purpose hardware to provide services on-demand and in an agile way. Service function chaining is becoming the preferred model to describe the characteristics of the packet-processing network functions which, together, form these services. NFV allows for network function embedding freedom, creating new dynamics between providers and the users requesting services. Users want this freedom to optimise the performance of their requested services, while providers aim to optimise their resource cost with it. This trade-off is heavily influenced by how the available infrastructure is exposed to the users. In this paper, we present an infrastructure abstraction model for network, compute and storage resources that exposes the infrastructure in an abstracted manner. We use this abstraction to propose a solution for the placement freedom trade-off problem by studying its relation with metrics that capture both the user's and the provider's aspects. We conclude with a heuristic that determines the right abstraction for particular scenarios.","PeriodicalId":448203,"journal":{"name":"2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128404996","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}
Pub Date : 2016-11-01DOI: 10.1109/NFV-SDN.2016.7919472
Bin Zhang, Pengfei Zhang, Yusu Zhao, Yongkun Wang, Xuan Luo, Yaohui Jin
Modern network functions (NFs) are able to scale out conveniently with the help of network function virtualization (NFV). When network traffic rises, NFV can provide more instances easily for migrating network flows to new instances to balance the traffic on the existing ones. However, the main challenge is to select which subset of existing flows to migrate when scale out, minimizing the negative impact of flow migration. In this paper, we propose the Co-Scaler, which is a heuristic algorithm to find out an optimized solution quickly. It employs two-step flow selection when a service function chain (SFC) with multiple NFs needs to scale out. We evaluated Co-Scaler by the real trace from data center network with several NFs. The results show that Co-Scaler can significantly decrease the number of packets affected by buffering, and minimize the latency introduced by flow migration.
{"title":"Co-Scaler: Cooperative scaling of software-defined NFV service function chain","authors":"Bin Zhang, Pengfei Zhang, Yusu Zhao, Yongkun Wang, Xuan Luo, Yaohui Jin","doi":"10.1109/NFV-SDN.2016.7919472","DOIUrl":"https://doi.org/10.1109/NFV-SDN.2016.7919472","url":null,"abstract":"Modern network functions (NFs) are able to scale out conveniently with the help of network function virtualization (NFV). When network traffic rises, NFV can provide more instances easily for migrating network flows to new instances to balance the traffic on the existing ones. However, the main challenge is to select which subset of existing flows to migrate when scale out, minimizing the negative impact of flow migration. In this paper, we propose the Co-Scaler, which is a heuristic algorithm to find out an optimized solution quickly. It employs two-step flow selection when a service function chain (SFC) with multiple NFs needs to scale out. We evaluated Co-Scaler by the real trace from data center network with several NFs. The results show that Co-Scaler can significantly decrease the number of packets affected by buffering, and minimize the latency introduced by flow migration.","PeriodicalId":448203,"journal":{"name":"2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131362862","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}
Pub Date : 2016-11-01DOI: 10.1109/NFV-SDN.2016.7919484
M. Obadia, J. Rougier, L. Iannone, V. Conan, M. Bouet
Network Function Virtualization (NFV) is an emerging approach that has received attention from both academia and industry as a way to improve flexibility, efficiency, and manageability of networks. This flexibility can be leveraged to allow for a better optimization of Virtual Network Functions (VNFs), which can now be dynamically placed in the network to adapt efficiently to both network constraints and the business objectives of operators. Network applications' requests are expressed as Service Chains (SCs): a set of VNFs chained together through virtual links. The placement of VNFs and SCs is a challenge that impacts the quality of service of all applications and the operating cost incurred on the operator. In this paper we present an Integer Linear Programming (ILP) formulation of this placement problem. Since the problem is NP-complete, we provide a heuristic based on game theory and implemented in a best response algorithm. One key benefit of our approach is that it stays provably close to the optimal, when VNF costs are linear with respect to the server charge. We also evaluate this heuristic when this assumption is relaxed and show that it stays more efficient than other state of the art algorithms.
网络功能虚拟化(Network Function Virtualization, NFV)是一种新兴的方法，作为一种提高网络灵活性、效率和可管理性的方法，已经受到学术界和工业界的关注。利用这种灵活性可以更好地优化虚拟网络功能(vnf)，现在可以动态地将其放置在网络中，以有效地适应网络约束和运营商的业务目标。网络应用的请求被表示为服务链(Service Chains, sc):一组通过虚拟链路链接在一起的VNFs。vnf和sc的放置是一个挑战，它会影响所有应用程序的服务质量和运营商的运营成本。本文给出了该布局问题的整数线性规划(ILP)公式。由于问题是np完全的，我们提供了一个基于博弈论的启发式算法，并在最佳响应算法中实现。我们的方法的一个关键优点是，当VNF成本与服务器费用呈线性关系时，它可以证明接近于最优值。当这个假设放松时，我们还评估了这种启发式算法，并表明它比其他最先进的算法更有效。
{"title":"Revisiting NFV orchestration with routing games","authors":"M. Obadia, J. Rougier, L. Iannone, V. Conan, M. Bouet","doi":"10.1109/NFV-SDN.2016.7919484","DOIUrl":"https://doi.org/10.1109/NFV-SDN.2016.7919484","url":null,"abstract":"Network Function Virtualization (NFV) is an emerging approach that has received attention from both academia and industry as a way to improve flexibility, efficiency, and manageability of networks. This flexibility can be leveraged to allow for a better optimization of Virtual Network Functions (VNFs), which can now be dynamically placed in the network to adapt efficiently to both network constraints and the business objectives of operators. Network applications' requests are expressed as Service Chains (SCs): a set of VNFs chained together through virtual links. The placement of VNFs and SCs is a challenge that impacts the quality of service of all applications and the operating cost incurred on the operator. In this paper we present an Integer Linear Programming (ILP) formulation of this placement problem. Since the problem is NP-complete, we provide a heuristic based on game theory and implemented in a best response algorithm. One key benefit of our approach is that it stays provably close to the optimal, when VNF costs are linear with respect to the server charge. We also evaluate this heuristic when this assumption is relaxed and show that it stays more efficient than other state of the art algorithms.","PeriodicalId":448203,"journal":{"name":"2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124214645","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}
Pub Date : 2016-11-01DOI: 10.1109/NFV-SDN.2016.7919495
Niels L. M. van Adrichem, F. Iqbal, F. Kuipers
The past century of telecommunications has shown that failures in networks are prevalent. Failure recovery processes are therefore needed. Failure recovery is mainly influenced by (1) detection of the failure, and (2) circumvention of the detected failure. However, especially in SDNs where controllers recompute network state reactively, this leads to high delays. Hence, next to primary rules, backup rules should be installed in the switches to quickly detour traffic once a failure occurs. In this work, we propose algorithms for computing an all-to-all primary and backup network forwarding configuration that is capable of circumventing link and node failures. After initial recovery, we recompute network configuration to guarantee protection from future failures. Our algorithms use packet-labeling to guarantee correct and shortest detour forwarding and are able to discriminate between link and node failures. The computational complexity of our solution is comparable to that of all-to-all shortest paths computations. Our experimental evaluation shows that network configuration complexity decreases significantly compared to classic disjoint paths computations. Finally, we provide a proof-of-concept OpenFlow controller in which our proposed configuration is implemented, demonstrating that it readily can be applied in production networks.
{"title":"Backup rules in Software-Defined Networks","authors":"Niels L. M. van Adrichem, F. Iqbal, F. Kuipers","doi":"10.1109/NFV-SDN.2016.7919495","DOIUrl":"https://doi.org/10.1109/NFV-SDN.2016.7919495","url":null,"abstract":"The past century of telecommunications has shown that failures in networks are prevalent. Failure recovery processes are therefore needed. Failure recovery is mainly influenced by (1) detection of the failure, and (2) circumvention of the detected failure. However, especially in SDNs where controllers recompute network state reactively, this leads to high delays. Hence, next to primary rules, backup rules should be installed in the switches to quickly detour traffic once a failure occurs. In this work, we propose algorithms for computing an all-to-all primary and backup network forwarding configuration that is capable of circumventing link and node failures. After initial recovery, we recompute network configuration to guarantee protection from future failures. Our algorithms use packet-labeling to guarantee correct and shortest detour forwarding and are able to discriminate between link and node failures. The computational complexity of our solution is comparable to that of all-to-all shortest paths computations. Our experimental evaluation shows that network configuration complexity decreases significantly compared to classic disjoint paths computations. Finally, we provide a proof-of-concept OpenFlow controller in which our proposed configuration is implemented, demonstrating that it readily can be applied in production networks.","PeriodicalId":448203,"journal":{"name":"2016 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116952696","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：