Optimization of Ring Topology Routes Using Node and Link Swapping Methods

The implementation of computer networks has many problems, especially in Wide Area Networks (WAN), one of which is routing problems. Routing problem is how to transmit data between nodes with the fastest path, especially in ring topology. In a ring topology, each node can only be traversed once. To solve this problem, we use a homemade algorithm based on how Ant Colony Optimization (ACO) works. This method was then tested using a distance matrix of 2x2 to 100x100 to see the cost and time performance achieved.