Submitted by PPG Ci?ncia da Computa??o (ppgcc@pucrs.br) on 2018-12-12T11:28:20Z No. of bitstreams: 1 Romulo Reis de Oliveira_DIS.pdf: 1719302 bytes, checksum: 005f38fa0c94cb6b97ce5f6ad6ec70ed (MD5) / Approved for entry into archive by Sheila Dias (sheila.dias@pucrs.br) on 2018-12-14T11:26:14Z (GMT) No. of bitstreams: 1 Romulo Reis de Oliveira_DIS.pdf: 1719302 bytes, checksum: 005f38fa0c94cb6b97ce5f6ad6ec70ed (MD5) / Made available in DSpace on 2018-12-14T11:50:26Z (GMT). No. of bitstreams: 1 Romulo Reis de Oliveira_DIS.pdf: 1719302 bytes, checksum: 005f38fa0c94cb6b97ce5f6ad6ec70ed (MD5) Previous issue date: 2015-04-24 / Hybrid synchrony virtual networks arose by combining network virtualization, which allows the co-existence of several virtual networks in the same shared physical substrate, providing infrastructure in a flexible and economic way, with partial synchrony network architecture, which is relevant in distributed systems in order to build reliable systems. One of the main challenges in network virtualization is the efficient mapping of virtual resources in the substrate network, since it is a NP-Hard complexity problem. When considering the synchrony of virtual and physical resources it becomes more difficult to map, making it unfeasible to calculate the optimal solution in real environments. Thus, heuristic approaches are necessary for finding semi-optimal solutions faster. In this work, four heuristics for mapping hybrid synchrony virtual networks are adapted. In order to evaluate these heuristics, two sets of experiments were executed. In the first set is compared the optimal solutions with their respective semi-optimal solutions, the results show the heuristics? efficiency are better when the virtual network requests are smaller, furthermore there were some semi-optimal solution mapping costs equivalent to the optimal solution mapping cost. The second set of experiments evaluates the heuristics performance using a physical substrate closer to real context and a larger number of virtual network requests. The results of this second set of experiments demonstrate that even with a larger number of virtual requests and a larger substrate, the solutions were computed in acceptable time. / As redes virtuais de sincronia h?brida surgiram da combina??o entre a virtualiza??o de redes, a qual permite a coexist?ncia de v?rias redes virtuais no mesmo substrato f?sico compartilhado fornecendo infraestrutura de maneira flex?vel e econ?mica, e arquitetura de redes com sincronia parcial, essa relevante em sistemas distribu?dos para construir sistemas confi?veis. Um dos principais desafios em virtualiza??o de redes ? o mapeamento eficiente dos recursos virtuais na rede de substrato, pois ? um problema de complexidade NP-Dif?cil. Ao considerar a sincronia dos recursos virtuais e f?sicos, se torna mais dif?cil efetuar esse mapeamento, inviabilizando o c?lculo da solu??o ?tima em ambientes reais. Sendo assim, abordagens heur?sticas s?o necess?rias para encontrar solu??es semi-?timas de maneira mais r?pida. Neste trabalho s?o adaptadas quatro abordagens heur?sticas para efetuar o mapeamento de redes virtuais de sincronia h?brida. Para avaliar o desempenho dessas heur?sticas foram efetuados dois conjuntos de experimentos. No primeiro conjunto de experimentos s?o comparadas as solu??es ?timas e as respectivas solu??es semi-?timas, os resultados indicaram que a efici?ncia das heur?sticas s?o melhores quando as requisi??es de redes virtuais s?o menores, al?m disso houveram alguns custos de solu??es semi-?timas equivalentes ao custo de mapeamento da solu??o ?tima. O segundo conjunto de experimento avalia o desempenho das heur?sticas utilizando um substrato de rede mais pr?ximo do contexto real e um maior n?mero de requisi??es de redes virtuais. Os resultados desse segundo experimento demonstram que mesmo com um n?mero maior de requisi??es de redes virtuais e um substrato maior, as solu??es foram calculadas em tempo aceit?vel.