2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)最新文献_第2页

SET: a Simple and Effective Technique to improve cost efficiency of VNF placement and chaining algorithms for network service provisioning SET:一种简单有效的技术来提高VNF放置和网络服务提供链算法的成本效率

2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft) Pub Date : 2018-06-01 DOI: 10.1109/NETSOFT.2018.8459908

S. Ahvar, M. Mirzaei, Jérémie Leguay, E. Ahvar, Ahmed Medhat, N. Crespi, R. Glitho

引用次数: 5

A new RAN slicing strategy for multi-tenancy support in a WLAN scenario 用于WLAN场景中多租户支持的新的RAN切片策略

2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft) Pub Date : 2018-06-01 DOI: 10.1109/NETSOFT.2018.8460138

Katerina Koutlia, A. Umbert, R. Riggio, Irene Vilá, F. Casadevall

{"title":"A new RAN slicing strategy for multi-tenancy support in a WLAN scenario","authors":"Katerina Koutlia, A. Umbert, R. Riggio, Irene Vilá, F. Casadevall","doi":"10.1109/NETSOFT.2018.8460138","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8460138","url":null,"abstract":"Radio Access Network (RAN) slicing is a key technology, based on Software Defined Networks (SDN) and Network Function Virtualization (NFV), which aims at providing a more efficient utilization of the available network resources and the reduction of the operational costs. In that respect, in this paper a novel virtualized WiFi network hypervisor is presented. This new hypervisor, based on a time variant radio resource sharing mechanism named Weighted Air-Time Deficit Round Robin (WADRR), is able to follow the dynamicity of the traffic variations seen by the different tenants located to the network Access Points (APs). It will be shown that the proposed WADRR hypervisor is able to dynamically assign the appropriate resources per tenant in every AP of the network, according to its specific traffic requirements. To this end, all the network APs are instructed by a controller which is responsible of guaranteeing, on average (long term perspective) and over the whole network, the accomplishment of the tenant's Service Level Agreement (SLA) target, while satisfying the short term traffic requests in the individual network APs. The correct behavior of the proposed algorithm has been validated through both simulations and in a real SDN-NFV platform build upon the 5G-EmPOWER test-bed.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117087707","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}

引用次数: 4

Efficient Data Plane Protection for SDN 高效的SDN数据平面保护

2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft) Pub Date : 2018-06-01 DOI: 10.1109/NETSOFT.2018.8459923

Daniel Merling, Wolfgang Braun, M. Menth

{"title":"Efficient Data Plane Protection for SDN","authors":"Daniel Merling, Wolfgang Braun, M. Menth","doi":"10.1109/NETSOFT.2018.8459923","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8459923","url":null,"abstract":"Software-defined networks (SDN) usually require intervention of a controller to restore connectivity in case of link or node failures. To avoid this dependence, a fast failover function enables switches to locally detect a failure and deviate affected traffic. In this paper, we develop fast reroute (FRR) methods leveraging that feature and the principle of loop-free alternates (LFAs) from IP networks for network-wide configuration. We explain how LFAs, remote LFAs, and novel explicit-path LFAs may be implemented with OpenFlow so that SDN with general destination-based routing can be protected. An advanced loop detection and termination function is suggested to prevent loops that may be caused by FRR in case of severe failures. We evaluate the FRR methods on a large set of representative network topologies and compare them with existing FRR methods. Classic rLFAs from IP networks generate many loops in case of node failures so that they are not appropriate for SDN. One developed protection method is particularly suitable for SDN as it can protect all flows in a network against any single link and node failure. The solution is efficient because it secures most traffic also in case of dual failures, leads to short backup paths, and requires in most networks only a few additional forwarding entries per node. The latter is important as OpenFlow switches can accommodate only a moderate number of forwarding entries in their flow tables.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117239520","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}

引用次数: 19

Fast Control Channel Recovery for Resilient In-band OpenFlow Networks 弹性带内OpenFlow网络的快速控制通道恢复

2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft) Pub Date : 2018-06-01 DOI: 10.1109/NETSOFT.2018.8460079

A. S. M. Asadujjaman, Elisa Rojas, M. S. Alam, Suryadipta Majumdar

