thorough knowledge on future events is not imaginable through the control of algorithms. Such events deal with online problems. The optimization issue where input is received in an online manner and output is also produced online and is called an online problem, according to \[7\]. The algorithm developed for these types of problems is called an online algorithm. To characterise the efficiency and performance of these algorithms, we can apply a competitive analysis. Based on the online algorithm knowledge, a competitive analysis generates the worst possible input. The input of online algorithm maximizes the modest ratio which is based on the outside world. This input should not be confused with the internal states of algorithms such as internal memory and control.

Proposed method for VM Selection
================================

In this section we are going to propose a new policy for VM selection. Our proposed policy finds the appropriate VMs for migration.

  ------------------------------------------------------------
  **Algorithm 1:**
  1 Input: vmList from host Output: Selected VM
  2 mVms $\leftarrow$ get MVms(host)
  3 if mVms is NULL then
  4 $\vert$ return null
  5 else
  6 $\vert$ vmToM $\leftarrow$ null
  7 $\vert$ nM $\leftarrow$ Double.MAX\_VALUE
  8 $\vert$ foreach vm in mVMs do
  9 $\vert$ $\vert$ if vm.isInM() 