Research Article
Fast Data Access through Nearest Location-Based Replica Placement
Algorithm 1
Nearest location-based replica selection and placement algorithm.
(1) | Initialize population with data centers of Index table | (2) | Initialize user base | (3) | Initialize broker | (4) | Initialize index table | (5) | Initialize population of all data centers | (6) | Initialize index | (7) | Initialize data center controller | (8) | Initialize Internet characteristics with latency order by region | (9) | Initialize broker with Internet characteristic values | (10) | Save the best solution with its fitness | (11) | while best data center is not found do | (12) | SELECT parents | (13) | RECOMBINE pairs of regions | (14) | MUTATE the resulting regions | (15) | EVALUATE data centers based on latencies | (16) | SELECT individuals for the new generation | | end | (17) | Function select lowest latency data center | (18) | Initialize characteristic lists in lowest latency first calculated from regions | (19) | if datacenter has a fitness value better than other data centers then | (20) | select best first data center located at first top two positions in the proximity list | (21) | else if more than two data centers are located with similar latencies then | | then | | select two centers randomly and place data at both of them. |
|