Análise comparativa do algoritmo Dijkstra com e sem desfragmentação nas redes ópticas elásticas

Abstract

– Elastic optical networks have emerged with the goal of dealing with the great growth of data traffic on the Internet, using the resources of the network efficiently. Efficiency happens through the use of Orthogonal Frequency Division Multiplexing technology, which allows the division of the spectrum into frequency ranges called slots. For the establishment of an optical path in the elastic networks, it is necessary to define a route and a range of spectrum. With the establishment and closure of circuits in a dynamic scenario, the problem of fragmentation arises, which makes it impossible to attend to new requests. To mitigate this problem, defragmentation algorithms are run periodically. In this work, an analysis of the Dijkstra algorithm with and without the use of defragmentation is proposed, in order to evaluate the loss and gain related to the metrics of circuit block probability, probability of blocking bandwidth, external fragmentation and spectrum usage in two distinct network topologies. Finally, the energy consumption of the scenarios was also analyzed.