• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Novos algoritmos para aloca??o eficiente de canais em redes ?pticas el?sticas / New algorithms for the efficient allocation of channels in elastic optical networks

Silva, Paulo C?sar Barreto da 05 February 2014 (has links)
Made available in DSpace on 2016-04-04T18:31:40Z (GMT). No. of bitstreams: 1 Paulo Cesar Barreto da Silva.pdf: 3934588 bytes, checksum: cbbb71074cd6c370e06fd00f5d3eabce (MD5) Previous issue date: 2014-02-05 / New optical wavelength division multiplexing (WDM) networks are expected to utilize multiple bit rate channels. Moreover, each individual channels may carry over 200 Gb/s and occupy a bandwidth that exceeds the 50-GHz WDM fixed grid. In this scenario, spectral efficiency becomes an important issue and new channel allocation schemes need to be considered. An attractive solution for this problem is the utilization of a WDM grid with variable channel spacing, in the so-called elastic optical network (EON) approach. The main goal of this work is to propose algorithms to solve the spectral efficiency issue in emerging optical WDM networks. Such proposals are divided in two classes. The first one consists of allocating different spectral blocks for channels with different bit rates; this is named as the spectrum block division (SBD) scheme. The second class of our proposals is based on EON schemes. In this case, not only the enhancement of a previously reported algorithm, the Maximize Total Link Spectrum Consecutiveness (MTLSC) algorithm, is considered but also a new algorithm, the Shortest Path with Maximum number of Free Frequency Slot Units (SPMFF) is proposed. Another contribution of this work is the development of an EON simulator, called EONSim, based on JAVA programming language. This simulator was properly tested and reproduced the results of literature papers within a very good accuracy. All of our results were obtained with the aid of EONSim and suggest that the proposed algorithms yield a bandwidth occupation gain that varies from 7 to 18% higher than the one provided by traditional first-fit (FF) algorithms. Such algorithms also provide a blocking probability that is 2 to 8% lower than in FF strategy. On the other hand, it is found that algorithms with higher spectral efficiency use an average number of hops that is up to 16% higher than those necessary for algorithms that do not take bandwidth into account in channel allocation. / Novas redes ?pticas de multiplexa??o por divis?o de comprimento de onda (Wavelength Division Multiplexing, WDM) podem utilizar v?rios canais com taxas diferentes de bits. Al?m disso, cada um dos canais individuais pode transportar mais de 200 Gb/s e ocupar uma largura de banda que excede a grade fixa de 50 GHz da rede WDM. Neste cen?rio, a efici?ncia espectral torna-se uma quest?o importante e novos esquemas de aloca??o de canais precisam ser considerados. Uma solu??o atrativa para este problema ? a utiliza??o de uma rede WDM com espa?amento de canal vari?vel, na abordagem chamada rede ?ptica el?stica (EON). O principal objetivo do presente trabalho ? propor algoritmos para resolver a quest?o da efici?ncia espectral em redes ?pticas WDM emergentes. Tais propostas s?o divididas em duas classes. A primeira consiste em alocar diferentes blocos de espectro para canais com diferentes taxas de bits, o que ? apontado como esquema de divis?o de blocos de espectro (Spectrum Block Division, SBD). A segunda classe ? baseada em esquemas de EON. Neste caso, n?o s? o aperfei?oamento de um algoritmo previamente descrito por WANG (2012), o algoritmo Maximize Total Link Spectrum Consecutiveness (MTLSC), ? considerado, mas tamb?m um novo algoritmo, o Shortest Path with Maximum number of Free Frequency Slot Units (SPMFF) ? proposto. Outra contribui??o deste trabalho ? o desenvolvimento de um simulador de EON, chamado EONSim, com base na linguagem de programa??o JAVA. Este simulador foi devidamente testado e foram reproduzidos os resultados de WANG (2012) dentro de uma precis?o muito boa. Todos os resultados foram obtidos com a ajuda de EONSim e sugerem que os algoritmos propostos produzem um ganho de ocupa??o de banda, que varia de 7 a 18% mais elevada do que a fornecida pelo tradicional algoritmo First Fit (FF). Tais algoritmos tamb?m proporcionam uma probabilidade de bloqueio, que ? de 2 a 8% mais baixa do que na estrat?gia FF. Por outro lado, verifica-se que os algoritmos de melhor ocupa??o espectral utilizam um n?mero m?dio de saltos at? 16% mais elevado do que os necess?rios para os algoritmos de menor caminho, que n?o levam em conta a largura de banda de atribui??o de canal.

Page generated in 0.0876 seconds