Memetic Multi-Objective Particle Swarm Optimization-Based Energy-Aware Virtual Network Embedding

In cloud infrastructure, accommodating multiple virtual networks on a single physical network reduces power consumed by physical resources and minimizes cost of operating cloud data centers. However, mapping multiple virtual network resources to physical network components, called virtual network embedding (VNE), is known to be NP-hard. With considering energy efficiency, the problem becomes more complicated. In this paper, we model energy-aware virtual network embedding, devise metrics for evaluating performance of energy aware virtual network-embedding algorithms, and propose an energy aware virtual network-embedding algorithm based on multi-objective particle swarm optimization augmented with local search to speed up convergence of the proposed algorithm and improve solutions quality. Performance of the proposed algorithm is evaluated and compared with existing algorithms using extensive simulations, which show that the proposed algorithm improves virtual network embedding by increasing revenue and decreasing energy consumption.Comment: arXiv admin note: text overlap with arXiv:1504.0684

Mapeamento de redes virtuais ciente do consumo de energia

Orientador: Nelson Luis Saldanha da FonsecaDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de ComputaçãoResumo: A virtualização de redes é uma tecnologia promissora para a Internet do futuro, já que facilita a implementação de novos protocolos e aplicações sem a necessidade de alterar o núcleo da rede. Um passo chave para instanciar redes virtuais é a alocação de recursos físicos para elementos virtuais (roteadores e enlaces). A fim de contribuir para o esforço global de poupança de energia, a escolha de recursos físicos para instanciar uma rede virtual deveria minimizar o consumo de energia rede. No entanto, esta não é uma tarefa trivial, já que requerimentos de QoS devem ser atingidos. A busca da solução ótima deste problema é NP-difícil. O mapeamento de redes virtuais em substratos de rede físicos em cenários de alocaç?o e desalocaç?o de redes virtuais pode não levar a um consumo mínimo de energia devido à dinâmica das atribuições dos elementos virtuais previamente alocados. Tal dinâmica pode levar à subutilização da rede substrato. Para reduzir os efeitos negativos desta dinâmica, técnicas tais como a migração de redes virtuais em tempo real podem ser empregadas para rearranjar as redes virtuais previamente mapeadas para poupar energia. Esta dissertação apresenta um conjunto de novos algoritmos para o mapeamento de redes virtuais em substratos de rede com o objetivo de reduzir o consumo de energia. Além disso, dois novos algoritmos são propostos para a migração dos roteadores e enlaces virtuais para reduzir o número de roteadores e amplificadores ópticos requeridos. Os resultados obtidos por simulação mostram a eficácia dos algoritmos propostosAbstract: Network virtualization is a promising technology for the Internet of the Future since it facilitates the deployment of new protocols and applications without the need of changing the core of the network. A key step to instantiate virtual networks is the allocation of physical resources to virtual elements (routers and links). In order to contribute to the global effort of saving energy, choice of physical resources to instantiate a virtual network needs to minimize the network energy consumption. However, this is not a trivial task, since the QoS of the application requirements has to be supported. Indeed, the search for the optimal solution of this problem is NP-hard. The mapping of virtual networks on network substrates at the arrival time of requests to the establishment of virtual networks may not lead to a global minimum energy consumption of energy due to the dynamic allocations and deallocations of virtual networks. Actually, such dynamics can lead to the underutilization of the network substrate. To mitigate the negative effect of this dynamics, techniques such as live migration can be employed to rearrange already mapped virtual networks to achieve energy savings. This dissertation presents a set of new algorithms for the mapping of virtual networks on network substrates aiming to reduce energy consumption. Additionally, two new algorithms are proposed for the migration of virtual routers and links to reduce the number of powered routers and optical amplifiers. Results derived by simulation show the efficacy of the proposed algorithmsMestradoCiência da ComputaçãoMestre em Ciência da Computaçã

Server resource dimensioning and routing of service function chain in NFV network architectures

The Network Function Virtualization (NFV) technology aims at virtualizing the network service with the execution of the single service components in Virtual Machines activated on Commercial-off-the-shelf (COTS) servers. Any service is represented by the Service Function Chain (SFC) that is a set of VNFs to be executed according to a given order. The running of VNFs needs the instantiation of VNF instances (VNFI) that in general are software components executed on Virtual Machines. In this paper we cope with the routing and resource dimensioning problem in NFV architectures. We formulate the optimization problem and due to its NP-hard complexity, heuristics are proposed for both cases of offline and online traffic demand. We show how the heuristics works correctly by guaranteeing a uniform occupancy of the server processing capacity and the network link bandwidth. A consolidation algorithm for the power consumption minimization is also proposed. The application of the consolidation algorithm allows for a high power consumption saving that however is to be paid with an increase in SFC blocking probability

