Abstract

The changes that came with the development of telecommunication networks have increased some problems such as organization, transmission difficulties, location, and cost issues. In this scenario, the present work approaches the Ring Star Problem (RSP) applied to a ring star topology telecommunication network.With the objective of achieving the lowest net sums of the main ring cost and of the element assignment cost, it is used a heuristic algorithm based on the concepts of Greedy Randomized Adaptive Search Procedure (GRASP) and Iterated Local Search (ILS). Some experiments have been performed with a set of test problems in the literature and results have shown that the presented algorithm provides good solutions.

Highlights

  • Os vertices restantes conectados aos vertices pertencentes ao ciclo geram um custo di j, denominado custo de atribuicao, para cada arco [vi, v j ]

  • The changes that came with the development of telecommunication networks have increased some problems such as organization, transmission difficulties, location, and cost issues

  • The present work approaches the Ring Star Problem (RSP) applied to a ring star topology telecommunication network.With the objective of achieving the lowest net sums of the main ring cost and of the element assignment cost, it is used a heuristic algorithm based on the concepts of Greedy Randomized Adaptive Search Procedure (GRASP) and Iterated Local Search (ILS)

Read more

Summary

INTRODUC A O

O crescimento constante da comunicacao atribuıdo a dinamica da inovacao tecnologica, traz consigo uma grande mudanca no mercado das telecomunicacoes, permitindo assim grande transporte de dados em uma unica estrutura de rede. As organizacoes atuais buscam processos ageis, de interfaces inteligentes e com reducao de custo na fase de planejamento de novos projetos [6]. Este trabalho tem como objetivo projetar uma topologia de redes anel estrela, tendo sua representacao atraves de grafos que buscam encontrar boas solucoes para o custo de projeto [13]. Esta topologia hıbrida econstruıda atraves das conexoes entre si das estacoes, constituindo um ciclo fechado, no qual algumas destas estacoes servirao de concentradores para outros nos em ligacoes ponto a ponto

22 PROJETO DE REDES COM TOPOLOGIA ANEL-ESTRELA
TRABALHOS CORRELATOS
SOLUC A O INICIAL PARA O PCMRC
HEURISTICA GRASP PARA O PCMRC
HEURISTICA ILS PARA O PCMRC
RESULTADOS COMPUTACIONAIS
CONSIDERAC O ES FINAIS
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call