Pub Date : 2018-06-25DOI: 10.1109/NETSOFT.2018.8459903
Marco de Benedictis, A. Lioy, Paolo Smiraglia
Modern ICT infrastructures are evolving thanks to the advantages offered by virtualisation in terms of flexibility, scalability, and savings on hardware-related costs. More recently, virtualisation has gained momentum in the Internet Service Providers' infrastructures as well, where Software Defined Networking and Network Function Virtualisation paradigms propose programmability of the network and the softwarisation of proprietary hardware appliances. In this scenario, lightweight virtualisation technologies, such as Linux containers, have a significant role, as they address the needs for scalability, availability and fast deployment to support the software-based network infrastructures. In this paper, we focus on defining a reusable design for a container-based Virtual Network Security Function, by highlighting the peculiarities of its architecture compared to a Virtual Machine-based instance. Moreover, we present a prototype application of this architecture to implement an HTTP reverse proxy with application-layer filtering capabilities, tailored for the NFV Security-as-a-Service scenario. We evaluate the performance of this prototype and compare it to the results of alternative deployments, namely the Virtual Machine and bare-metal solutions. Finally, we evaluate the proposed solution in a load-balancing scenario, for increased throughput and availability.
{"title":"Container-based design of a Virtual Network Security Function","authors":"Marco de Benedictis, A. Lioy, Paolo Smiraglia","doi":"10.1109/NETSOFT.2018.8459903","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8459903","url":null,"abstract":"Modern ICT infrastructures are evolving thanks to the advantages offered by virtualisation in terms of flexibility, scalability, and savings on hardware-related costs. More recently, virtualisation has gained momentum in the Internet Service Providers' infrastructures as well, where Software Defined Networking and Network Function Virtualisation paradigms propose programmability of the network and the softwarisation of proprietary hardware appliances. In this scenario, lightweight virtualisation technologies, such as Linux containers, have a significant role, as they address the needs for scalability, availability and fast deployment to support the software-based network infrastructures. In this paper, we focus on defining a reusable design for a container-based Virtual Network Security Function, by highlighting the peculiarities of its architecture compared to a Virtual Machine-based instance. Moreover, we present a prototype application of this architecture to implement an HTTP reverse proxy with application-layer filtering capabilities, tailored for the NFV Security-as-a-Service scenario. We evaluate the performance of this prototype and compare it to the results of alternative deployments, namely the Virtual Machine and bare-metal solutions. Finally, we evaluate the proposed solution in a load-balancing scenario, for increased throughput and availability.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113961472","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 : 2018-06-25DOI: 10.1109/NETSOFT.2018.8460139
T. Ahmed, Abdelhamid Alleg, R. Ferrús, R. Riggio
This paper proposes an architecture framework for the realization of on-demand satellite network slicing that is built on the introduction of Software Defined Networking (SDN) and Network Function Virtualization (NFV) technologies. In this way, service delivery with satellite networks is shifted from a network for connectivity model to a network for service model with a high degree of service customization and adaptability, including satellite bandwidth on-demand. Under this framework, we study the resource orchestration of satellite network services by formulating the on-demand network slicing as an optimization problem that provides flexible service chaining and provisioning taking into account diversified service requirements. The objective is to determine the optimal resource allocation for supporting a satellite network slice that minimizes resources consumption while meeting service specification requirements such as the end-to-end delay.
{"title":"On-Demand Network Slicing using SDN/NFV-enabled Satellite Ground Segment Systems","authors":"T. Ahmed, Abdelhamid Alleg, R. Ferrús, R. Riggio","doi":"10.1109/NETSOFT.2018.8460139","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8460139","url":null,"abstract":"This paper proposes an architecture framework for the realization of on-demand satellite network slicing that is built on the introduction of Software Defined Networking (SDN) and Network Function Virtualization (NFV) technologies. In this way, service delivery with satellite networks is shifted from a network for connectivity model to a network for service model with a high degree of service customization and adaptability, including satellite bandwidth on-demand. Under this framework, we study the resource orchestration of satellite network services by formulating the on-demand network slicing as an optimization problem that provides flexible service chaining and provisioning taking into account diversified service requirements. The objective is to determine the optimal resource allocation for supporting a satellite network slice that minimizes resources consumption while meeting service specification requirements such as the end-to-end delay.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121412093","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 : 2018-06-25DOI: 10.1109/NETSOFT.2018.8459917
A. Barakabitze, I. Mkwawa, Lingfen Sun, E. Ifeachor
In this paper, we present a novel QoE-aware SDN/NFV system by utilizing and integrating Multi-path TCP (MPTCP) and Segment Routing (SR) paradigms. We propose a QoE-based Multipath Source Routing (QoEMuSoRo) algorithm that achieve an optimized end-to-end QoE for the end-user by forwarding MPTCP subflows using SR over SDN/NFV. We implement and validate the proposed scheme through DASH experiments using Mininet and POX controller. To demonstrate the effectiveness of our proposal, we compare the performance of our QoE-aware MPTCP SDN/NFV SR-based proposal, the MPTCP and regular TCP in terms of system throughput and the end-user's QoE. Preliminary results shows that, our approach outperforms the other aforementioned methods.
{"title":"QualitySDN: Improving Video Quality using MPTCP and Segment Routing in SDN/NFV","authors":"A. Barakabitze, I. Mkwawa, Lingfen Sun, E. Ifeachor","doi":"10.1109/NETSOFT.2018.8459917","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8459917","url":null,"abstract":"In this paper, we present a novel QoE-aware SDN/NFV system by utilizing and integrating Multi-path TCP (MPTCP) and Segment Routing (SR) paradigms. We propose a QoE-based Multipath Source Routing (QoEMuSoRo) algorithm that achieve an optimized end-to-end QoE for the end-user by forwarding MPTCP subflows using SR over SDN/NFV. We implement and validate the proposed scheme through DASH experiments using Mininet and POX controller. To demonstrate the effectiveness of our proposal, we compare the performance of our QoE-aware MPTCP SDN/NFV SR-based proposal, the MPTCP and regular TCP in terms of system throughput and the end-user's QoE. Preliminary results shows that, our approach outperforms the other aforementioned methods.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121805922","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 : 2018-06-01DOI: 10.1109/NETSOFT.2018.8460090
Tuan A. Tang, L. Mhamdi, D. McLernon, Syed Ali Raza Zaidi, M. Ghogho
Software Defined Networking (SDN) has emerged as a key enabler for future agile Internet architecture. Nevertheless, the flexibility provided by SDN architecture manifests several new design issues in terms of network security. These issues must be addressed in a unified way to strengthen overall network security for future SDN deployments. Consequently, in this paper, we propose a Gated Recurrent Unit Recurrent Neural Network (GRU-RNN) enabled intrusion detection systems for SDNs. The proposed approach is tested using the NSL-KDD dataset, and we achieve an accuracy of 89% with only six raw features. Our experiment results also show that the proposed GRU-RNN does not deteriorate the network performance. Through extensive experiments, we conclude that the proposed approach exhibits a strong potential for intrusion detection in the SDN environments.
{"title":"Deep Recurrent Neural Network for Intrusion Detection in SDN-based Networks","authors":"Tuan A. Tang, L. Mhamdi, D. McLernon, Syed Ali Raza Zaidi, M. Ghogho","doi":"10.1109/NETSOFT.2018.8460090","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8460090","url":null,"abstract":"Software Defined Networking (SDN) has emerged as a key enabler for future agile Internet architecture. Nevertheless, the flexibility provided by SDN architecture manifests several new design issues in terms of network security. These issues must be addressed in a unified way to strengthen overall network security for future SDN deployments. Consequently, in this paper, we propose a Gated Recurrent Unit Recurrent Neural Network (GRU-RNN) enabled intrusion detection systems for SDNs. The proposed approach is tested using the NSL-KDD dataset, and we achieve an accuracy of 89% with only six raw features. Our experiment results also show that the proposed GRU-RNN does not deteriorate the network performance. Through extensive experiments, we conclude that the proposed approach exhibits a strong potential for intrusion detection in the SDN environments.","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":"126620939","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 : 2018-06-01DOI: 10.1109/NETSOFT.2018.8459986
S. Ahvar, Jagruti Sahoo, E. Ahvar, Mouhamad Dieye, R. Glitho, H. Elbiaze, N. Crespi
Value-added services (VASs) are an integral part of todays Content Delivery Networks (CDNs). They can be implemented as a chain of Virtual Network Functions (VNFs). These chains need to be placed in an efficient way in CDNs in order to optimize quality of service (QoS) for end-users(EUs) while minimizing cost for providers. We formulate the problem as an Integer Linear Program (ILP) and propose a Pattern-based Cost-efficient Proactive VNF placement and chaining (PCPV) algorithm. The objective is to find the optimal number, location and chaining of VNFs in such a manner that the cost is minimized while QoS is met. Apart from cost minimization, the support for large-scale CDNs with a large number of physical machines (servers) and EUs is an important feature of the proposed algorithm. Through simulations, the algorithm behavior for small-scale to large scale CDN networks is analyzed.
{"title":"PCPV: Pattern-based Cost-efficient Proactive VNF placement and chaining for value-added services in content delivery networks","authors":"S. Ahvar, Jagruti Sahoo, E. Ahvar, Mouhamad Dieye, R. Glitho, H. Elbiaze, N. Crespi","doi":"10.1109/NETSOFT.2018.8459986","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8459986","url":null,"abstract":"Value-added services (VASs) are an integral part of todays Content Delivery Networks (CDNs). They can be implemented as a chain of Virtual Network Functions (VNFs). These chains need to be placed in an efficient way in CDNs in order to optimize quality of service (QoS) for end-users(EUs) while minimizing cost for providers. We formulate the problem as an Integer Linear Program (ILP) and propose a Pattern-based Cost-efficient Proactive VNF placement and chaining (PCPV) algorithm. The objective is to find the optimal number, location and chaining of VNFs in such a manner that the cost is minimized while QoS is met. Apart from cost minimization, the support for large-scale CDNs with a large number of physical machines (servers) and EUs is an important feature of the proposed algorithm. Through simulations, the algorithm behavior for small-scale to large scale CDN networks is analyzed.","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":"128461258","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 : 2018-06-01DOI: 10.1109/NETSOFT.2018.8460050
Charalampos Rotsos, Arsham Farshad, D. King, D. Hutchison, Qianru Zhou, A. Gray, Chengxiang Wang, S. Mclaughlin
Modern Software Defined Networking (SDN) control stacks consist of multiple abstraction and virtualization layers to enable flexibility in the development of new control features. Rich data modeling frameworks are essential when sharing information across control layers. Unfortunately, existing Network Operating System (NOS) data modeling capabilities are limited to simple type-checking and code templating. We present an exploration of a more extreme point on SDN data modeling: ReasoNet. Developers can use semantic web technologies to enrich their data models with reasoning rules and integrity/consistency constraints, and automate state inference across layers. We demonstrate the ability of ReasoNet to automate state verification and cross-layer debugging, through the implementation of two popular control applications, a learning switch and a Quality of Service (QoS) policy engine.
现代软件定义网络(SDN)控制栈由多个抽象层和虚拟化层组成，可以灵活地开发新的控制特性。在跨控制层共享信息时，富数据建模框架是必不可少的。不幸的是，现有的Network Operating System (NOS)数据建模功能仅限于简单的类型检查和代码模板。我们对SDN数据建模的一个更极端的点进行了探索:ReasoNet。开发人员可以使用语义web技术通过推理规则和完整性/一致性约束来丰富他们的数据模型，并自动跨层进行状态推断。我们通过实现两个流行的控制应用程序，一个学习开关和一个服务质量(QoS)策略引擎，展示了ReasoNet自动状态验证和跨层调试的能力。
{"title":"ReasoNet: Inferring Network Policies Using Ontologies","authors":"Charalampos Rotsos, Arsham Farshad, D. King, D. Hutchison, Qianru Zhou, A. Gray, Chengxiang Wang, S. Mclaughlin","doi":"10.1109/NETSOFT.2018.8460050","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8460050","url":null,"abstract":"Modern Software Defined Networking (SDN) control stacks consist of multiple abstraction and virtualization layers to enable flexibility in the development of new control features. Rich data modeling frameworks are essential when sharing information across control layers. Unfortunately, existing Network Operating System (NOS) data modeling capabilities are limited to simple type-checking and code templating. We present an exploration of a more extreme point on SDN data modeling: ReasoNet. Developers can use semantic web technologies to enrich their data models with reasoning rules and integrity/consistency constraints, and automate state inference across layers. We demonstrate the ability of ReasoNet to automate state verification and cross-layer debugging, through the implementation of two popular control applications, a learning switch and a Quality of Service (QoS) policy engine.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"16 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":"124646615","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 : 2018-06-01DOI: 10.1109/NETSOFT.2018.8460024
Christian Grasso, G. Schembra
One of the main goals of the new fifth generation of cellular networks (5G) is to provide the programmability, flexibility, and modularity that are required to create multiple logical networks, called network slices, each tailored for a given vertical use case, on top of a common network infrastructure. A particular network slice that is expected to be able to create a plethora of new opportunities and applications, is the Tactile Internet, aiming at guaranteeing e2e delays not greater than 1 ms to its users. Matching this very severe requirement does not only depend on the length of the physical path that information should follow flowing from sensors to actuators, but also on the size of each information. This is the case of a video-surveillance system that uses Unmanned Aerial Vehicles (UAV) to capture high-resolution images with a frame rate of thousands frames per second. Considering this kind of scenarios, this paper proposes a Tactile Internet architecture for video-surveillance systems. An analytical model based on Markov chains is defined to evaluate delays and job loss probability in order to allow designers to dimension system elements to be compliant with the Tactile Internet requirements.
{"title":"Design of a UAV-Based Videosurveillance System with Tactile Internet Constraints in a 5G Ecosystem","authors":"Christian Grasso, G. Schembra","doi":"10.1109/NETSOFT.2018.8460024","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8460024","url":null,"abstract":"One of the main goals of the new fifth generation of cellular networks (5G) is to provide the programmability, flexibility, and modularity that are required to create multiple logical networks, called network slices, each tailored for a given vertical use case, on top of a common network infrastructure. A particular network slice that is expected to be able to create a plethora of new opportunities and applications, is the Tactile Internet, aiming at guaranteeing e2e delays not greater than 1 ms to its users. Matching this very severe requirement does not only depend on the length of the physical path that information should follow flowing from sensors to actuators, but also on the size of each information. This is the case of a video-surveillance system that uses Unmanned Aerial Vehicles (UAV) to capture high-resolution images with a frame rate of thousands frames per second. Considering this kind of scenarios, this paper proposes a Tactile Internet architecture for video-surveillance systems. An analytical model based on Markov chains is defined to evaluate delays and job loss probability in order to allow designers to dimension system elements to be compliant with the Tactile Internet requirements.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"2 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":"126666794","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 : 2018-06-01DOI: 10.1109/NETSOFT.2018.8460064
D. Sanvito, Daniele Moro, Mattia Gulli, I. Filippini, A. Capone, Andrea Campanella
Software-Defined Networking (SDN) brought an unprecedented flexibility and programmability into computer networks. In order to simplify the management of an SDN network, several high-level languages have been proposed. The Intent Framework provided by Open Network Operating System (ONOS), for example, allows programmers to specify high-level policies without worrying about low-level device details, which are inferred by the controller. In addition, the Intent Framework ensures that the objective is met by transparently re-compiling the intents as a consequence of environment changes (e.g. link failures). In this work we extend the Intent Framework to make it able to both compile multiple intents together and to re-optimize their paths according to the network state based on flow statistics. We present Intent Monitor and Reroute service, a new ONOS module to optimize traffic forwarding of any ONOS applications based on intents, via an external plug&play routing logic with no modifications to ONOS applications at all. Finally we evaluate the benefits by enhancing the ONOS SDN-IP application with an adaptive Robust Traffic Engineering algorithm.
{"title":"ONOS Intent Monitor and Reroute service: enabling plug&play routing logic","authors":"D. Sanvito, Daniele Moro, Mattia Gulli, I. Filippini, A. Capone, Andrea Campanella","doi":"10.1109/NETSOFT.2018.8460064","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8460064","url":null,"abstract":"Software-Defined Networking (SDN) brought an unprecedented flexibility and programmability into computer networks. In order to simplify the management of an SDN network, several high-level languages have been proposed. The Intent Framework provided by Open Network Operating System (ONOS), for example, allows programmers to specify high-level policies without worrying about low-level device details, which are inferred by the controller. In addition, the Intent Framework ensures that the objective is met by transparently re-compiling the intents as a consequence of environment changes (e.g. link failures). In this work we extend the Intent Framework to make it able to both compile multiple intents together and to re-optimize their paths according to the network state based on flow statistics. We present Intent Monitor and Reroute service, a new ONOS module to optimize traffic forwarding of any ONOS applications based on intents, via an external plug&play routing logic with no modifications to ONOS applications at all. Finally we evaluate the benefits by enhancing the ONOS SDN-IP application with an adaptive Robust Traffic Engineering algorithm.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"17 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":"130220118","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 : 2018-06-01DOI: 10.1109/NETSOFT.2018.8459912
D. Anantha, B. Ramamurthy, B. Bockelman, D. Swanson
Network Function Virtualization (NFV) brings a new set of challenges when deploying virtualized services on commercial-off-the-shelf (COTS) hardware. Network functions can be dynamically managed to provide the necessary services on-demand and further, services can be chained together to form a larger composite. In this paper, we address an important technical problem of mapping service function chains (SFCs) across different data centers with the objective of reducing the flow processing costs. We develop an integer linear programming (ILP) formulation to optimally map service function chains to multiple data centers while adhering to the data center's capacity constraints. We propose a novel application-aware flow reduction (AAFR) algorithm to simplify the SFC-ILP to significantly reduce the number of flows processed by the SFCs. We perform a thorough study of the SFC mapping problem for multiple data centers and evaluate the performance of our proposed approach with respect to three parameters: i) impact of number of SFCs and SFC length on flow processing cost, ii) capacitated/uncapacitated flow processing cost gains, and iii) balancing flow-to-SFC mappings across data centers. Our evaluations show that our proposed AAFR algorithm reduces flow-processing costs by 70% for the capacitated-SFC mapping case over the SFC-ILP. In addition, our uncapacitated AAFR (AAFR-U) algorithm provides a further 4.1% cost-gain over its capacitated counterpart (AAFR-C).
{"title":"Optimized Service Chain Mapping and reduced flow processing with Application-Awareness","authors":"D. Anantha, B. Ramamurthy, B. Bockelman, D. Swanson","doi":"10.1109/NETSOFT.2018.8459912","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8459912","url":null,"abstract":"Network Function Virtualization (NFV) brings a new set of challenges when deploying virtualized services on commercial-off-the-shelf (COTS) hardware. Network functions can be dynamically managed to provide the necessary services on-demand and further, services can be chained together to form a larger composite. In this paper, we address an important technical problem of mapping service function chains (SFCs) across different data centers with the objective of reducing the flow processing costs. We develop an integer linear programming (ILP) formulation to optimally map service function chains to multiple data centers while adhering to the data center's capacity constraints. We propose a novel application-aware flow reduction (AAFR) algorithm to simplify the SFC-ILP to significantly reduce the number of flows processed by the SFCs. We perform a thorough study of the SFC mapping problem for multiple data centers and evaluate the performance of our proposed approach with respect to three parameters: i) impact of number of SFCs and SFC length on flow processing cost, ii) capacitated/uncapacitated flow processing cost gains, and iii) balancing flow-to-SFC mappings across data centers. Our evaluations show that our proposed AAFR algorithm reduces flow-processing costs by 70% for the capacitated-SFC mapping case over the SFC-ILP. In addition, our uncapacitated AAFR (AAFR-U) algorithm provides a further 4.1% cost-gain over its capacitated counterpart (AAFR-C).","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"39 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":"130474206","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 : 2018-06-01DOI: 10.1109/NETSOFT.2018.8460013
Oussama Soualah, Marouen Mechtri, Chaima Ghribi, D. Zeghlache
This paper proposes an Integer Linear Program (ILP) to address the Virtualized Network Function Forwarding Graph (VNF-FG) placement and chaining problem when VNFs are shared across tenants to optimize resource usage and increase provider revenue. Since ILP approaches do not scale well with problem size, the proposed algorithm selects a limited number of candidate hosts from the infrastructure to control complexity. The proposed on line ILP based heuristic is shown to outperform a tree based algorithm from the state of the art that relies also on sharing of VNFs to improve resource utilization. Results from extensive simulations report the achieved performance improvements in terms of rejection of service requests, energy consumption, scalability and attained revenues. Limiting the number of candidate hosts is an efficient way to tune the ILP to ensure scalability and to find good VNF-FG placement solutions for large problem sizes.
{"title":"A Green VNF-FG Embedding Algorithm","authors":"Oussama Soualah, Marouen Mechtri, Chaima Ghribi, D. Zeghlache","doi":"10.1109/NETSOFT.2018.8460013","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8460013","url":null,"abstract":"This paper proposes an Integer Linear Program (ILP) to address the Virtualized Network Function Forwarding Graph (VNF-FG) placement and chaining problem when VNFs are shared across tenants to optimize resource usage and increase provider revenue. Since ILP approaches do not scale well with problem size, the proposed algorithm selects a limited number of candidate hosts from the infrastructure to control complexity. The proposed on line ILP based heuristic is shown to outperform a tree based algorithm from the state of the art that relies also on sharing of VNFs to improve resource utilization. Results from extensive simulations report the achieved performance improvements in terms of rejection of service requests, energy consumption, scalability and attained revenues. Limiting the number of candidate hosts is an efficient way to tune the ILP to ensure scalability and to find good VNF-FG placement solutions for large problem sizes.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"29 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":"130741043","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
扫码关注我们
求助内容：
应助结果提醒方式：