Thanks to the development of New Information and Communication Technologies (NICT), computer tools are increasingly in demand in almost all sectors of activity to meet to the needs of people, property, companies... Thus, IT migration is therefore a process that can affect all companies that host data relating to their customers, suppliers, partners or even general statistics. In this article, we consider the virtual machine migration problem as a rucksack problem. As server hosting capacities have become increasingly ‘elevated’, the need for consolidation and load balancing has led to a strong interest in virtual machine migration. We have used the following approach: we begin by presenting the computer system migration environment. Next, we propose a formal definition of the virtual machine migration environment. We then show, using the formal language, that virtual machine migration is an NP-hard problem of the rucksack type. We then propose the MigrationVM algorithm of complexity O(7) as an optimal solution to the problem of migration virtual machines in networks. We have discussed our algorithm and we believe that virtual machine migration data can be reduced to two main elements: the amount of RAM used by the virtual machine and the amount of hard disk used by the virtual machine.