[vc_empty_space][vc_empty_space]
A new heuristic method for ring topology optimization: A proposal
Guntur Petrus B.K.a, Qamar S.a, Syambas N.R.a
a School of Electrical Engineering an Informatics, Institut Teknologi Bandung, Indonesia
[vc_row][vc_column][vc_row_inner][vc_column_inner][vc_separator css=”.vc_custom_1624529070653{padding-top: 30px !important;padding-bottom: 30px !important;}”][/vc_column_inner][/vc_row_inner][vc_row_inner layout=”boxed”][vc_column_inner width=”3/4″ css=”.vc_custom_1624695412187{border-right-width: 1px !important;border-right-color: #dddddd !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_empty_space][megatron_heading title=”Abstract” size=”size-sm” text_align=”text-left”][vc_column_text]© 2017 IEEE.Nowadays, the ring topology has become a standard in network topology design, at least at the core network. The problem in designing ring topology is how to design the connections of each node to each other with the overall cost of the ring is minimum. This problem is known as the Traveling Salesman Problem (TSP). There are two variables which need consideration in TSP, finding the nodes configuration that has minimum cost, and how long it takes to get this minimum configuration. Brute Force has the capability to find the minimum nodes configuration cost, but with every node added to the overall configuration, the time to solve it is increasing exponentially. While not giving the minimum cost, The Ant Colony Optimization (ACO) algorithm has the advantage of minimal time needed to find the sub-minimum nodes configuration. This paper proposed a new heuristic algorithm to find the sub-minimum nodes configuration. The proposed algorithm has a shorter time, in order of less than 1 second for up to 50 nodes, compared to the Ant Colony Algorithm. Although, the cost of the nodes configuration didn’t always lower than the Ant Colony Algorithm.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Author keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Ant colony algorithms,Ant Colony Optimization algorithms,Configuration costs,Core networks,Heuristic,Network design,Overall costs,Ring topology[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Indexed keywords” size=”size-sm” text_align=”text-left”][vc_column_text]ACO,Heuristic,network design,ring topology,TSP[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Funding details” size=”size-sm” text_align=”text-left”][vc_column_text][/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”DOI” size=”size-sm” text_align=”text-left”][vc_column_text]https://doi.org/10.1109/TSSA.2017.8272950[/vc_column_text][/vc_column_inner][vc_column_inner width=”1/4″][vc_column_text]Widget Plumx[/vc_column_text][/vc_column_inner][/vc_row_inner][/vc_column][/vc_row][vc_row][vc_column][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][/vc_column][/vc_row]