Fast Data Access through Nearest Location-Based Replica Placement

<table class="table-group" id="tab1"><tr><td><table class="table"><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr class="thead"><td class="align_left">Proposed genetic algorithm</td><td class="align_center">Genetic algorithm without threshold frequency</td></tr><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr><td class="align_left">248.94</td><td class="align_center">249.19</td></tr><tr class="table-tr"><td colspan="2"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

<div>50 data centers with 25 VM and 100 user bases in 1000 s.</div>

Scientific Programming

tab1

Table 1

Table 1: Fast Data Access through Nearest Location-Based Replica Placement 