Contribuições para o projeto de grooming de tráfego sobre redes ópticas WDM

• Ano de defesa: 2008
• Autor(a) principal: Resendo, Leandro Colombi
• Tipo de documento: Tese
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal do Espírito Santo; BR; Doutorado em Engenharia Elétrica; Centro Tecnológico; UFES; Programa de Pós-Graduação em Engenharia Elétrica
• Palavras-chave em Português: Grooming de tráfego; WDM (Telecomunicação); Programação linear; Programação inteira; Programação heurística; Engenharia Elétrica; 621.3
• Link de acesso: http://repositorio.ufes.br/handle/10/1910

The Traffic Grooming Problem (TGP) consists in how to arrange low-bandwidth connection requests into high-capacity lightpaths efficiently. TGP solution aims at improving network capacity utilization. The minimal number optoelectronic transceivers that enable accommodating traffic demands is often used as the objec- tive function for solving TGP. However, TGP belongs to a class of NP-hard problems and optimal solutions are only possible to be found within feasible processing time for small networks (e.g., 6 nodes). This work proposes novel Integer Linear Pro- gramming (ILP) models, heuristic and a hybrid solution to TGP for medium-sized (i.e., around 12 nodes) translucent networks. Initially, ILP models using node-link and link-path paradigms are proposed and their solutions are compared. These models lay the foundations for more complex models addressing issues on network design. A hybrid method is then proposed. It makes use of a heuristic for selecting lightpaths (i.e., the virtual topology) and an ILP model to route the traffic demands over both physical and virtual topologies efficiently. The practical implications of such approach is that it allows, for the first time, the quantification of benefits of transparent lightpaths in terms of transceiver count reduction. Moreover, the miti-gation of transit traffic processing in the electronic layer is also analyzed. For large networks the ILP phase in the hybrid approach again becomes the bottleneck for optimal network design and a fully heuristic solution is necessary. This work shows that efficient solutions can be found through a simple and fast tool for network design without the need of complex parameter tuning, as comparisons with results obtained from solving the hybrid model. Finally, the integration of TGP with survivability is proposed. This work puts forward ILP models for an iterative method using two ILP models to design networks with incremental protection with minimal num- ber of transceivers in mesh networks. Dual Node Interconnected (DNI) multi-ring topologies are studied under inter-ring traffic protection using Virtual Ring (VR) and Drop and Continue (D&C) strategies. Results compare optimal solutions that take into account traffic grooming for different network scenarios including opaque vs. translucent configurations and inter vs. intra traffic growth.