Optimal Orchestration of Virtual Network Functions

-The emergence of Network Functions Virtualization (NFV) is bringing a set of novel algorithmic challenges in the operation of communication networks. NFV introduces volatility in the management of network functions, which can be dynamically orchestrated, i.e., placed, resized, etc. Virtual Network Functions (VNFs) can belong to VNF chains, where nodes in a chain can serve multiple demands coming from the network edges. In this paper, we formally define the VNF placement and routing (VNF-PR) problem, proposing a versatile linear programming formulation that is able to accommodate specific features and constraints of NFV infrastructures, and that is substantially different from existing virtual network embedding formulations in the state of the art. We also design a math-heuristic able to scale with multiple objectives and large instances. By extensive simulations, we draw conclusions on the trade-off achievable between classical traffic engineering (TE) and NFV infrastructure efficiency goals, evaluating both Internet access and Virtual Private Network (VPN) demands. We do also quantitatively compare the performance of our VNF-PR heuristic with the classical Virtual Network Embedding (VNE) approach proposed for NFV orchestration, showing the computational differences, and how our approach can provide a more stable and closer-to-optimum solution

Study, evaluation and contributions to new algorithms for the embedding problem in a network virtualization environment

Network virtualization is recognized as an enabling technology for the future Internet. It aims to overcome the resistance of the current Internet to architectural change and to enable a new business model decoupling the network services from the underlying infrastructure. The problem of embedding virtual networks in a substrate network is the main resource allocation challenge in network virtualization and is usually referred to as the Virtual Network Embedding (VNE) problem. VNE deals with the allocation of virtual resources both in nodes and links. Therefore, it can be divided into two sub-problems: Virtual Node Mapping where virtual nodes have to be allocated in physical nodes and Virtual Link Mapping where virtual links connecting these virtual nodes have to be mapped to paths connecting the corresponding nodes in the substrate network. Application of network virtualization relies on algorithms that can instantiate virtualized networks on a substrate infrastructure, optimizing the layout for service-relevant metrics. This class of algorithms is commonly known as VNE algorithms. This thesis proposes a set of contributions to solve the research challenges of the VNE that have not been tackled by the research community. To do that, it performs a deep and comprehensive survey of virtual network embedding. The first research challenge identified is the lack of proposals to solve the virtual link mapping stage of VNE using single path in the physical network. As this problem is NP-hard, existing proposals solve it using well known shortest path algorithms that limit the mapping considering just one constraint. This thesis proposes the use of a mathematical multi-constraint routing framework called paths algebra to solve the virtual link mapping stage. Besides, the thesis introduces a new demand caused by virtual link demands into physical nodes acting as intermediate (hidden) hops in a path of the physical network. Most of the current VNE approaches are centralized. They suffer of scalability issues and provide a single point of failure. In addition, they are not able to embed virtual network requests arriving at the same time in parallel. To solve this challenge, this thesis proposes a distributed, parallel and universal virtual network embedding framework. The proposed framework can be used to run any existing embedding algorithm in a distributed way. Thereby, computational load for embedding multiple virtual networks is spread across the substrate network Energy efficiency is one of the main challenges in future networking environments. Network virtualization can be used to tackle this problem by sharing hardware, instead of requiring dedicated hardware for each instance. Until now, VNE algorithms do not consider energy as a factor for the mapping. This thesis introduces the energy aware VNE where the main objective is to switch off as many network nodes and interfaces as possible by allocating the virtual demands to a consolidated subset of active physical networking equipment. To evaluate and validate the aforementioned VNE proposals, this thesis helped in the development of a software framework called ALgorithms for Embedding VIrtual Networks (ALEVIN). ALEVIN allows to easily implement, evaluate and compare different VNE algorithms according to a set of metrics, which evaluate the algorithms and compute their results on a given scenario for arbitrary parameters

A Literature Survey on Resource Management Techniques, Issues and Challenges in Cloud Computing

Cloud computing is a large scale distributed computing which provides on demand services for clients. Cloud Clients use web browsers, mobile apps, thin clients, or terminal emulators to request and control their cloud resources at any time and anywhere through the network. As many companies are shifting their data to cloud and as many people are being aware of the advantages of storing data to cloud, there is increasing number of cloud computing infrastructure and large amount of data which lead to the complexity management for cloud providers. We surveyed the state-of-the-art resource management techniques for IaaS (infrastructure as a service) in cloud computing. Then we put forward different major issues in the deployment of the cloud infrastructure in order to avoid poor service delivery in cloud computing