2019 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)最新文献_第2页

Branching-Aware Service Function Placement and Routing in Network Function Virtualization 网络功能虚拟化中分支感知的业务功能布局与路由

2019 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN) Pub Date : 2019-11-01 DOI: 10.1109/NFV-SDN47374.2019.9039981

Maryam Jalalitabar, Yang Wang, Xiaojun Cao

{"title":"Branching-Aware Service Function Placement and Routing in Network Function Virtualization","authors":"Maryam Jalalitabar, Yang Wang, Xiaojun Cao","doi":"10.1109/NFV-SDN47374.2019.9039981","DOIUrl":"https://doi.org/10.1109/NFV-SDN47374.2019.9039981","url":null,"abstract":"Network Function Virtualization (NFV) is an emerging technology that promises to address issues in traditional middleboxes, providing service flexibility and reduced cost. NFV decouples network functions from the proprietary middlebox hardware, thus allowing the network providers to implement network functions on virtual machines running in standard servers. To deliver an end-to-end service in the NFV environment, Service Function Chain (SFC) is used to define the sequence of actions or Virtual Network Functions (VNFs) that needs to be applied to the data stream of a service delivery demand. Typically, the SFC is regarded as a linear topology that consists of a group of VNFs that the data stream is navigated through. However, our recent exploration on a group of real-life use cases reveals that the data stream can branch out to multiple data streams at certain VNFs (e.g., a load balancer). This branching indicates that the packet flow may be directed to multiple different paths, resulting in a more complex mesh-like service function graph. In this paper, we define the resulting problem as Branching-Aware Service Function Graph embedding and routing (B_SFG). We study how to efficiently accommodate user’s B_SFG requests in the physical network while considering the constraints of function dependency, branching requirements, computing resources of virtual nodes and bandwidth demand of the virtual links. We propose a novel algorithm, B_SFG_CM, which jointly optimizes the processes of node and link mapping of a request. B_SFG_CM employs the proposed techniques of dependency sorting and layering that effectively take into account the node dependency, branching points and the resource status of the physical network. Our experimental results show that the proposed algorithm significantly outperforms the scheme based on the traditional sequential node/link embedding in which the node and link mapping is done sequentially.","PeriodicalId":394933,"journal":{"name":"2019 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121280968","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

Cloud-Native 5G Service Delivery Platform 云原生5G服务交付平台

2019 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN) Pub Date : 2019-11-01 DOI: 10.1109/NFV-SDN47374.2019.9040042

Kay Haensge, D. Trossen, S. Robitzsch, M. Boniface, S. Phillips

引用次数: 6

HybridSFC: Accelerating Service Function Chains with Parallelism HybridSFC:利用并行性加速业务功能链

2019 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN) Pub Date : 2019-11-01 DOI: 10.1109/NFV-SDN47374.2019.9040088

Yang Zhang, Zhi-Li Zhang, B. Han

引用次数: 4

Latency-Aware, Static, and Dynamic Decision-Tree Placement Algorithm for Containerized SDN-VNF in OpenFlow Architectures OpenFlow架构中容器化SDN-VNF的延迟感知、静态和动态决策树放置算法

2019 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN) Pub Date : 2019-11-01 DOI: 10.1109/NFV-SDN47374.2019.9039973

Dewang Gedia, Levi Perigo

