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

VirtPhy: A fully programmable infrastructure for efficient NFV in small data centers VirtPhy:一个完全可编程的基础设施，用于小型数据中心的高效NFV

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

C. Dominicini, G. Vassoler, M. Ribeiro, M. Martinello

引用次数: 8

Automated virtual network functions onboarding 自动化虚拟网络功能上线

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

C. Makaya, Douglas M. Freimuth

引用次数: 9

A security services platform for Software Defined Networks 软件定义网络的安全服务平台

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

Sinan Tatlicioglu, S. Civanlar, B. Gorkemli, Erhan Lokman, A. M. Balci, C. B. Eliacik

引用次数: 1

Efficient service auto-discovery for next generation network slicing architecture 面向下一代网络切片架构的高效服务自动发现

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

Salvatore Talarico, K. Makhijani, P. Pillay-Esnault

{"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}

引用次数: 3

High performance flow matching architecture for OpenFlow data plane OpenFlow数据平面的高性能流匹配架构

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

V. B. Wijekoon, T. Dananjaya, P. H. Kariyawasam, S. Iddamalgoda, A. Pasqual

引用次数: 3

Distributed service orchestration: Interweaving switch and service functions across domains 分布式业务编排:跨域交织交换机和业务功能

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

Qiong Zhang, Xi Wang, P. Palacharla, T. Ikeuchi

引用次数: 1

A model to select the right infrastructure abstraction for Service Function Chaining 为服务功能链选择正确的基础结构抽象的模型

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

Thomas Soenen, Sahel Sahhaf, W. Tavernier, Pontus Sköldström, D. Colle, M. Pickavet

{"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}

引用次数: 10

Co-Scaler: Cooperative scaling of software-defined NFV service function chain Co-Scaler:软件定义NFV业务功能链的协同扩展

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

Bin Zhang, Pengfei Zhang, Yusu Zhao, Yongkun Wang, Xuan Luo, Yaohui Jin

引用次数: 23

Revisiting NFV orchestration with routing games 通过路由游戏重新审视NFV编排

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

M. Obadia, J. Rougier, L. Iannone, V. Conan, M. Bouet

{"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}

引用次数: 16

Backup rules in Software-Defined Networks 软件定义网络中的备份规则

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

Niels L. M. van Adrichem, F. Iqbal, F. Kuipers

{"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}

引用次数: 15