You can calculate the total cost of every adjacency servers firstly, such as Si and Si+1. There are two situations: (1) a copy of the file is placed at Si or Si+1, the total cost of the configuration of these two servers is min(Ci, Ci+1 + 1); (2) neither server has a copy of the file, the total cost of the configuration of these two servers is 2. Now you can image there are n/2 servers, at each server the access cost is 2 if it does not hold a copy of the file, or it has the placement cost which is min(Ci, Ci+1 +1) if it hold a copy of the file. you can continue to use the same approach to get n/4 servers, n/8 servers,..., until only 1 server.
-- rainix --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