{"title":"Latency-Aware, Static, and Dynamic Decision-Tree Placement Algorithm for Containerized SDN-VNF in OpenFlow Architectures","authors":"Dewang Gedia, Levi Perigo","doi":"10.1109/NFV-SDN47374.2019.9039973","DOIUrl":"https://doi.org/10.1109/NFV-SDN47374.2019.9039973","url":null,"abstract":"The preliminary work conducted as a part of this research evaluated two virtualization technologies, virtual machines (VM) and containers, for a software-defined networking controller virtual network function (SDN-VNF) – per the NFV Research Group (NFVRG) testing guidelines. Although the VNF benchmarking experiment results have proved that container-based VNFs offer various performance advantages (memory/throughput) over VM-based VNFs, prior work lacks the development of optimal containerized VNF placement algorithms. The goal of this research is to further the preliminary work that presented a resilient SDN/NFV infrastructure per ETSI-NFV design considerations that actively orchestrates and monitors the network infrastructure comprising of SDN-VNF by designing a decision-tree (DT) algorithm to perform an optimal placement of containerized SDN-VNFs in an OpenFlow network architecture. The research compares two approaches for implementing the DT algorithm – first, using cbench as the OpenFlow statistics advisor and second, using a northbound application as the OpenFlow statistics advisor. The result indicates that the DT algorithm offers comparatively smaller and near-constant total placement time when it is coupled with a northbound application compared to the former approach that uses cbench. Moreover, the second approach removes any OpenFlow switch Operating System (OS) dependency (that is required in case of cbench) which further benefits its adoption in multi-faceted OpenFlow networks. The outcome of this research enhances the body of knowledge on implementing optimal containerized SDN-VNF placement algorithms that facilitate Internet Service Providers (ISPs) understanding of the benefits of containerized SDN-VNF adoption.","PeriodicalId":394933,"journal":{"name":"2019 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","volume":"91 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113992211","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

“Producing Cloud-Native”: Smart Manufacturing Use Cases on Kubernetes “生产云原生”:Kubernetes上的智能制造用例

2019 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN) Pub Date : 2019-11-01 DOI: 10.1109/NFV-SDN47374.2019.9040152

Stefan Schneider, Manuel Peuster, Kai Hannemann, D. Behnke, M. Müller, Patrick-Benjamin Bök, H. Karl

引用次数: 6

Demonstrating FOP4: A Flexible Platform to Prototype NFV Offloading Scenarios 演示FOP4:一个灵活的平台原型NFV卸载场景

2019 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN) Pub Date : 2019-11-01 DOI: 10.1109/NFV-SDN47374.2019.9040056

Daniele Moro, Manuel Peuster, H. Karl, A. Capone

引用次数: 3

Parcel-Fit: Low Network-Overhead Service-Chain Deployment for Better Datacenter Performance 包合:低网络开销的服务链部署，以获得更好的数据中心性能

2019 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN) Pub Date : 2019-11-01 DOI: 10.1109/NFV-SDN47374.2019.9040155

Hsueh-Hong Kang, I-Chih Wang, Li-Ping Tung, Charles H.-P. Wen