{"title":"Fast Control Channel Recovery for Resilient In-band OpenFlow Networks","authors":"A. S. M. Asadujjaman, Elisa Rojas, M. S. Alam, Suryadipta Majumdar","doi":"10.1109/NETSOFT.2018.8460079","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8460079","url":null,"abstract":"Software-Defined Networking (SDN) is a thriving paradigm in computer networks where control plane is portrayed as a logically centralized entity decoupled from the data plane. Forwarding decisions at the data plane rely on installation of rules by the control plane through the control channel. Therefore, control channel resilience represents a critical requirement for SDN-based networks. Moreover, control channel leverages the links in the data plane in case of in-band control. To protect the control traffic in this case, we propose a scheme that combines logical ring topology with source-routed forwarding to enable local recovery from failure. This recovery does not require intervention by the controller, while preserving the simplicity of data plane devices. Simulation results on a real network topology show that the proposed scheme can recover from multiple link failures within 50ms. In our approach, failure recovery time is unaffected by control channel latency and, more specifically, we show that a link failure approximately 4,920km away from the controller (control channel latency of approximately 16.4ms) can be recovered within 3.8ms.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127309061","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}

引用次数: 12

Service Specific Management and Orchestration for a Content Delivery Network 内容交付网络的服务特定管理和编排

2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft) Pub Date : 2018-06-01 DOI: 10.1109/NETSOFT.2018.8459994

Thomas Soenen, W. Tavernier, G. Xilouris, Stavros Kolometsos, Felipe Vicens, Einar-Martín Meyerson Uriarte, M. S. Siddiqui

{"title":"Service Specific Management and Orchestration for a Content Delivery Network","authors":"Thomas Soenen, W. Tavernier, G. Xilouris, Stavros Kolometsos, Felipe Vicens, Einar-Martín Meyerson Uriarte, M. S. Siddiqui","doi":"10.1109/NETSOFT.2018.8459994","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8459994","url":null,"abstract":"Any non-trivial network service requires service specific orchestration to meet its carrier-grade requirements regarding resiliency, availability, etc. How the network service components are mapped on the substrate, how VNFs get reconfigured after a monitored event or how they scale, only network service/function developers know how to execute such workflows to guarantee an optimal QoS. It is therefore of paramount importance that NFV Service Platforms allow developer specified input when performing such life cycle events, instead of defining generic workflows. Within the scope of the SONATA and 5GTANGO projects, a mechanism was designed that allows developers to create and execute Service and Function Specific Managers. These managers are processes, created by the developer, that define service or function specific orchestration behaviour. The SONATA Service Platform executes these managers to overwrite generic Service Platform behaviour, creating developer customised life cycle workflows. We will demonstrate the development, testing and operational execution of these managers by using a Content Delivery Network which requires specific placement and scaling behaviour.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131082732","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}

引用次数: 2

Regression-Based Analytics for Response Dynamics of SDN Solutions and Components 基于回归的SDN解决方案和组件响应动力学分析

2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft) Pub Date : 2018-06-01 DOI: 10.1109/NETSOFT.2018.8458500

N. Rao, Qiang Liu, S. Sen, R. Kettimuthu, J. Boley, B. Settlemyer, Hsing-bung Chen, D. Katramatos

{"title":"Regression-Based Analytics for Response Dynamics of SDN Solutions and Components","authors":"N. Rao, Qiang Liu, S. Sen, R. Kettimuthu, J. Boley, B. Settlemyer, Hsing-bung Chen, D. Katramatos","doi":"10.1109/NETSOFT.2018.8458500","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8458500","url":null,"abstract":"We consider Software-Defined Network (SDN) solutions that dynamically setup and teardown connections, and also their response dynamics of connectivity and TCP throughput. There is a wide variety of choices for controllers, switches, and software modules, and objective analytics of measurements are needed to compare the response dynamics of solutions based on their combinations. Throughput and ping measurements during connection changes contain significant statistical variations due to the complexities of controllers, northbound scripts, and network devices. We propose analytical methods to estimate response regression functions, which provide a rigorous and objective comparison of different SDN solutions and their components, namely, controllers, switches, and OpenFlow versions. We apply this approach in two scenarios: (a) switching of long-haul connections emulated in hardware by ANUE devices over a testbed consisting of HP and Cisco switches, and (b) multi-site science infrastructure emulated using VMs and Mininet. The results provide useful practical insights including: (i) the dpctl method responds seconds faster than the OpenDayLight (ODL) method on average under OpenFlow 1.0, but performs similar to ODL under OpenFlow 1.3, and (ii) the ping response of dpctl is about 0.6 sec faster than ODL for the second scenario.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126662195","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}

引用次数: 1

LARAC-SN and Mole in the Hole: Enabling Routing through Service Function Chains LARAC-SN和洞中鼹鼠:通过业务功能链实现路由

2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft) Pub Date : 2018-06-01 DOI: 10.1109/NETSOFT.2018.8460128

