1,537 research outputs found
Virtualisation and resource allocation in MECEnabled metro optical networks
The appearance of new network services and the ever-increasing network traffic and number
of connected devices will push the evolution of current communication networks towards the
Future Internet.
In the area of optical networks, wavelength routed optical networks (WRONs) are evolving
to elastic optical networks (EONs) in which, thanks to the use of OFDM or Nyquist WDM,
it is possible to create super-channels with custom-size bandwidth. The basic element in
these networks is the lightpath, i.e., all-optical circuits between two network nodes. The
establishment of lightpaths requires the selection of the route that they will follow and the
portion of the spectrum to be used in order to carry the requested traffic from the source to
the destination node. That problem is known as the routing and spectrum assignment (RSA)
problem, and new algorithms must be proposed to address this design problem.
Some early studies on elastic optical networks studied gridless scenarios, in which a slice
of spectrum of variable size is assigned to a request. However, the most common approach to
the spectrum allocation is to divide the spectrum into slots of fixed width and allocate multiple,
consecutive spectrum slots to each lightpath, depending on the requested bandwidth. Moreover,
EONs also allow the proposal of more flexible routing and spectrum assignment techniques,
like the split-spectrum approach in which the request is divided into multiple "sub-lightpaths".
In this thesis, four RSA algorithms are proposed combining two different levels of
flexibility with the well-known k-shortest paths and first fit heuristics. After comparing the
performance of those methods, a novel spectrum assignment technique, Best Gap, is proposed
to overcome the inefficiencies emerged when combining the first fit heuristic with highly
flexible networks. A simulation study is presented to demonstrate that, thanks to the use of
Best Gap, EONs can exploit the network flexibility and reduce the blocking ratio.
On the other hand, operators must face profound architectural changes to increase the
adaptability and flexibility of networks and ease their management. Thanks to the use of
network function virtualisation (NFV), the necessary network functions that must be applied
to offer a service can be deployed as virtual appliances hosted by commodity servers, which
can be located in data centres, network nodes or even end-user premises. The appearance of
new computation and networking paradigms, like multi-access edge computing (MEC), may
facilitate the adaptation of communication networks to the new demands. Furthermore, the
use of MEC technology will enable the possibility of installing those virtual network functions
(VNFs) not only at data centres (DCs) and central offices (COs), traditional hosts of VFNs, but
also at the edge nodes of the network. Since data processing is performed closer to the enduser,
the latency associated to each service connection request can be reduced. MEC nodes
will be usually connected between them and with the DCs and COs by optical networks.
In such a scenario, deploying a network service requires completing two phases: the
VNF-placement, i.e., deciding the number and location of VNFs, and the VNF-chaining,
i.e., connecting the VNFs that the traffic associated to a service must transverse in order to
establish the connection. In the chaining process, not only the existence of VNFs with available
processing capacity, but the availability of network resources must be taken into account to
avoid the rejection of the connection request. Taking into consideration that the backhaul of
this scenario will be usually based on WRONs or EONs, it is necessary to design the virtual
topology (i.e., the set of lightpaths established in the networks) in order to transport the tra c
from one node to another. The process of designing the virtual topology includes deciding the
number of connections or lightpaths, allocating them a route and spectral resources, and finally
grooming the traffic into the created lightpaths.
Lastly, a failure in the equipment of a node in an NFV environment can cause the
disruption of the SCs traversing the node. This can cause the loss of huge amounts of data
and affect thousands of end-users. In consequence, it is key to provide the network with faultmanagement
techniques able to guarantee the resilience of the established connections when a
node fails.
For the mentioned reasons, it is necessary to design orchestration algorithms which solve
the VNF-placement, chaining and network resource allocation problems in 5G networks
with optical backhaul. Moreover, some versions of those algorithms must also implements
protection techniques to guarantee the resilience system in case of failure.
This thesis makes contribution in that line. Firstly, a genetic algorithm is proposed to solve
the VNF-placement and VNF-chaining problems in a 5G network with optical backhaul based
on star topology: GASM (genetic algorithm for effective service mapping). Then, we propose
a modification of that algorithm in order to be applied to dynamic scenarios in which the
reconfiguration of the planning is allowed. Furthermore, we enhanced the modified algorithm
to include a learning step, with the objective of improving the performance of the algorithm.
In this thesis, we also propose an algorithm to solve not only the VNF-placement and
VNF-chaining problems but also the design of the virtual topology, considering that a WRON
is deployed as the backhaul network connecting MEC nodes and CO. Moreover, a version
including individual VNF protection against node failure has been also proposed and the
effect of using shared/dedicated and end-to-end SC/individual VNF protection schemes are
also analysed.
Finally, a new algorithm that solves the VNF-placement and chaining problems and
the virtual topology design implementing a new chaining technique is also proposed.
Its corresponding versions implementing individual VNF protection are also presented.
Furthermore, since the method works with any type of WDM mesh topologies, a technoeconomic
study is presented to compare the effect of using different network topologies in
both the network performance and cost.Departamento de Teoría de la Señal y Comunicaciones e Ingeniería TelemáticaDoctorado en Tecnologías de la Información y las Telecomunicacione
Resource Allocation in Survivable WDM Networks Under a Sliding Scheduled Traffic Model
In recent years there has been an increasing number of applications that require periodic use of lightpaths at predefined time intervals, such as database backup and on-line classes. A new traffic model, referred to as the scheduled traffic model, has been proposed to handle such scheduled lightpath demands. In this thesis we present two new integer linear program ( ILP) formulations for the more general sliding scheduled traffic model, where the setup and teardown times may vary within a specified range. We consider both wavelength convertible networks and networks without wavelength conversion capability. Our ILP formulations jointly optimize the problem of scheduling the demands ( in time) and allocating resources for the scheduled lightpaths. Simulation results show that our formulations are able to generate optimal solutions for practical sized networks. For larger networks, we have proposed a fast two-step heuristic to solve the demand scheduling problem and the RWA problem separately
Energy Efficient Survivable IP over WDM Networks with Network Coding
In this work we investigate the use of network coding in 1+1 survivable IP over WDM networks by encoding the protection paths of multiple flow with each other at intermediate nodes. We study the energy efficiency of this scheme through MILP, and a heuristic with five operating options. We evaluate the MILP and the heuristics on typical and regular network topologies. Our results show that implementing network coding can produce savings up to 37% on the ring topology and 23% considering typical topologies. We also study the impact of varying the demand volumes on the network coding performanc
Resilient Resource Allocation Schemes in Optical Networks
Recent studies show that deliberate malicious attacks performed by high-power sig- nals can put large amount of data under risk. We investigate the problem of sur- vivable optical networks resource provisioning scheme against malicious attacks, more specically crosstalk jamming attacks. These types of attacks may cause ser- vice disruption (or possibly service denial). We consider optical networks based on wavelength-division multiplexing (WDM) technology and two types of jamming at- tacks: in-band and out-of-band attacks. We propose an attack-aware routing and wavelength assignments (RWA) scheme to avoid or reduce the damaging effects of potential attacking signals on individual or multiple legitimate lightpaths travers- ing the same optical switches and links. An integer linear programs (ILPs) as well as heuristic approaches were proposed to solve the problem. We consider dynamic traffic where each demand is dened by its start time and a duration. Our results show that the proposed approaches were able to limit the vulnerability of lightpaths to jamming attacks. Recently, large-scale failures caused by natural disasters and/or deliberate at- tacks have left major parts of the networks damaged or disconnected. We also investigate the problem of disaster-aware WDM network resource provisioning in case of disasters. We propose an ILP and efficient heuristic to route the lightpaths in such a way that provides protection against disasters and minimize the network vi resources such as the number of wavelength links used in the network. Our models show that signicant resource savings can be achieved while accommodating users demands. In the last few years, optical networks using Space Division Multiplexing (SDM) has been proposed as a solution to the speed bottleneck anticipated in data center (DC) networks. To our knowledge the new challenges of designing such communica- tion systems have not been addressed yet. We propose an optimal approach to the problem of developing a path-protection scheme to handle communication requests in DC networks using elastic optical networking and space division multiplexing. We have formulated our problem as an ILP. We have also proposed a heuristic that can handle problems of practical size. Our simulations explore important features of our approach
Genetic algorithm for holistic VNF-mapping and virtual topology design
Producción CientíficaNext generation of Internet of Things (IoT) services imposes stringent requirements to the future networks that current ones cannot fulfill. 5G is a technology born to give response to those requirements. However, the deployment of 5G is also accompanied by profound architectural changes in the network, including the introduction of technologies like multi-access edge computing (MEC), software defined networking (SDN), and network function virtualization (NFV). In particular, NFV poses diverse challenges like virtual network function (VNF) placement and chaining, also called VNF-mapping. In this paper, we present an algorithm that solves VNF-placement and chaining in a metro WDM optical network equipped with MEC resources. Therefore, it solves the VNF-mapping in conjunction with the virtual topology design of the underlying optical backhaul network. Moreover, a version of the method providing protection against node failures is also presented. A simulation study is presented to show the importance of designing the three problems jointly, in contrast to other proposals of the literature that do not take the design of the underlying network into consideration when solving that problem. Furthermore, this paper also shows the advantages of using collaboration between MEC nodes to solve the VNF-mapping problem and the advantage of using shared protection schemes. The new algorithm outperforms other proposals in terms of both service blocking ratio, and number of active CPUs (thus reducing energy consumption). Finally, the impact of deploying different physical topologies for the optical backhaul network is also presented.Ministerio de Economía, Industria y Competitividad (grant TEC2017-84423-C3-1-P)Ministerio de Industria, Comercio y Turismo (grant BES 2015-074514)Spanish Thematic Network (contract RED2018-102585-T)INTERREG V-A España-Portugal (POCTEP) program (project 0677_DISRUPTIVE_2_E
Traffic engineering in dynamic optical networks
Traffic Engineering (TE) refers to all the techniques a Service Provider employs to improve the efficiency and reliability of network operations. In IP over Optical (IPO) networks, traffic coming from upper layers is carried over the logical topology defined by the set of established lightpaths. Within this framework then, TE techniques allow to optimize the configuration of optical resources with respect to an highly dynamic traffic demand. TE can be performed with two main methods: if the demand is known only in terms of an aggregated traffic matrix, the problem of automatically updating the configuration of an optical network to accommodate traffic changes is called Virtual Topology Reconfiguration (VTR). If instead the traffic demand is known in terms of data-level connection requests with sub-wavelength granularity, arriving dynamically from some source node to any destination node, the problem is called Dynamic Traffic Grooming (DTG). In this dissertation new VTR algorithms for load balancing in optical networks based on Local Search (LS) techniques are presented. The main advantage of using LS is the minimization of network disruption, since the reconfiguration involves only a small part of the network. A comparison between the proposed schemes and the optimal solutions found via an ILP solver shows calculation time savings for comparable results of network congestion. A similar load balancing technique has been applied to alleviate congestion in an MPLS network, based on the efficient rerouting of Label-Switched Paths (LSP) from the most congested links to allow a better usage of network resources. Many algorithms have been developed to deal with DTG in IPO networks, where most of the attention is focused on optimizing the physical resources utilization by considering specific constraints on the optical node architecture, while very few attention has been put so far on the Quality of Service (QoS) guarantees for the carried traffic. In this thesis a novel Traffic Engineering scheme is proposed to guarantee QoS from both the viewpoint of service differentiation and transmission quality. Another contribution in this thesis is a formal framework for the definition of dynamic grooming policies in IPO networks. The framework is then specialized for an overlay architecture, where the control plane of the IP and optical level are separated, and no information is shared between the two. A family of grooming policies based on constraints on the number of hops and on the bandwidth sharing degree at the IP level is defined, and its performance analyzed in both regular and irregular topologies. While most of the literature on DTG problem implicitly considers the grooming of low-speed connections onto optical channels using a TDM approach, the proposed grooming policies are evaluated here by considering a realistic traffic model which consider a Dynamic Statistical Multiplexing (DSM) approach, i.e. a single wavelength channel is shared between multiple IP elastic traffic flows
Exploring graph coloring heuristics for optical networks planning
Optical networks are essential in today’s global communications, and the study of planning tools that efficiently allocate network resources is crucial to network providers. The assignment of wavelengths, alongside routing, are critical functions in all optical network planning tools. This dissertation focuses on the study of wavelength assignment algorithms based on Graph Coloring techniques.
In this dissertation, we analyse the performance of the usual Greedy heuristic, a well-known Graph Coloring heuristic applied to optical network planning, as well as the Degree of Saturation (DSATUR) and Recursive Largest First (RLF) heuristics, in several real net- work scenarios. These last two heuristics, to the best of our knowledge, have not yet been applied in the context of optical networks. Extensive simulations have been performed, using real network topologies, such as COST 239, and CONUS networks, considering a full mesh logical topology, and we conclude that DSATUR and RLF heuristics can out-perform Greedy heuristic in network scenarios where there are several network clusters interconnected by only one or two links. In these cases, the RLF and DSATUR heuristics provide less 9 and 5 wavelengths respectively than the Greedy heuristic. Despite generating fewer wavelengths, we have verified that these heuristics need a higher computing time than the Greedy heuristic. Besides these heuristics, the traditional First Fit and Most-Used heuristics were also studied, and lead to performance similar to the Greedy heuristics.As redes óticas são essenciais nas comunicações globais atuais e, o estudo de ferramentas de planeamento que utilizem eficientemente os recursos da rede são cruciais aos operadores de rede. A atribuição de comprimentos de onda, juntamente com o encaminhamento, são funções críticas em todas as ferramentas de planeamento de redes óticas. Esta dissertação foca-se no estudo de algoritmos de atribuição de comprimentos de onda baseados em técnicas de Coloração de Grafos.
Na presente dissertação analisamos o desempenho da heuríıstica Greedy, uma heurística de Coloração de Grafos tipicamente aplicada ao planeamento de redes óticas, assim como as heurísticas Degree of Saturation (DSATUR) and Recursive Largest First (RLF), em diversos cenários de redes reais. Estas duas últimas heurísticas, tanto quanto sabemos, ainda não foram aplicadas no contexto de redes óticas. Foram realizadas inúmeras simulações, utilizando topologias de redes reais, como as redes COST 239, e CONUS considerando uma topologia lógica em malha completa e concluímos que as heurísticas DSATUR e RLF podem superar a heurística Greedy em cenários de rede onde existem vários clusters de rede interligados por apenas uma ou duas ligações. Nestas redes, as heurísticas RLF e DSATUR, proporcionam menos 9 e 5 comprimentos de onda, respetivamente, do que a heurística Greedy. Apesar de gerarem menos comprimentos de onda, verificamos que estas heurísticas necessitam de um tempo de computação superior ao da heurística Greedy. Além de terem sido estudadas estas heurísticas, também foram estudadas as heurísticas tradicionais First Fit e Most-Used e concluímos que têm um desempenho semelhante à heurística Greedy
- …