The Experts below are selected from a list of 217932 Experts worldwide ranked by ideXlab platform
Brigitte Jaumard - One of the best experts on this subject based on the ideXlab platform.
-
Energy-Efficient Service Function Chain Provisioning
Journal of optical communications and networking, 2018Co-Authors: Nicolas Huin, Andrea Tomassilli, Frédéric Giroire, Brigitte JaumardAbstract:Network Function Virtualization (NFV) is a promising network architecture concept to reduce operational costs. In legacy networks, network Functions, such as firewall or TCP optimization, are performed by specific hardware. In networks enabling NFV coupled with the Software Defined Network (SDN) paradigm, Virtual Network Functions (VNFs) can be implemented dynamically on generic hardware. This is of primary interest to implement energy efficient solutions, in order to adapt the resource usage dynamically to the demand. In this paper, we study how to use NFV coupled with SDN to improve the energy efficiency of networks. We consider a setting in which a flow has to go through a Service Function Chain, that is several network Functions in a specific order. We propose an ILP formulation, an ILP-based heuristic, as well as a decomposition model that relies on joint routing and placement configuration to solve the problem. We show that virtualization provides between 22% to 62% of energy savings for networks of different sizes.
-
Energy-efficient service Function Chain provisioning
IEEE OSA Journal of Optical Communications and Networking, 2018Co-Authors: Nicolas Huin, Andrea Tomassilli, Frédéric Giroire, Brigitte JaumardAbstract:Network Function virtualization (NFV) is a promising network architecture concept to reduce operational costs. In legacy networks, network Functions, such as firewall or TCP optimization, are performed by specific hardware. In networks enabling NFV coupled with the software defined network (SDN) paradigm, virtual network Functions (VNFs) can be implemented dynamically on generic hardware. This is of primary interest to implement energy-efficient solutions, in order to adapt the resource usage dynamically to the demand. In this paper, we study how to use NFV coupled with an SDN to improve the energy efficiency of networks.We consider a setting inwhich a flowhas to go through a service Function Chain, which is several network Functions in a specific order.We propose an integer linear programming (ILP) formulation, an ILP-based heuristic, and a decomposition model that relies on joint routing and placement configuration to solve the problem. We show that virtualization provides between 22% and 62% of energy savings for networks of different sizes.
-
Energy-Efficient Service Function Chain Provisioning
2017Co-Authors: Nicolas Huin, Andrea Tomassilli, Frédéric Giroire, Brigitte JaumardAbstract:Network Function Virtualization (NFV) is a promising network architecture concept to reduce operational costs. In legacy networks, network Functions, such as firewall or TCP optimization, are performed by specific hardware. In networks enabling NFV coupled with the Software Defined Network (SDN) paradigm, network Functions can be implemented dynamically on generic hardware. This is of primary interest to implement energy efficient solutions, in order to adapt dynamically the resource usage to the demands. In this paper, we study how to use NFV coupled with SDN to improve the energy efficiency of networks. We consider a setting in which a flow has to go through a Service Function Chain, that is several network Functions in a specific order. We propose a decomposition model that relies on Chaining and Function placement configurations to solve the problem. We show that virtualization allows to obtain between 15% to 62 % of energy savings for networks of different sizes.
-
Energy-Efficient Service Function Chain Provisioning
2016Co-Authors: Nicolas Huin, Andrea Tomassilli, Frédéric Giroire, Brigitte JaumardAbstract:Network Function Virtualization (NFV) is a promising network architecture concept to reduce operational costs. In legacy networks, network Functions, such as firewall or TCP optimization, are performed by specific hardware. In networks enabling NFV coupled with the Software Defined Network (SDN) paradigm, network Functions can be implemented dynamically on generic hardware. This is of primary interest to implement energy efficient solutions, which imply to adapt dynamically the resource usage to the demands. In this paper, we study how to use NFV coupled with SDN to improve the energy efficiency of networks. We consider a setting in which a flow has to go through a Service Function Chain, that is several network Functions in a specific order. We propose a decomposition model that relies on lightpath configuration to solve the problem. We show that virtualization allows to obtain between 30% to 55 % of energy savings for networks of different sizes.
Gang Sun - One of the best experts on this subject based on the ideXlab platform.
-
profit maximization of online service Function Chain orchestration in an inter datacenter elastic optical network
IEEE Transactions on Network and Service Management, 2021Co-Authors: Zhenrong Chen, Gang Sun, Mohsen GuizaniAbstract:To meet the increasing traffic demands characterized by large bandwidth and high burstiness, more traffic has been moving to inter-datacenter elastic optical networks (inter-DC EONs) for processing. The integration of two emerging paradigms, network Function virtualization (NFV) and software-defined networking (SDN), enables Internet service providers (ISPs) to deploy service Function Chains (SFCs) from users flexibly while reducing operational and capital expenditures. This article focuses on the problem of online SFC provisioning in inter-DC-EONs with the aim of maximizing ISP profits, where the challenge in jointly allocating IT and spectrum resources when deploying SFCs is balanced with the deployment costs of processing as many user requests as possible. We design two-phase time-efficient orchestration algorithms for online SFC requests and the strategy of SFC splitting is adopted to improve the utilization of spectrum resources on fiber links. Simulation results show that, compared with the existing algorithm, our proposed algorithms significantly shorten the deployment time, improve total profit of ISP by up to 40% and reduce the blocking probability by up to 35%.
-
cost efficient service Function Chain orchestration for low latency applications in nfv networks
IEEE Systems Journal, 2019Co-Authors: Gang Sun, Dan Liao, Gungyang Zhu, Mohsen GuizaniAbstract:With the popularization and development of cloud computing, network Function virtualization and service Function Chain (SFC) provisioning have attracted increasing attention from researchers. Excellent and reliable network service is important for network development. Moreover, as the number of network users increases, network service construction costs become very high. Therefore, an efficient algorithm is necessary to provide an SFC with excellent performance and low resource costs. In this paper, we re-examine the problem of optimizing the deployment of an SFC to provide users with excellent and resource-saving network service. We propose a heuristic, closed-loop feedback (CLF) algorithm to find the shortest path to map an SFC. To solve the problem, we introduce and integrate a restricted Boltzmann machine and cross entropy to improve the performance of CLF. Simulation results demonstrate the excellent performance of CLF. The communication delay is reduced by approximately 20%, the accept ratio improves by approximately 15%, and the algorithm running time decreases by approximately 20%. In addition, the resource utilization ratio increases by approximately 15%, and the resource fragmentation ratio decreases by approximately 50%.
-
low latency orchestration for workflow oriented service Function Chain in edge computing
Future Generation Computer Systems, 2018Co-Authors: Gang Sun, Dan Liao, Victor ChangAbstract:Abstract To realize a cost-efficient, affordable, economical, flexible, elastic and innovative network service, the concepts of Network Function Virtualization (NFV) and Software-Defined Network (SDN) have emerged in edge computing. In the case of NFV deployment, most research regards the deployment of Service Function Chaining (SFC), which is composed of several series-connected Virtual Network Functions (VNFs). Current NFV deployment approaches concern how to efficiently deploy the Chaining service requests. They do not consider the possible form of the service requests in edge computing. Furthermore, the study regarding response latency in NFV is limited to the Chaining service requests. Most studies consider the deployment of several VNFs in one SFC onto the same substrate node to reduce the total latency and resource consumptions. In this paper, we first propose a novel workflow-like service request (WFR), which is completely different from the Chaining service request. Then, a Dynamic Minimum Response Time considering Same Level (DMRT_SL) has been proposed to efficiently map the workflow-like requests in edge computing. We use a randomly generated topology as our underlying network. It can be seen from the data obtained from a large number of simulation experiments that DMRT_SL not only is particularly outstanding in terms of response time delay but that blocking rate and deploy time behavior are also particularly surprising.
-
service Function Chain orchestration across multiple domains a full mesh aggregation approach
IEEE Transactions on Network and Service Management, 2018Co-Authors: Gang Sun, Dan Liao, Victor ChangAbstract:Generally, a service request must specify its required virtual network Functions (VNFs) and their specific order, which is known as the service Function Chain (SFC). When mapping SFCs, network providers face many challenges due to the requirements of maintaining the correct order and satisfying other constraints of VNFs. Furthermore, SFC orchestration becomes a more difficult problem when considered in multi-domain networks, because the confidentiality of the topology information of each domain must be considered. In this paper, we study the problem of SFC orchestration across multiple domains. We first use the full mesh aggregation approach to construct an abstracted network to guide the orchestration process, and then propose two efficient methods for SFC partitioning. Based on the SFC partitioning results, we also propose two heuristic algorithms for deploying the sub-Chains in multiple domains. Moreover, when the partitioning results cannot be mapped completely, a feedback mechanism is used to repartition the SFC and improve the success ratio of orchestrating the SFC. Finally, to save bandwidth resources, we further improve our heuristic algorithms by migrating the deployment position of VNFs. The simulation results demonstrate that our proposed algorithm achieves better performance compared to existing solutions.
Nicolas Huin - One of the best experts on this subject based on the ideXlab platform.
-
Energy-Efficient Service Function Chain Provisioning
Journal of optical communications and networking, 2018Co-Authors: Nicolas Huin, Andrea Tomassilli, Frédéric Giroire, Brigitte JaumardAbstract:Network Function Virtualization (NFV) is a promising network architecture concept to reduce operational costs. In legacy networks, network Functions, such as firewall or TCP optimization, are performed by specific hardware. In networks enabling NFV coupled with the Software Defined Network (SDN) paradigm, Virtual Network Functions (VNFs) can be implemented dynamically on generic hardware. This is of primary interest to implement energy efficient solutions, in order to adapt the resource usage dynamically to the demand. In this paper, we study how to use NFV coupled with SDN to improve the energy efficiency of networks. We consider a setting in which a flow has to go through a Service Function Chain, that is several network Functions in a specific order. We propose an ILP formulation, an ILP-based heuristic, as well as a decomposition model that relies on joint routing and placement configuration to solve the problem. We show that virtualization provides between 22% to 62% of energy savings for networks of different sizes.
-
Energy-efficient service Function Chain provisioning
IEEE OSA Journal of Optical Communications and Networking, 2018Co-Authors: Nicolas Huin, Andrea Tomassilli, Frédéric Giroire, Brigitte JaumardAbstract:Network Function virtualization (NFV) is a promising network architecture concept to reduce operational costs. In legacy networks, network Functions, such as firewall or TCP optimization, are performed by specific hardware. In networks enabling NFV coupled with the software defined network (SDN) paradigm, virtual network Functions (VNFs) can be implemented dynamically on generic hardware. This is of primary interest to implement energy-efficient solutions, in order to adapt the resource usage dynamically to the demand. In this paper, we study how to use NFV coupled with an SDN to improve the energy efficiency of networks.We consider a setting inwhich a flowhas to go through a service Function Chain, which is several network Functions in a specific order.We propose an integer linear programming (ILP) formulation, an ILP-based heuristic, and a decomposition model that relies on joint routing and placement configuration to solve the problem. We show that virtualization provides between 22% and 62% of energy savings for networks of different sizes.
-
Energy-Efficient Service Function Chain Provisioning
2017Co-Authors: Nicolas Huin, Andrea Tomassilli, Frédéric Giroire, Brigitte JaumardAbstract:Network Function Virtualization (NFV) is a promising network architecture concept to reduce operational costs. In legacy networks, network Functions, such as firewall or TCP optimization, are performed by specific hardware. In networks enabling NFV coupled with the Software Defined Network (SDN) paradigm, network Functions can be implemented dynamically on generic hardware. This is of primary interest to implement energy efficient solutions, in order to adapt dynamically the resource usage to the demands. In this paper, we study how to use NFV coupled with SDN to improve the energy efficiency of networks. We consider a setting in which a flow has to go through a Service Function Chain, that is several network Functions in a specific order. We propose a decomposition model that relies on Chaining and Function placement configurations to solve the problem. We show that virtualization allows to obtain between 15% to 62 % of energy savings for networks of different sizes.
-
Energy-Efficient Service Function Chain Provisioning
2016Co-Authors: Nicolas Huin, Andrea Tomassilli, Frédéric Giroire, Brigitte JaumardAbstract:Network Function Virtualization (NFV) is a promising network architecture concept to reduce operational costs. In legacy networks, network Functions, such as firewall or TCP optimization, are performed by specific hardware. In networks enabling NFV coupled with the Software Defined Network (SDN) paradigm, network Functions can be implemented dynamically on generic hardware. This is of primary interest to implement energy efficient solutions, which imply to adapt dynamically the resource usage to the demands. In this paper, we study how to use NFV coupled with SDN to improve the energy efficiency of networks. We consider a setting in which a flow has to go through a Service Function Chain, that is several network Functions in a specific order. We propose a decomposition model that relies on lightpath configuration to solve the problem. We show that virtualization allows to obtain between 30% to 55 % of energy savings for networks of different sizes.
Mohsen Guizani - One of the best experts on this subject based on the ideXlab platform.
-
profit maximization of online service Function Chain orchestration in an inter datacenter elastic optical network
IEEE Transactions on Network and Service Management, 2021Co-Authors: Zhenrong Chen, Gang Sun, Mohsen GuizaniAbstract:To meet the increasing traffic demands characterized by large bandwidth and high burstiness, more traffic has been moving to inter-datacenter elastic optical networks (inter-DC EONs) for processing. The integration of two emerging paradigms, network Function virtualization (NFV) and software-defined networking (SDN), enables Internet service providers (ISPs) to deploy service Function Chains (SFCs) from users flexibly while reducing operational and capital expenditures. This article focuses on the problem of online SFC provisioning in inter-DC-EONs with the aim of maximizing ISP profits, where the challenge in jointly allocating IT and spectrum resources when deploying SFCs is balanced with the deployment costs of processing as many user requests as possible. We design two-phase time-efficient orchestration algorithms for online SFC requests and the strategy of SFC splitting is adopted to improve the utilization of spectrum resources on fiber links. Simulation results show that, compared with the existing algorithm, our proposed algorithms significantly shorten the deployment time, improve total profit of ISP by up to 40% and reduce the blocking probability by up to 35%.
-
cost efficient service Function Chain orchestration for low latency applications in nfv networks
IEEE Systems Journal, 2019Co-Authors: Gang Sun, Dan Liao, Gungyang Zhu, Mohsen GuizaniAbstract:With the popularization and development of cloud computing, network Function virtualization and service Function Chain (SFC) provisioning have attracted increasing attention from researchers. Excellent and reliable network service is important for network development. Moreover, as the number of network users increases, network service construction costs become very high. Therefore, an efficient algorithm is necessary to provide an SFC with excellent performance and low resource costs. In this paper, we re-examine the problem of optimizing the deployment of an SFC to provide users with excellent and resource-saving network service. We propose a heuristic, closed-loop feedback (CLF) algorithm to find the shortest path to map an SFC. To solve the problem, we introduce and integrate a restricted Boltzmann machine and cross entropy to improve the performance of CLF. Simulation results demonstrate the excellent performance of CLF. The communication delay is reduced by approximately 20%, the accept ratio improves by approximately 15%, and the algorithm running time decreases by approximately 20%. In addition, the resource utilization ratio increases by approximately 15%, and the resource fragmentation ratio decreases by approximately 50%.
Steven Latre - One of the best experts on this subject based on the ideXlab platform.
-
AIMS - Optimal Service Function Chain Composition in Network Functions Virtualization
Lecture Notes in Computer Science, 2017Co-Authors: Andrés F. Ocampo, Pedro H. Isolani, Lisandro Zambenedetti, Juliver Gil Herrera, Marinho Pilla Barcellos, Steven Latre, Juan Felipe Botero, Miguel Neves, Luciano Paschoal GasparyAbstract:Network Functions Virtualization (NFV) is an emerging initiative where virtualization is used to consolidate Network Functions (NFs) onto high volume servers (HVS), switches, and storage. In addition, NFV provides flexibility as Virtual Network Functions (VNFs) can be moved to different locations in the network. One of the major challenges of NFV is the allocation of demanded network services in the network infrastructures, commonly referred to as the Network Functions Virtualization - Resource Allocation (NFV-RA) problem. NFV-RA is divided into three stages: (i) Service Function Chain (SFC) composition, (ii) SFC embedding and (iii) SFC scheduling. Up to now, existing NFV-RA approaches have mostly tackled the SFC embedding stage taking the SFC composition as an assumption. Few approaches have faced the composition of the SFCs using heuristic approaches that do not guarantee optimal solutions. In this paper, we solve the first stage of the problem by characterizing the service requests in terms of NFs and optimally building the SFC using an Integer Linear Programming (ILP) approach.
-
semantically enhanced mapping algorithm for affinity constrained service Function Chain requests
IEEE Transactions on Network and Service Management, 2017Co-Authors: Niels Bouten, Steven Latre, Rashid Mijumbi, Jeroen Famaey, Joan Serrat, Filip De TurckAbstract:Network Function virtualization (NFV) and software defined networking (SDN) have been proposed to increase the cost-efficiency, flexibility, and innovation in network service provisioning. This is achieved by leveraging IT virtualization techniques and combining them with programmable networks. By doing so, NFV and SDN are able to decouple the network Functionality from the physical devices on which they are deployed. Service Function Chains (SFCs) composed out of virtual network Functions (VNFs) can now be deployed on top of the virtualized infrastructure to create new value-added services. Current NFV approaches are limited to mapping the different VNF to the physical substrate subject to resource capacity constraints. They do not provide the possibility to define location requirements with a certain granularity and constraints on the colocation of VNF and virtual edges. Nevertheless, many scenarios can be envisioned in which a service provider (SP) would like to attach placement constraints for efficiency, resilience, legislative, privacy, and economic reasons. Therefore, we propose a set of affinity and anti-affinity constraints, which can be used by SP to define such placement restrictions. Furthermore, a semantic SFC validation framework is proposed that allows the virtual network Function infrastructure provider (VNFInP) to check the validity of a set of constraints and provide feedback to the SPs. This allows the VNFInP to filter out any non-valid SFC requests before sending them to the mapping algorithm, significantly reducing the mapping time.
-
Optimal service Function Chain composition in network Functions virtualization
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017Co-Authors: Andrés F. Ocampo, Pedro H. Isolani, Lisandro Zambenedetti, Juliver Gil Herrera, Miguel C Neves, Marinho Pilla Barcellos, Steven Latre, Juan Felipe Botero, Luciano Paschoal GasparyAbstract:Network Functions Virtualization (NFV) is an emerging initiative where virtualization is used to consolidate Network Functions (NFs) onto high volume servers (HVS), switches, and storage. In addition, NFV provides flexibility as Virtual Network Functions (VNFs) can be moved to different locations in the network. One of the major challenges of NFV is the allocation of demanded network services in the network infrastructures, commonly referred to as the Network Functions Virtualization - Resource Allocation (NFV-RA) problem. NFV-RA is divided into three stages: (i) Service Function Chain (SFC) composition, (ii) SFC embedding and (iii) SFC scheduling. Up to now, existing NFV-RA approaches have mostly tackled the SFC embedding stage taking the SFC composition as an assumption. Few approaches have faced the composition of the SFCs using heuristic approaches that do not guarantee optimal solutions. In this paper, we solve the first stage of the problem by characterizing the service requests in terms of NFs and optimally building the SFC using an Integer Linear Programming (ILP) approach.
-
semantic validation of affinity constrained service Function Chain requests
IEEE Conference on Network Softwarization, 2016Co-Authors: Niels Bouten, Steven Latre, Maxim Claeys, Rashid Mijumbi, Jeroen Famaey, Joan SerratAbstract:Network Function Virtualization (NFV) has been proposed as a paradigm to increase the cost-efficiency, flexibility and innovation in network service provisioning. By leveraging IT virtualization techniques in combination with programmable networks, NFV is able to decouple network Functionality from the physical devices on which they are deployed. This opens up new business opportunities for both Infrastructure Providers (InPs) as well as Service Providers (SPs), where the SP can request to deploy a Chain of Virtual Network Functions (VNFs) on top of which its service can run. However, current NFV approaches lack the possibility for SPs to define location requirements and constraints on the mapping of virtual Functions and paths onto physical hosts and links. Nevertheless, many scenarios can be envisioned in which the SP would like to attach placement constraints for efficiency, resilience, legislative, privacy and economic reasons. Therefore, we propose a set of affinity and anti-affinity constraints, which can be used by SPs to define such placement restrictions. This newfound ability to add constraints to Service Function Chain (SFC) requests also introduces an additional risk that SFCs with conflicting constraints are requested or automatically generated. Therefore, a framework is proposed that allows the InP to check the validity of a set of constraints and provide feedback to the SP. To achieve this, the SFC request and relevant information on the physical topology are modeled as an ontology of which the consistency can be checked using a semantic reasoner. Enabling semantic validation of SFC requests, eliminates inconsistent SFCs requests from being transferred to the embedding algorithm.