Amaury Van Bemten, Jochen W. Guck, P. Vizarreta, C. M. Machuca, W. Kellerer

{"title":"LARAC-SN and Mole in the Hole: Enabling Routing through Service Function Chains","authors":"Amaury Van Bemten, Jochen W. Guck, P. Vizarreta, C. M. Machuca, W. Kellerer","doi":"10.1109/NETSOFT.2018.8460128","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8460128","url":null,"abstract":"With the emergence of Software-Defined Networking (SDN) and Network Function Virtualization (NFV), the problem of centralized routing through intermediate specified nodes (for which several candidates can be defined) has become an important issue. Indeed, an SDN controller routing flows through Service Function Chains (SFCs) has to efficiently solve this problem to achieve the online provisioning of routing requests and the online placement of Virtual Network Functions (VNFs). In this paper, we propose two algorithms for solving this problem. First, we propose LARAC for specified nodes (LARAC-SN), a fast and close to optimal algorithm for finding the constrained shortest path (CSP) visiting an ordered set of specified nodes. Second, we propose Mole in the Hole (MITH), a graph transformation algorithm which can force any state-of-the-art routing algorithm to visit an ordered set of specified nodes. While LARAC-SN is bounded to the specific CSP problem and can only handle one candidate per specified node, MITH can be used for any routing problem and can deal with several candidates per specified node. Through evaluations, we show that LARAC-SN is fast and close to optimal (its optimality gap stays lower than 1.62% in average) and that MITH has the potential of reaching optimality for any problem, but at the cost of a higher runtime.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121043110","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}

引用次数: 3

Containernet 2.0: A Rapid Prototyping Platform for Hybrid Service Function Chains Containernet 2.0:混合服务功能链的快速原型平台

2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft) Pub Date : 2018-06-01 DOI: 10.1109/NETSOFT.2018.8459905

Manuel Peuster, J. Kampmeyer, H. Karl

引用次数: 45

Federation of Cross-Domain Edge Resources: A Brokering Architecture for Network Slicing 跨域边缘资源联合:网络切片的代理体系结构

2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft) Pub Date : 2018-06-01 DOI: 10.1109/NETSOFT.2018.8460114

Amina Boubendir, F. Guillemin, C. Toquin, Marie-Line Alberi-Morel, Frédéric Faucheux, S. Kerboeuf, J. Lafragette, Barbara Orlandi

引用次数: 20

Control and Management of a Connected Car Using SDN/NFV, Fog Computing and YANG data models 基于SDN/NFV、雾计算和YANG数据模型的联网汽车控制与管理

2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft) Pub Date : 2018-06-01 DOI: 10.1109/NETSOFT.2018.8460131

R. Vilalta, Selva Via, Fermin Mira, R. Casellas, R. Muñoz, J. Alonso-Zarate, A. Kousaridas, M. Dillinger

{"title":"Control and Management of a Connected Car Using SDN/NFV, Fog Computing and YANG data models","authors":"R. Vilalta, Selva Via, Fermin Mira, R. Casellas, R. Muñoz, J. Alonso-Zarate, A. Kousaridas, M. Dillinger","doi":"10.1109/NETSOFT.2018.8460131","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8460131","url":null,"abstract":"There are several use cases that claim the need for a connected car. Among them there is the need for connectivity between vehicles and information sources, or V2V and V2X exchanges for accident prevention. In order to cope with the need for novel applications running on top of an interconnected network, the concept of fog computing appears as a realistic solution for both intra-car and inter-car data processing and decision making. This paper describes the proposed architecture and experimental evaluation of an innovative proof-of-concept (PoC) for a connected car, modeled with YANG, which can be remotely controlled using SDN/NFV and fog computing technologies. As an example, the remote control of the car might be based on a service application running on a fog node, which can be located close to a road side unit (RSU). We also propose a fog architecture in order to enable cooperative perception between connected cars. Finally, the performance evaluation uses a RESTCONF server installed in a Raspberry Pi aboard of a small car. This server is responsible for the sensors and actuators of the car and allows for its remote control from a user terminal (e.g., a smartphone, tablet, or laptop) and through the fog node, running a control application as a service.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"45 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132360086","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}

引用次数: 22