The selected VM that is chosen for the migration denoted as $v$. The migration time is defined by dividing the available bandwidth for the host $h$ from the amount of used RAM by the VM . The proposed MxMT policy finds the VM which satisfies the following condition:

$$\label{First}
v \in V_h | \forall_x \in V_h, \frac{RAM_u(v)}{NET_h} \geq \frac{RAM_u(x)}{NET_h},$$

The proposed algorithm checks the condition stated in Eq. (5), for all VMs our method finds the VM which took maximum time frame for migration. In Equation (5.1), $RAM_u(v)$ we find the amount of utilized RAM used by VM $v$. Similarly, $RAM_u(x)$ is the utilized RAM by VM $x$. $NET_h$ is the unused network bandwidth which is unoccupied for the host $h$.

[C[2cm]{}|L[0.5cm]{}L[0.5cm]{}L[0.5cm]{}L[0.5cm]{}L[0.5cm]{}L[0.5cm]{}]{} **Server**&**0%**&**10%**&**20%**&**30%**&**40%**&**50%**\
HP ProLiant G4 & 86 & 89.4 & 92.6 & 96 & 99.5 & 102\
HP ProLiant G5 & 93.7 & 97 & 101 & 105 & 110 & 116\

[C[2cm]{}|L[0.5cm]{}L[0.5cm]{}L[0.5cm]{}L[0.5cm]{}L[0.5cm]{}]{} **Server**&**60%**&**70%**&**80%**&**90%**&**100%**\
HP ProLiant G4 & 106 & 108 & 112 & 114 & 117\
HP ProLiant G5 & 121 & 125 & 129 & 133 & 135\

Algorithm for Virtual Machine Selection
=======================================

The pseudocode of our proposed Energy Aware VM Selection (EAVMS) algorithm is presented 