Data Sets Replicas Placements Strategy from Cost-Effective View in the Cloud

Algorithm 4

Replicas placements with approximate minimum management cost.

Input: Graph , , , , ) with edge-nodes weighted as (, );

Output: The nodes set for replicas placements.

(01) Generate a minimum-cost spanning tree from using Kruskal Algorithm;

(02) = node with maximum degree;

(03) While ≥ 2 do

(04)  Begin

(05)     = node with maximum degree;

(06)    Print ;

(07)    For and do

(08) If (

(09)  Begin

(10)    Delete ;

(11)    If Delete ;

(12)  EndIF

(13)  Delete ;

(14)   = node with maximum degree;

(15)   EndWhile

(16) End.