{"title":"Parcel-Fit: Low Network-Overhead Service-Chain Deployment for Better Datacenter Performance","authors":"Hsueh-Hong Kang, I-Chih Wang, Li-Ping Tung, Charles H.-P. Wen","doi":"10.1109/NFV-SDN47374.2019.9040155","DOIUrl":"https://doi.org/10.1109/NFV-SDN47374.2019.9040155","url":null,"abstract":"Network Function Virtualization (NFV) is emerging for service deployment in datacenters and how to efficiently deploying virtual network functions (VNFs) on VMs under SLA requirements is an key topic. Previous studies often overlook the network factor that deteriorates the datacenter performance due to unnecessary network occupation and inter-VM communication in a service function chain over the datacenter network, thus motivating us to develop Parcel-Fit. The concept of Parcel-Fit considers server capacities (i.e., CPU and memory) and network status (i.e. network occupation and server distance) to avoids unnecessary inter-VM communication in the datacenter network and thus minimize total latencies of the service function chain. In addition, Parcel-Fit is also incorporated into prior latency-minimized schemes for deploying service function chains (i.e. Multi-layer Bin Structure and SOVWin) and fulfill more SLA requirements. According to our experimental results, Parcel-Fit outperforms two conventional VM placement strategies (Best-Fit and First-Fit) on the basis of SOVWin/Multilayer Bin Structure by 28.50% less average latency, 24.54% less network occupation, 25.16% more acceptance rate and 72.04% less violation count, achieving better performance for deploying service function chains in datacenters.","PeriodicalId":394933,"journal":{"name":"2019 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132167803","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

Reproducible Functional Tests for Multi-scale Network Services 多尺度网络服务的可重复功能测试

2019 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN) Pub Date : 2019-11-01 DOI: 10.1109/NFV-SDN47374.2019.9039968

A. Nuriddinov, W. Tavernier, D. Colle, M. Pickavet, Manuel Peuster, Stefan Schneider

{"title":"Reproducible Functional Tests for Multi-scale Network Services","authors":"A. Nuriddinov, W. Tavernier, D. Colle, M. Pickavet, Manuel Peuster, Stefan Schneider","doi":"10.1109/NFV-SDN47374.2019.9039968","DOIUrl":"https://doi.org/10.1109/NFV-SDN47374.2019.9039968","url":null,"abstract":"Network functions virtualization (NFV) is developed to take advantage of virtualization technologies to separate network functions from the underlying hardware appliances. This approach brings a new level of flexibility in network services deployment for rapid composition, migration and scaling based on changing traffic load and current demand, leading to a higher QoS. Moreover, it allows introducing DevOps approach in the development process resulting in reduced life-cycle and shorter time-to-market. However, in order to realize the anticipated benefits of NFV, developers and network operators need mechanisms to adequately test Virtualized Network Functions (VNF) against different deployment scenarios and in different scales. To this end, we introduce a new library for light-weight automated functional testing of VNFs. It helps the developers to write functional tests in Python and run them on different platforms. Using the library, test developers choose which infrastructure to use, which network services and test VNFs to launch, how to interconnect them, how to trigger the test process and inspect, verify and validate the output against the expected values and conditions. Test developers can use network service packages to deploy services or can compose them in a test code using different parameters to simulate various deployment scenarios. Finally, the library can be used to set automated testing in CI/CD environments or can be used locally during the development phase. In this paper, we describe the architecture of the library, the basic workflow and give an example of testing multiple flavors of a network service using the same code.","PeriodicalId":394933,"journal":{"name":"2019 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114591473","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

NFV-driven intrusion detection for smart manufacturing 面向智能制造的nfv驱动入侵检测

2019 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN) Pub Date : 2019-11-01 DOI: 10.1109/NFV-SDN47374.2019.9039956

D. Behnke, M. Müller, Patrick-Benjamin Bök, Stefan Schneider, Manuel Peuster, H. Karl, Alberto Rocha, M. Mesquita, José Bonnet

引用次数: 3

DataPlane Broker: Open WAN control for multi-site service orchestration DataPlane Broker:用于多站点服务编排的开放WAN控制

2019 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN) Pub Date : 2019-11-01 DOI: 10.1109/NFV-SDN47374.2019.9040084

Steven Simpson, Arsham Farshad, Paul Mccherry, Abubakr Magzoub, Will Fantom, Charalampos Rotsos, N. Race, D. Hutchison

{"title":"DataPlane Broker: Open WAN control for multi-site service orchestration","authors":"Steven Simpson, Arsham Farshad, Paul Mccherry, Abubakr Magzoub, Will Fantom, Charalampos Rotsos, N. Race, D. Hutchison","doi":"10.1109/NFV-SDN47374.2019.9040084","DOIUrl":"https://doi.org/10.1109/NFV-SDN47374.2019.9040084","url":null,"abstract":"NFV-MANO has become the de-facto standard for network service orchestration in future programmable network infrastructures. Relevant standards define an architecture and a data model that allows an orchestration entity to deploy, dynamically configure and monitor virtual and physical network functions across virtualized datacenters. Although the model offers extensive details for network function management and host-level network configuration, end-to-end connectivity management beyond the datacenter remains limited. The responsibility for cross-site connectivity is delegated to a control abstraction, the WAN Infrastructure Manager (WIM), which is partially defined in relevant standards. The reference implementation of the NFVMANO standards, Open Source MANO (OSM), has recently released a reference WIM driver model, but no open-source WIM implementation is currently available, thus restricting the ability of researchers to experiment with multi-site service deployments. In this paper, we present the DataPlane Broker (DPB), the first open-source WIM implementation for software-defined networks. Using an extensive data model, DPB seamlessly translates NFVMANO requirements into SDN configuration, supporting point-to-point and multipoint connectivity with strong bandwidth guarantees. DPB is integrated with OSM FIVE via a WIM plugin. Initial experiments highlight that path computation can scale to large network topologies and a large number of services, with negligible computational overheads, while DPB increases by less than 10% the overall deployment delay of an OSM service.","PeriodicalId":394933,"journal":{"name":"2019 IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131602563","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