A multi-attribute ranking solutions confirmation procedure

Ranking problems arise from the knowledge of several binary relations defined on a set of alternatives, which we intend to rank. In a previous work, the authors introduced a tool to confirm the solutions of multi-attribute ranking problems as linear extensions of a weighted sum of preference relations. An extension of this technique allows the recognition of critical preference pairs of alternatives, which are often caused by inconsistencies. Herein, a confirmation procedure is introduced and applied to confirm the results obtained by a multi-attribute decision methodology on a tender for the supply of buses to the Porto Public Transport Operator. © 2005 Springer Science + Business Media, Inc.

Service building in dense service provider environments

Genericamente falando, os serviços sobre redes têm vindo a afastar-se de um modelo monolítico para um modelo de criação de serviços que permite ou - como é mais frequente - requer a cooperação entre vários Provedores de Serviço. A Internet, que tem vindo a forçar a convergência de serviços, mostra que começa a ser virtualmente impossível a um único operador fornecer qualquer serviço com um mínimo de interesse para os utilizadores. Esta tese foca-se em serviços de transporte (e.g., connectividade) e discute o impacto das fronteira que as ofertas de serviços têm com o negócio. A questão central é a seguinte: o que muda quando o mesmo serviço é oferecido não apenas por um mas por mais do que um Provedor de Serviço. Por um lado, esta tese cobre, em abs tracto, a noção de Provedor se Serviço, como evoluiu e em que sentido está a evoluir, particularmente num contexto de muitos Provedores de Serviço. Os primeiros capítulos desta tese analizam e propõem arquitecturas para cooperação inter-Provedor-de-Serviço e para serviços comuns tais como multimédia. Por outro lado, oferece-se soluções práticas, com as respectivas avaliações, para alguns problemas, que ainda hoje se mantêm em aberto, tais como encaminhamento inter-domínio, Qualidade-de-Serviço, Mobilidade e distribuição de conteúdos, tais como as contribuições relacionadas com o impacto da noção administrativa de Sistemas Autónomos sobre encaminhamento inter-domínio, uma arquitectura de transporte inter-domínio e o problema que levanta da ineficiência que decorre do planeamento não- cooperativo de Redes de Entrega de Conteúdos.

Network virtualisation from an operator perspective

Network virtualisation is seen as a promising approach to overcome the so-called “Internet impasse” and bring innovation back into the Internet, by allowing easier migration towards novel networking approaches as well as the coexistence of complementary network architectures on a shared infrastructure in a commercial context. Recently, the interest from the operators and mainstream industry in network virtualisation has grown quite significantly, as the potential benefits of virtualisation became clearer, both from an economical and an operational point of view. In the beginning, the concept has been mainly a research topic and has been materialized in small-scale testbeds and research network environments. This PhD Thesis aims to provide the network operator with a set of mechanisms and algorithms capable of managing and controlling virtual networks. To this end, we propose a framework that aims to allocate, monitor and control virtual resources in a centralized and efficient manner. In order to analyse the performance of the framework, we performed the implementation and evaluation on a small-scale testbed. To enable the operator to make an efficient allocation, in real-time, and on-demand, of virtual networks onto the substrate network, it is proposed a heuristic algorithm to perform the virtual network mapping. For the network operator to obtain the highest profit of the physical network, it is also proposed a mathematical formulation that aims to maximize the number of allocated virtual networks onto the physical network. Since the power consumption of the physical network is very significant in the operating costs, it is important to make the allocation of virtual networks in fewer physical resources and onto physical resources already active. To address this challenge, we propose a mathematical formulation that aims to minimize the energy consumption of the physical network without affecting the efficiency of the allocation of virtual networks. To minimize fragmentation of the physical network while increasing the revenue of the operator, it is extended the initial formulation to contemplate the re-optimization of previously mapped virtual networks, so that the operator has a better use of its physical infrastructure. It is also necessary to address the migration of virtual networks, either for reasons of load balancing or for reasons of imminent failure of physical resources, without affecting the proper functioning of the virtual network. To this end, we propose a method based on cloning techniques to perform the migration of virtual networks across the physical infrastructure, transparently, and without affecting the virtual network. In order to assess the resilience of virtual networks to physical network failures, while obtaining the optimal solution for the migration of virtual networks in case of imminent failure of physical resources, the mathematical formulation is extended to minimize the number of nodes migrated and the relocation of virtual links. In comparison with our optimization proposals, we found out that existing heuristics for mapping virtual networks have a poor performance. We also found that it is possible to minimize the energy consumption without penalizing the efficient allocation. By applying the re-optimization on the virtual networks, it has been shown that it is possible to obtain more free resources as well as having the physical resources better balanced. Finally, it was shown that virtual networks are quite resilient to failures on the physical network.