An experimental study on efficient virtual network migration

With today's increasing use of technology, the physical resources that provide the infrastructure have begun to be inadequate and created the concept of virtualization. As virtualization is preferred in physical machines, it also ensures that the network structures that provide the infrastructure are better managed and used more efficiently. There is no need for migrations in virtual networks with processes such as maintenance, repair, shutdown or migration that can occur in physical network resources. Various works are being carried out to prevent loss of performance during transport in virtual networks, to reduce the most delayed delays and to keep the transportation costs to be lower as possible. In this paper, experiments were carried out with minimum spanning tree (MST) and maximum independent set (MIS) algorithms for network migration with minimum cost as soon as possible. It has been found that the size of the network topology greatly influences the resulting cost, and the result is that the “MST” in low-topology topologies and the “MIS” algorithm in multi-node topologies achieve a less costly migration operation. The literature contribution is provided by drawing the frameworks that will help create an effective virtual network migration algorithm.